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


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:19:32,021 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:19:32,024 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:19:32,057 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:19:32,057 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:19:32,058 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:19:32,060 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:19:32,061 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:19:32,063 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:19:32,064 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:19:32,065 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:19:32,066 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:19:32,066 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:19:32,067 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:19:32,069 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:19:32,070 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:19:32,071 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:19:32,072 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:19:32,073 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:19:32,075 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:19:32,077 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:19:32,078 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:19:32,079 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:19:32,080 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:19:32,082 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:19:32,083 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:19:32,083 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:19:32,084 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:19:32,084 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:19:32,085 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:19:32,085 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:19:32,086 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:19:32,087 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:19:32,088 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:19:32,089 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:19:32,089 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:19:32,089 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:19:32,090 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:19:32,090 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:19:32,091 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:19:32,092 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:19:32,092 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-16 11:19:32,115 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 11:19:32,116 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:19:32,117 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:19:32,117 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 11:19:32,117 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 11:19:32,118 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:19:32,118 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 11:19:32,118 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 11:19:32,118 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 11:19:32,118 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 11:19:32,119 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:19:32,119 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:19:32,119 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:19:32,119 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 11:19:32,119 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 11:19:32,120 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 11:19:32,120 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:19:32,120 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:19:32,120 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 11:19:32,121 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 11:19:32,121 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 11:19:32,121 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:19:32,121 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:19:32,121 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:19:32,122 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:19:32,122 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 11:19:32,122 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:19:32,122 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:19:32,122 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-16 11:19:32,123 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:19:32,458 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:19:32,478 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:19:32,483 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:19:32,485 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 11:19:32,486 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 11:19:32,487 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i
[2020-10-16 11:19:32,556 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/427ea3fe3/9949a6f1b142439d85cec96327125ddc/FLAGbd14bda2f
[2020-10-16 11:19:33,174 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 11:19:33,175 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i
[2020-10-16 11:19:33,194 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/427ea3fe3/9949a6f1b142439d85cec96327125ddc/FLAGbd14bda2f
[2020-10-16 11:19:33,395 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/427ea3fe3/9949a6f1b142439d85cec96327125ddc
[2020-10-16 11:19:33,406 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:19:33,409 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:19:33,413 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:19:33,414 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:19:33,418 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:19:33,419 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:19:33" (1/1) ...
[2020-10-16 11:19:33,424 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634d4812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33, skipping insertion in model container
[2020-10-16 11:19:33,424 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:19:33" (1/1) ...
[2020-10-16 11:19:33,435 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 11:19:33,509 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:19:34,033 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:19:34,054 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 11:19:34,128 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:19:34,224 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 11:19:34,225 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:34 WrapperNode
[2020-10-16 11:19:34,225 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:19:34,226 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:19:34,226 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:19:34,226 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:19:34,235 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:34" (1/1) ...
[2020-10-16 11:19:34,256 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:34" (1/1) ...
[2020-10-16 11:19:34,293 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:19:34,293 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:19:34,294 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:19:34,294 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:19:34,306 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:34" (1/1) ...
[2020-10-16 11:19:34,306 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:34" (1/1) ...
[2020-10-16 11:19:34,315 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:34" (1/1) ...
[2020-10-16 11:19:34,316 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:34" (1/1) ...
[2020-10-16 11:19:34,334 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:34" (1/1) ...
[2020-10-16 11:19:34,338 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:34" (1/1) ...
[2020-10-16 11:19:34,343 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:34" (1/1) ...
[2020-10-16 11:19:34,348 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:19:34,364 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:19:34,364 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:19:34,365 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:19:34,365 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:34" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:19:34,434 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:19:34,434 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:19:34,434 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:19:34,435 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:19:34,435 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:19:34,435 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:19:34,435 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:19:34,436 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:19:34,436 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 11:19:34,436 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 11:19:34,436 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:19:34,436 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:19:34,437 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:19:34,439 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 11:19:36,633 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:19:36,633 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:19:36,636 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:19:36 BoogieIcfgContainer
[2020-10-16 11:19:36,636 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:19:36,637 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:19:36,637 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:19:36,641 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:19:36,642 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:19:33" (1/3) ...
[2020-10-16 11:19:36,643 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e004c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:19:36, skipping insertion in model container
[2020-10-16 11:19:36,643 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:34" (2/3) ...
[2020-10-16 11:19:36,644 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e004c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:19:36, skipping insertion in model container
[2020-10-16 11:19:36,644 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:19:36" (3/3) ...
[2020-10-16 11:19:36,646 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe017_pso.oepc.i
[2020-10-16 11:19:36,658 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:19:36,658 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:19:36,666 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:19:36,667 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:19:36,715 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,715 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,715 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,715 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,716 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,716 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,716 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,717 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,717 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,717 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,717 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,718 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,718 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,718 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,718 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,719 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,719 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,719 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,720 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,720 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,720 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,720 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,720 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,721 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,721 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,721 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,721 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,721 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,722 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,722 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,723 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,723 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,723 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,724 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,724 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,724 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,725 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,725 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,726 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,726 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,727 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,727 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,728 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,735 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,737 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,737 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,737 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,737 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,737 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,738 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,738 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,740 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,740 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,740 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,741 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,741 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,741 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,741 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,741 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,742 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,742 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,744 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,745 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,745 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,746 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,746 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,746 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,746 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,746 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,747 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,747 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:36,748 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:19:36,763 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 11:19:36,785 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:19:36,785 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 11:19:36,786 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:19:36,786 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:19:36,787 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:19:36,787 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 11:19:36,787 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:19:36,787 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:19:36,807 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:19:36,810 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow
[2020-10-16 11:19:36,813 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 195 flow
[2020-10-16 11:19:36,815 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow
[2020-10-16 11:19:36,861 INFO  L129       PetriNetUnfolder]: 2/87 cut-off events.
[2020-10-16 11:19:36,862 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:19:36,867 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. 
[2020-10-16 11:19:36,870 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1560
[2020-10-16 11:19:37,708 WARN  L193               SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:19:37,828 WARN  L193               SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 11:19:37,872 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:37,873 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,875 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:37,875 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,904 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:37,904 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,907 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:37,907 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,947 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,948 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:37,949 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,949 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:37,953 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,954 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:37,957 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:37,957 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:37,978 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:37,979 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:37,980 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,981 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:37,984 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,984 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:37,987 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:37,988 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:38,040 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,041 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,042 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,042 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,045 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,046 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:38,049 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:38,049 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:38,067 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,068 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,069 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,069 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,072 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,072 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:38,075 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:38,076 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:38,261 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,262 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,264 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,265 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,274 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 11:19:38,277 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:38,283 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,284 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,373 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,373 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,376 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,377 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,378 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,379 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,381 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,382 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,384 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,385 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,386 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,389 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,392 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,392 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,394 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,394 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,395 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,396 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,491 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,492 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,493 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,493 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,520 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,520 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,521 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,521 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,565 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,566 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,568 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,569 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,570 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,570 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,573 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,574 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,576 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,576 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,577 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,578 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,580 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,580 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,581 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,582 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,584 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,585 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,630 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,631 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,632 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,632 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,635 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 11:19:38,636 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:38,638 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,639 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,029 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:39,029 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:39,048 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,049 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,050 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,050 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,053 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,054 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:39,056 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,057 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:39,058 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,058 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:39,061 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,061 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,064 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,064 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,066 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,066 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,108 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,109 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,110 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,111 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,113 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 11:19:39,114 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:39,117 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,117 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,159 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,159 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,160 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,161 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,181 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,181 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,182 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,183 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,212 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,213 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:39,214 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term
[2020-10-16 11:19:39,238 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:39,261 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,262 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,263 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,263 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,295 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2020-10-16 11:19:39,295 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,296 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,297 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,326 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,327 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,328 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,328 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,329 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,329 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,332 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,333 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,334 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,334 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,358 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,358 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,359 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,359 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,374 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,374 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,375 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,375 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,404 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,405 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,405 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,406 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,422 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,423 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:39,423 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term
[2020-10-16 11:19:39,424 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:39,458 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,458 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:39,464 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,465 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,466 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,466 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,468 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,468 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:39,470 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,471 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:39,472 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,472 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:39,474 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,474 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,476 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,477 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,478 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,478 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,516 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,516 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,517 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,517 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,520 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 11:19:39,520 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:39,523 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,523 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,828 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,829 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,830 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,830 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,832 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 11:19:39,832 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:39,834 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,835 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,875 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,875 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:39,877 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,878 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,879 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,879 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,881 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,881 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:39,883 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,884 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:39,885 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,885 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:39,887 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,888 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,890 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,890 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,891 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,892 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,957 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,957 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,958 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,958 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,988 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 11:19:39,989 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:39,994 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,995 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:40,019 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:40,019 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:40,036 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:40,036 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:40,037 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:40,038 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:40,040 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:40,040 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:40,041 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:40,042 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:40,043 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:40,044 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:40,046 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:40,046 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:40,048 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:40,048 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:40,050 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:40,050 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:40,270 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:40,270 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:40,271 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:40,271 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:40,289 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:40,290 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:40,291 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:40,291 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:41,394 WARN  L193               SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 229 DAG size of output: 189
[2020-10-16 11:19:41,406 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term
[2020-10-16 11:19:41,407 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:41,407 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:41,407 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:42,356 WARN  L193               SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 108
[2020-10-16 11:19:42,743 WARN  L193               SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83
[2020-10-16 11:19:43,973 WARN  L193               SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 243 DAG size of output: 203
[2020-10-16 11:19:43,985 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term
[2020-10-16 11:19:43,985 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:43,986 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:43,986 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:45,172 WARN  L193               SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 159 DAG size of output: 130
[2020-10-16 11:19:45,279 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,280 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,281 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,281 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,283 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,284 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,285 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,286 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,306 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,306 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,308 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,308 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,310 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,310 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,312 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,312 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,344 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,345 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,345 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,346 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,347 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,348 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,349 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,350 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,365 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,366 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,366 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,367 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,370 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,370 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,372 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,373 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,433 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:19:45,433 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,470 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,470 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,471 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,471 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,472 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,473 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,474 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,475 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,491 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,492 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,492 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,493 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,495 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,495 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,497 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,497 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,529 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,530 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,530 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,531 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,532 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,533 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,534 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,535 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,548 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,549 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,550 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,550 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,552 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,552 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,554 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,555 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,578 INFO  L132        LiptonReduction]: Checked pairs total: 4070
[2020-10-16 11:19:45,578 INFO  L134        LiptonReduction]: Total number of compositions: 78
[2020-10-16 11:19:45,595 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow
[2020-10-16 11:19:45,664 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states.
[2020-10-16 11:19:45,666 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states.
[2020-10-16 11:19:45,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-10-16 11:19:45,675 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:45,676 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-10-16 11:19:45,677 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:45,683 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:45,684 INFO  L82        PathProgramCache]: Analyzing trace with hash 1035167, now seen corresponding path program 1 times
[2020-10-16 11:19:45,693 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:45,693 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72765526]
[2020-10-16 11:19:45,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:45,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:45,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:45,952 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72765526]
[2020-10-16 11:19:45,953 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:45,953 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:19:45,954 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940044498]
[2020-10-16 11:19:45,959 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:45,960 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:45,976 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:45,977 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:45,980 INFO  L87              Difference]: Start difference. First operand 662 states. Second operand 3 states.
[2020-10-16 11:19:46,093 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:46,093 INFO  L93              Difference]: Finished difference Result 552 states and 1697 transitions.
[2020-10-16 11:19:46,095 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:19:46,099 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2020-10-16 11:19:46,099 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:46,133 INFO  L225             Difference]: With dead ends: 552
[2020-10-16 11:19:46,133 INFO  L226             Difference]: Without dead ends: 452
[2020-10-16 11:19:46,135 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:46,166 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 452 states.
[2020-10-16 11:19:46,230 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452.
[2020-10-16 11:19:46,231 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 452 states.
[2020-10-16 11:19:46,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions.
[2020-10-16 11:19:46,239 INFO  L78                 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3
[2020-10-16 11:19:46,239 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:46,240 INFO  L481      AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions.
[2020-10-16 11:19:46,240 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:46,240 INFO  L276                IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions.
[2020-10-16 11:19:46,241 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 11:19:46,242 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:46,242 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:46,242 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:19:46,242 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:46,243 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:46,243 INFO  L82        PathProgramCache]: Analyzing trace with hash 793045883, now seen corresponding path program 1 times
[2020-10-16 11:19:46,243 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:46,243 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732300186]
[2020-10-16 11:19:46,244 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:46,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:46,353 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:46,354 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732300186]
[2020-10-16 11:19:46,354 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:46,354 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:19:46,355 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479083867]
[2020-10-16 11:19:46,356 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:46,357 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:46,357 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:46,357 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:46,358 INFO  L87              Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states.
[2020-10-16 11:19:46,379 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:46,379 INFO  L93              Difference]: Finished difference Result 442 states and 1324 transitions.
[2020-10-16 11:19:46,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:19:46,380 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 11:19:46,381 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:46,385 INFO  L225             Difference]: With dead ends: 442
[2020-10-16 11:19:46,385 INFO  L226             Difference]: Without dead ends: 442
[2020-10-16 11:19:46,386 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:46,389 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 442 states.
[2020-10-16 11:19:46,409 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442.
[2020-10-16 11:19:46,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 442 states.
[2020-10-16 11:19:46,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1324 transitions.
[2020-10-16 11:19:46,413 INFO  L78                 Accepts]: Start accepts. Automaton has 442 states and 1324 transitions. Word has length 9
[2020-10-16 11:19:46,414 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:46,414 INFO  L481      AbstractCegarLoop]: Abstraction has 442 states and 1324 transitions.
[2020-10-16 11:19:46,414 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:46,415 INFO  L276                IsEmpty]: Start isEmpty. Operand 442 states and 1324 transitions.
[2020-10-16 11:19:46,416 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 11:19:46,416 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:46,417 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:46,417 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:19:46,417 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:46,417 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:46,417 INFO  L82        PathProgramCache]: Analyzing trace with hash -1657178972, now seen corresponding path program 1 times
[2020-10-16 11:19:46,418 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:46,418 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014926245]
[2020-10-16 11:19:46,418 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:46,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:46,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:46,593 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014926245]
[2020-10-16 11:19:46,593 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:46,593 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:19:46,594 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432980836]
[2020-10-16 11:19:46,594 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:46,594 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:46,594 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:46,595 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:46,595 INFO  L87              Difference]: Start difference. First operand 442 states and 1324 transitions. Second operand 3 states.
[2020-10-16 11:19:46,638 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:46,639 INFO  L93              Difference]: Finished difference Result 439 states and 1313 transitions.
[2020-10-16 11:19:46,640 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:19:46,640 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-10-16 11:19:46,640 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:46,644 INFO  L225             Difference]: With dead ends: 439
[2020-10-16 11:19:46,644 INFO  L226             Difference]: Without dead ends: 439
[2020-10-16 11:19:46,645 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:46,647 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 439 states.
[2020-10-16 11:19:46,659 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439.
[2020-10-16 11:19:46,660 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 439 states.
[2020-10-16 11:19:46,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1313 transitions.
[2020-10-16 11:19:46,663 INFO  L78                 Accepts]: Start accepts. Automaton has 439 states and 1313 transitions. Word has length 10
[2020-10-16 11:19:46,663 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:46,663 INFO  L481      AbstractCegarLoop]: Abstraction has 439 states and 1313 transitions.
[2020-10-16 11:19:46,663 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:46,664 INFO  L276                IsEmpty]: Start isEmpty. Operand 439 states and 1313 transitions.
[2020-10-16 11:19:46,666 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 11:19:46,666 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:46,666 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:46,666 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:19:46,666 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:46,667 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:46,667 INFO  L82        PathProgramCache]: Analyzing trace with hash -872477858, now seen corresponding path program 1 times
[2020-10-16 11:19:46,667 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:46,667 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878292785]
[2020-10-16 11:19:46,668 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:46,698 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:46,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:46,840 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878292785]
[2020-10-16 11:19:46,840 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:46,840 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:19:46,841 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119283057]
[2020-10-16 11:19:46,841 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:19:46,841 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:46,842 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:19:46,842 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:46,842 INFO  L87              Difference]: Start difference. First operand 439 states and 1313 transitions. Second operand 6 states.
[2020-10-16 11:19:46,984 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:46,985 INFO  L93              Difference]: Finished difference Result 440 states and 1313 transitions.
[2020-10-16 11:19:46,986 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:19:46,986 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 11
[2020-10-16 11:19:46,986 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:46,990 INFO  L225             Difference]: With dead ends: 440
[2020-10-16 11:19:46,990 INFO  L226             Difference]: Without dead ends: 440
[2020-10-16 11:19:46,991 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-16 11:19:46,993 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 440 states.
[2020-10-16 11:19:47,003 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 432.
[2020-10-16 11:19:47,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 432 states.
[2020-10-16 11:19:47,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1285 transitions.
[2020-10-16 11:19:47,006 INFO  L78                 Accepts]: Start accepts. Automaton has 432 states and 1285 transitions. Word has length 11
[2020-10-16 11:19:47,007 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:47,007 INFO  L481      AbstractCegarLoop]: Abstraction has 432 states and 1285 transitions.
[2020-10-16 11:19:47,007 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:19:47,007 INFO  L276                IsEmpty]: Start isEmpty. Operand 432 states and 1285 transitions.
[2020-10-16 11:19:47,009 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:19:47,009 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:47,009 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:47,010 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:19:47,010 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:47,010 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:47,010 INFO  L82        PathProgramCache]: Analyzing trace with hash 1031193486, now seen corresponding path program 1 times
[2020-10-16 11:19:47,011 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:47,011 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5690390]
[2020-10-16 11:19:47,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:47,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:47,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:47,071 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5690390]
[2020-10-16 11:19:47,072 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:47,072 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:19:47,072 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406202463]
[2020-10-16 11:19:47,072 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:47,073 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:47,073 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:47,073 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:47,073 INFO  L87              Difference]: Start difference. First operand 432 states and 1285 transitions. Second operand 3 states.
[2020-10-16 11:19:47,092 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:47,092 INFO  L93              Difference]: Finished difference Result 611 states and 1741 transitions.
[2020-10-16 11:19:47,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:19:47,094 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-16 11:19:47,094 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:47,098 INFO  L225             Difference]: With dead ends: 611
[2020-10-16 11:19:47,098 INFO  L226             Difference]: Without dead ends: 458
[2020-10-16 11:19:47,098 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-16 11:19:47,101 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 458 states.
[2020-10-16 11:19:47,111 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 419.
[2020-10-16 11:19:47,112 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 419 states.
[2020-10-16 11:19:47,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1190 transitions.
[2020-10-16 11:19:47,115 INFO  L78                 Accepts]: Start accepts. Automaton has 419 states and 1190 transitions. Word has length 12
[2020-10-16 11:19:47,115 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:47,115 INFO  L481      AbstractCegarLoop]: Abstraction has 419 states and 1190 transitions.
[2020-10-16 11:19:47,115 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:47,115 INFO  L276                IsEmpty]: Start isEmpty. Operand 419 states and 1190 transitions.
[2020-10-16 11:19:47,117 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:19:47,117 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:47,117 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:47,117 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:19:47,118 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:47,118 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:47,118 INFO  L82        PathProgramCache]: Analyzing trace with hash -1632248420, now seen corresponding path program 1 times
[2020-10-16 11:19:47,118 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:47,119 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113632513]
[2020-10-16 11:19:47,119 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:47,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:47,174 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:47,174 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113632513]
[2020-10-16 11:19:47,174 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:47,175 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:19:47,175 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023832170]
[2020-10-16 11:19:47,175 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:47,175 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:47,176 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:47,176 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:47,176 INFO  L87              Difference]: Start difference. First operand 419 states and 1190 transitions. Second operand 3 states.
[2020-10-16 11:19:47,186 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:47,187 INFO  L93              Difference]: Finished difference Result 409 states and 1157 transitions.
[2020-10-16 11:19:47,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:19:47,188 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-16 11:19:47,188 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:47,191 INFO  L225             Difference]: With dead ends: 409
[2020-10-16 11:19:47,192 INFO  L226             Difference]: Without dead ends: 409
[2020-10-16 11:19:47,192 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:47,194 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 409 states.
[2020-10-16 11:19:47,202 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409.
[2020-10-16 11:19:47,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 409 states.
[2020-10-16 11:19:47,205 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1157 transitions.
[2020-10-16 11:19:47,205 INFO  L78                 Accepts]: Start accepts. Automaton has 409 states and 1157 transitions. Word has length 12
[2020-10-16 11:19:47,206 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:47,206 INFO  L481      AbstractCegarLoop]: Abstraction has 409 states and 1157 transitions.
[2020-10-16 11:19:47,206 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:47,206 INFO  L276                IsEmpty]: Start isEmpty. Operand 409 states and 1157 transitions.
[2020-10-16 11:19:47,207 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:19:47,207 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:47,207 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:47,208 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:19:47,208 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:47,208 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:47,208 INFO  L82        PathProgramCache]: Analyzing trace with hash 380051200, now seen corresponding path program 1 times
[2020-10-16 11:19:47,208 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:47,209 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75451469]
[2020-10-16 11:19:47,209 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:47,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:47,308 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:47,309 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75451469]
[2020-10-16 11:19:47,309 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:47,309 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:19:47,309 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952716314]
[2020-10-16 11:19:47,310 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:19:47,310 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:47,310 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:19:47,310 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:19:47,311 INFO  L87              Difference]: Start difference. First operand 409 states and 1157 transitions. Second operand 4 states.
[2020-10-16 11:19:47,356 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:47,357 INFO  L93              Difference]: Finished difference Result 407 states and 1150 transitions.
[2020-10-16 11:19:47,358 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:19:47,358 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-16 11:19:47,358 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:47,361 INFO  L225             Difference]: With dead ends: 407
[2020-10-16 11:19:47,361 INFO  L226             Difference]: Without dead ends: 407
[2020-10-16 11:19:47,362 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:19:47,363 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 407 states.
[2020-10-16 11:19:47,371 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407.
[2020-10-16 11:19:47,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 407 states.
[2020-10-16 11:19:47,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1150 transitions.
[2020-10-16 11:19:47,374 INFO  L78                 Accepts]: Start accepts. Automaton has 407 states and 1150 transitions. Word has length 12
[2020-10-16 11:19:47,374 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:47,374 INFO  L481      AbstractCegarLoop]: Abstraction has 407 states and 1150 transitions.
[2020-10-16 11:19:47,374 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:19:47,374 INFO  L276                IsEmpty]: Start isEmpty. Operand 407 states and 1150 transitions.
[2020-10-16 11:19:47,375 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:19:47,375 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:47,376 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:47,376 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:19:47,376 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:47,376 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:47,376 INFO  L82        PathProgramCache]: Analyzing trace with hash 883850748, now seen corresponding path program 1 times
[2020-10-16 11:19:47,377 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:47,377 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997228661]
[2020-10-16 11:19:47,377 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:47,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:47,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:47,429 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997228661]
[2020-10-16 11:19:47,429 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:47,430 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:19:47,430 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250206600]
[2020-10-16 11:19:47,430 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:19:47,430 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:47,431 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:19:47,431 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:19:47,431 INFO  L87              Difference]: Start difference. First operand 407 states and 1150 transitions. Second operand 4 states.
[2020-10-16 11:19:47,482 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:47,482 INFO  L93              Difference]: Finished difference Result 456 states and 1282 transitions.
[2020-10-16 11:19:47,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:19:47,483 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-16 11:19:47,483 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:47,486 INFO  L225             Difference]: With dead ends: 456
[2020-10-16 11:19:47,487 INFO  L226             Difference]: Without dead ends: 456
[2020-10-16 11:19:47,487 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:19:47,489 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 456 states.
[2020-10-16 11:19:47,498 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 446.
[2020-10-16 11:19:47,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 446 states.
[2020-10-16 11:19:47,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1259 transitions.
[2020-10-16 11:19:47,501 INFO  L78                 Accepts]: Start accepts. Automaton has 446 states and 1259 transitions. Word has length 12
[2020-10-16 11:19:47,501 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:47,502 INFO  L481      AbstractCegarLoop]: Abstraction has 446 states and 1259 transitions.
[2020-10-16 11:19:47,502 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:19:47,502 INFO  L276                IsEmpty]: Start isEmpty. Operand 446 states and 1259 transitions.
[2020-10-16 11:19:47,503 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 11:19:47,503 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:47,503 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:47,503 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:19:47,503 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:47,504 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:47,504 INFO  L82        PathProgramCache]: Analyzing trace with hash 939905806, now seen corresponding path program 1 times
[2020-10-16 11:19:47,504 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:47,506 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776841274]
[2020-10-16 11:19:47,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:47,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:47,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:47,688 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776841274]
[2020-10-16 11:19:47,688 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:47,688 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:19:47,688 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969519959]
[2020-10-16 11:19:47,689 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:19:47,689 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:47,690 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:19:47,690 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:19:47,690 INFO  L87              Difference]: Start difference. First operand 446 states and 1259 transitions. Second operand 5 states.
[2020-10-16 11:19:47,804 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:47,804 INFO  L93              Difference]: Finished difference Result 442 states and 1245 transitions.
[2020-10-16 11:19:47,805 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:19:47,806 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-16 11:19:47,806 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:47,809 INFO  L225             Difference]: With dead ends: 442
[2020-10-16 11:19:47,809 INFO  L226             Difference]: Without dead ends: 442
[2020-10-16 11:19:47,810 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:47,812 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 442 states.
[2020-10-16 11:19:47,821 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442.
[2020-10-16 11:19:47,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 442 states.
[2020-10-16 11:19:47,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1245 transitions.
[2020-10-16 11:19:47,823 INFO  L78                 Accepts]: Start accepts. Automaton has 442 states and 1245 transitions. Word has length 13
[2020-10-16 11:19:47,823 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:47,824 INFO  L481      AbstractCegarLoop]: Abstraction has 442 states and 1245 transitions.
[2020-10-16 11:19:47,824 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:19:47,824 INFO  L276                IsEmpty]: Start isEmpty. Operand 442 states and 1245 transitions.
[2020-10-16 11:19:47,825 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 11:19:47,825 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:47,825 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:47,826 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:19:47,826 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:47,826 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:47,826 INFO  L82        PathProgramCache]: Analyzing trace with hash 1629567973, now seen corresponding path program 1 times
[2020-10-16 11:19:47,826 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:47,827 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290636707]
[2020-10-16 11:19:47,827 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:47,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:47,938 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:47,939 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290636707]
[2020-10-16 11:19:47,939 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:47,939 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:19:47,939 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732294518]
[2020-10-16 11:19:47,940 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:19:47,940 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:47,940 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:19:47,940 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:19:47,941 INFO  L87              Difference]: Start difference. First operand 442 states and 1245 transitions. Second operand 5 states.
[2020-10-16 11:19:48,026 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:48,026 INFO  L93              Difference]: Finished difference Result 438 states and 1230 transitions.
[2020-10-16 11:19:48,027 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:19:48,027 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-16 11:19:48,028 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:48,031 INFO  L225             Difference]: With dead ends: 438
[2020-10-16 11:19:48,031 INFO  L226             Difference]: Without dead ends: 438
[2020-10-16 11:19:48,032 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:48,033 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 438 states.
[2020-10-16 11:19:48,042 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434.
[2020-10-16 11:19:48,043 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 434 states.
[2020-10-16 11:19:48,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1219 transitions.
[2020-10-16 11:19:48,045 INFO  L78                 Accepts]: Start accepts. Automaton has 434 states and 1219 transitions. Word has length 13
[2020-10-16 11:19:48,045 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:48,046 INFO  L481      AbstractCegarLoop]: Abstraction has 434 states and 1219 transitions.
[2020-10-16 11:19:48,046 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:19:48,046 INFO  L276                IsEmpty]: Start isEmpty. Operand 434 states and 1219 transitions.
[2020-10-16 11:19:48,047 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 11:19:48,047 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:48,047 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:48,047 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 11:19:48,048 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:48,048 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:48,048 INFO  L82        PathProgramCache]: Analyzing trace with hash 1393638489, now seen corresponding path program 1 times
[2020-10-16 11:19:48,048 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:48,048 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322522233]
[2020-10-16 11:19:48,049 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:48,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:48,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:48,139 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322522233]
[2020-10-16 11:19:48,139 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:48,139 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:19:48,140 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695842137]
[2020-10-16 11:19:48,140 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:19:48,140 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:48,141 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:19:48,141 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:19:48,141 INFO  L87              Difference]: Start difference. First operand 434 states and 1219 transitions. Second operand 4 states.
[2020-10-16 11:19:48,180 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:48,180 INFO  L93              Difference]: Finished difference Result 428 states and 1062 transitions.
[2020-10-16 11:19:48,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:19:48,181 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-16 11:19:48,182 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:48,184 INFO  L225             Difference]: With dead ends: 428
[2020-10-16 11:19:48,184 INFO  L226             Difference]: Without dead ends: 314
[2020-10-16 11:19:48,184 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:19:48,186 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 314 states.
[2020-10-16 11:19:48,192 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314.
[2020-10-16 11:19:48,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 314 states.
[2020-10-16 11:19:48,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 757 transitions.
[2020-10-16 11:19:48,194 INFO  L78                 Accepts]: Start accepts. Automaton has 314 states and 757 transitions. Word has length 14
[2020-10-16 11:19:48,194 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:48,194 INFO  L481      AbstractCegarLoop]: Abstraction has 314 states and 757 transitions.
[2020-10-16 11:19:48,195 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:19:48,195 INFO  L276                IsEmpty]: Start isEmpty. Operand 314 states and 757 transitions.
[2020-10-16 11:19:48,195 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:19:48,196 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:48,196 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:48,196 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 11:19:48,196 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:48,196 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:48,196 INFO  L82        PathProgramCache]: Analyzing trace with hash 211902524, now seen corresponding path program 1 times
[2020-10-16 11:19:48,197 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:48,197 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237806028]
[2020-10-16 11:19:48,197 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:48,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:48,314 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:48,314 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237806028]
[2020-10-16 11:19:48,314 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:48,315 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:19:48,315 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091614306]
[2020-10-16 11:19:48,315 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:19:48,316 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:48,316 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:19:48,316 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:19:48,316 INFO  L87              Difference]: Start difference. First operand 314 states and 757 transitions. Second operand 5 states.
[2020-10-16 11:19:48,369 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:48,369 INFO  L93              Difference]: Finished difference Result 261 states and 577 transitions.
[2020-10-16 11:19:48,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:19:48,370 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-16 11:19:48,370 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:48,372 INFO  L225             Difference]: With dead ends: 261
[2020-10-16 11:19:48,372 INFO  L226             Difference]: Without dead ends: 201
[2020-10-16 11:19:48,372 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:48,373 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2020-10-16 11:19:48,376 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191.
[2020-10-16 11:19:48,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 191 states.
[2020-10-16 11:19:48,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 409 transitions.
[2020-10-16 11:19:48,378 INFO  L78                 Accepts]: Start accepts. Automaton has 191 states and 409 transitions. Word has length 15
[2020-10-16 11:19:48,379 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:48,380 INFO  L481      AbstractCegarLoop]: Abstraction has 191 states and 409 transitions.
[2020-10-16 11:19:48,380 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:19:48,380 INFO  L276                IsEmpty]: Start isEmpty. Operand 191 states and 409 transitions.
[2020-10-16 11:19:48,380 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:19:48,381 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:48,381 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:48,381 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 11:19:48,381 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:48,381 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:48,382 INFO  L82        PathProgramCache]: Analyzing trace with hash 1129550295, now seen corresponding path program 1 times
[2020-10-16 11:19:48,382 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:48,382 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767106910]
[2020-10-16 11:19:48,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:48,450 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:48,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:48,554 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767106910]
[2020-10-16 11:19:48,554 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:48,554 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:19:48,555 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177187983]
[2020-10-16 11:19:48,555 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:19:48,556 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:48,556 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:19:48,556 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:48,557 INFO  L87              Difference]: Start difference. First operand 191 states and 409 transitions. Second operand 6 states.
[2020-10-16 11:19:48,637 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:48,637 INFO  L93              Difference]: Finished difference Result 172 states and 370 transitions.
[2020-10-16 11:19:48,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 11:19:48,639 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2020-10-16 11:19:48,639 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:48,640 INFO  L225             Difference]: With dead ends: 172
[2020-10-16 11:19:48,640 INFO  L226             Difference]: Without dead ends: 117
[2020-10-16 11:19:48,642 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:19:48,643 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2020-10-16 11:19:48,646 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113.
[2020-10-16 11:19:48,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2020-10-16 11:19:48,647 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 240 transitions.
[2020-10-16 11:19:48,647 INFO  L78                 Accepts]: Start accepts. Automaton has 113 states and 240 transitions. Word has length 17
[2020-10-16 11:19:48,648 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:48,648 INFO  L481      AbstractCegarLoop]: Abstraction has 113 states and 240 transitions.
[2020-10-16 11:19:48,648 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:19:48,648 INFO  L276                IsEmpty]: Start isEmpty. Operand 113 states and 240 transitions.
[2020-10-16 11:19:48,649 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:19:48,649 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:48,650 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:48,650 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 11:19:48,650 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:48,650 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:48,651 INFO  L82        PathProgramCache]: Analyzing trace with hash 444947368, now seen corresponding path program 1 times
[2020-10-16 11:19:48,651 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:48,651 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905299345]
[2020-10-16 11:19:48,651 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:48,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:48,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:48,917 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905299345]
[2020-10-16 11:19:48,917 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:48,918 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 11:19:48,918 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123521238]
[2020-10-16 11:19:48,918 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 11:19:48,918 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:48,919 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 11:19:48,919 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:19:48,919 INFO  L87              Difference]: Start difference. First operand 113 states and 240 transitions. Second operand 8 states.
[2020-10-16 11:19:49,115 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:49,115 INFO  L93              Difference]: Finished difference Result 170 states and 343 transitions.
[2020-10-16 11:19:49,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 11:19:49,116 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 20
[2020-10-16 11:19:49,116 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:49,117 INFO  L225             Difference]: With dead ends: 170
[2020-10-16 11:19:49,117 INFO  L226             Difference]: Without dead ends: 140
[2020-10-16 11:19:49,118 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:19:49,119 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2020-10-16 11:19:49,121 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113.
[2020-10-16 11:19:49,122 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2020-10-16 11:19:49,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 232 transitions.
[2020-10-16 11:19:49,122 INFO  L78                 Accepts]: Start accepts. Automaton has 113 states and 232 transitions. Word has length 20
[2020-10-16 11:19:49,123 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:49,123 INFO  L481      AbstractCegarLoop]: Abstraction has 113 states and 232 transitions.
[2020-10-16 11:19:49,123 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 11:19:49,123 INFO  L276                IsEmpty]: Start isEmpty. Operand 113 states and 232 transitions.
[2020-10-16 11:19:49,123 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:19:49,124 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:49,124 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:49,124 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 11:19:49,124 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:49,124 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:49,124 INFO  L82        PathProgramCache]: Analyzing trace with hash 1757585640, now seen corresponding path program 2 times
[2020-10-16 11:19:49,125 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:49,125 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893743754]
[2020-10-16 11:19:49,125 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:49,149 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:49,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:49,277 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893743754]
[2020-10-16 11:19:49,277 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:49,277 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:19:49,277 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176932296]
[2020-10-16 11:19:49,278 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:19:49,278 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:49,278 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:19:49,278 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:19:49,278 INFO  L87              Difference]: Start difference. First operand 113 states and 232 transitions. Second operand 7 states.
[2020-10-16 11:19:49,462 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:49,462 INFO  L93              Difference]: Finished difference Result 139 states and 280 transitions.
[2020-10-16 11:19:49,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 11:19:49,464 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 20
[2020-10-16 11:19:49,464 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:49,465 INFO  L225             Difference]: With dead ends: 139
[2020-10-16 11:19:49,465 INFO  L226             Difference]: Without dead ends: 77
[2020-10-16 11:19:49,465 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90
[2020-10-16 11:19:49,466 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2020-10-16 11:19:49,471 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77.
[2020-10-16 11:19:49,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 77 states.
[2020-10-16 11:19:49,472 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 144 transitions.
[2020-10-16 11:19:49,472 INFO  L78                 Accepts]: Start accepts. Automaton has 77 states and 144 transitions. Word has length 20
[2020-10-16 11:19:49,472 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:49,472 INFO  L481      AbstractCegarLoop]: Abstraction has 77 states and 144 transitions.
[2020-10-16 11:19:49,472 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:19:49,472 INFO  L276                IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions.
[2020-10-16 11:19:49,473 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:19:49,473 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:49,473 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:49,473 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 11:19:49,474 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:49,474 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:49,474 INFO  L82        PathProgramCache]: Analyzing trace with hash 1467741448, now seen corresponding path program 3 times
[2020-10-16 11:19:49,474 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:49,474 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773673408]
[2020-10-16 11:19:49,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:49,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:19:49,532 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:19:49,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:19:49,591 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:19:49,651 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:19:49,653 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:19:49,653 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 11:19:49,654 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 11:19:49,667 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L2-->L818: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In1401575071 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In1401575071 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In1401575071 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In1401575071 256) 0))) (let ((.cse5 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (or (and .cse0 (= ~y~0_Out1401575071 ~y$w_buff0~0_In1401575071) .cse1) (and (or (and .cse2 (= ~y~0_Out1401575071 ~y~0_In1401575071)) (and .cse3 .cse4 (= ~y~0_Out1401575071 ~y$w_buff1~0_In1401575071))) .cse5)) (= ~y$r_buff1_thd0~0_Out1401575071 ~y$r_buff1_thd0~0_In1401575071) (= ~y$r_buff0_thd0~0_In1401575071 ~y$r_buff0_thd0~0_Out1401575071) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1401575071 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1401575071|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1401575071 0)) (or (and (= ~y$w_buff0_used~0_In1401575071 ~y$w_buff0_used~0_Out1401575071) .cse5) (and .cse0 (= ~y$w_buff0_used~0_Out1401575071 0) .cse1)) (or (and .cse3 .cse4 (= ~y$w_buff1_used~0_Out1401575071 0)) (and .cse2 (= ~y$w_buff1_used~0_Out1401575071 ~y$w_buff1_used~0_In1401575071))))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1401575071|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1401575071, ~y$w_buff1~0=~y$w_buff1~0_In1401575071, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1401575071, ~y$w_buff0~0=~y$w_buff0~0_In1401575071, ~y~0=~y~0_In1401575071, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1401575071, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1401575071}  OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1401575071|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out1401575071, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1401575071|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1401575071|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1401575071|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1401575071|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1401575071|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1401575071|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1401575071, ~y$w_buff1~0=~y$w_buff1~0_In1401575071, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1401575071, ~y$w_buff0~0=~y$w_buff0~0_In1401575071, ~y~0=~y~0_Out1401575071, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1401575071, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1401575071}  AuxVars[]  AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-16 11:19:49,672 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,673 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,679 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,679 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,680 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,680 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,680 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,680 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,681 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,681 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,681 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,682 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,683 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,683 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,683 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,683 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,684 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,684 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,684 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,684 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,685 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,685 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,686 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,686 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,686 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,686 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,686 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,686 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,687 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,687 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,687 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,687 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,687 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,687 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,688 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,688 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,692 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,692 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,692 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,693 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,693 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,693 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,693 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,693 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,693 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,693 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,693 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,694 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,694 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,694 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,694 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,694 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,694 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,694 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,694 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,694 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,694 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,694 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,695 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,695 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,695 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,695 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,697 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:49,697 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:49,776 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:19:49 BasicIcfg
[2020-10-16 11:19:49,776 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:19:49,778 INFO  L168              Benchmark]: Toolchain (without parser) took 16370.36 ms. Allocated memory was 139.5 MB in the beginning and 438.3 MB in the end (delta: 298.8 MB). Free memory was 101.4 MB in the beginning and 228.5 MB in the end (delta: -127.1 MB). Peak memory consumption was 171.7 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:49,779 INFO  L168              Benchmark]: CDTParser took 1.54 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-10-16 11:19:49,779 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 812.06 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 101.2 MB in the beginning and 155.3 MB in the end (delta: -54.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:49,780 INFO  L168              Benchmark]: Boogie Procedure Inliner took 67.35 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:49,781 INFO  L168              Benchmark]: Boogie Preprocessor took 55.04 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:49,781 INFO  L168              Benchmark]: RCFGBuilder took 2271.91 ms. Allocated memory was 201.9 MB in the beginning and 249.0 MB in the end (delta: 47.2 MB). Free memory was 149.9 MB in the beginning and 175.4 MB in the end (delta: -25.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:49,782 INFO  L168              Benchmark]: TraceAbstraction took 13139.18 ms. Allocated memory was 249.0 MB in the beginning and 438.3 MB in the end (delta: 189.3 MB). Free memory was 173.5 MB in the beginning and 228.5 MB in the end (delta: -55.0 MB). Peak memory consumption was 134.3 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:49,786 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 1.54 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 812.06 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 101.2 MB in the beginning and 155.3 MB in the end (delta: -54.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 67.35 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 55.04 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2271.91 ms. Allocated memory was 201.9 MB in the beginning and 249.0 MB in the end (delta: 47.2 MB). Free memory was 149.9 MB in the beginning and 175.4 MB in the end (delta: -25.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 13139.18 ms. Allocated memory was 249.0 MB in the beginning and 438.3 MB in the end (delta: 189.3 MB). Free memory was 173.5 MB in the beginning and 228.5 MB in the end (delta: -55.0 MB). Peak memory consumption was 134.3 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    896 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 73 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.7s, 98 PlacesBefore, 35 PlacesAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1560 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 4070 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p2_EAX = 0;
[L701]               0  _Bool main$tmp_guard0;
[L702]               0  _Bool main$tmp_guard1;
[L704]               0  int x = 0;
[L706]               0  int y = 0;
[L707]               0  _Bool y$flush_delayed;
[L708]               0  int y$mem_tmp;
[L709]               0  _Bool y$r_buff0_thd0;
[L710]               0  _Bool y$r_buff0_thd1;
[L711]               0  _Bool y$r_buff0_thd2;
[L712]               0  _Bool y$r_buff0_thd3;
[L713]               0  _Bool y$r_buff1_thd0;
[L714]               0  _Bool y$r_buff1_thd1;
[L715]               0  _Bool y$r_buff1_thd2;
[L716]               0  _Bool y$r_buff1_thd3;
[L717]               0  _Bool y$read_delayed;
[L718]               0  int *y$read_delayed_var;
[L719]               0  int y$w_buff0;
[L720]               0  _Bool y$w_buff0_used;
[L721]               0  int y$w_buff1;
[L722]               0  _Bool y$w_buff1_used;
[L723]               0  _Bool weak$$choice0;
[L724]               0  _Bool weak$$choice2;
[L802]               0  pthread_t t2183;
[L803]  FCALL, FORK  0  pthread_create(&t2183, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L804]               0  pthread_t t2184;
[L728]               1  y$w_buff1 = y$w_buff0
[L729]               1  y$w_buff0 = 2
[L730]               1  y$w_buff1_used = y$w_buff0_used
[L731]               1  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    1  !expression
[L7]                 1  __VERIFIER_error()
[L733]               1  y$r_buff1_thd0 = y$r_buff0_thd0
[L734]               1  y$r_buff1_thd1 = y$r_buff0_thd1
[L735]               1  y$r_buff1_thd2 = y$r_buff0_thd2
[L736]               1  y$r_buff1_thd3 = y$r_buff0_thd3
[L737]               1  y$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L740]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L805]  FCALL, FORK  0  pthread_create(&t2184, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L757]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L760]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L760]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L761]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L761]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L762]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L762]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L763]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L763]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L764]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L764]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L767]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L769]               2  return 0;
[L806]               0  pthread_t t2185;
[L807]  FCALL, FORK  0  pthread_create(&t2185, ((void *)0), P2, ((void *)0))
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L774]               3  __unbuffered_p2_EAX = x
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L777]               3  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L780]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L780]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L781]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L781]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L782]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L782]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L783]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L783]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L784]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L784]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L787]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L789]               3  return 0;
[L743]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L743]  EXPR         1  y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y
[L743]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L743]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L744]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L744]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L745]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L745]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L746]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L746]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L747]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L750]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L752]               1  return 0;
[L809]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L820]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L821]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L822]               0  y$flush_delayed = weak$$choice2
[L823]               0  y$mem_tmp = y
[L824]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L824]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L825]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L825]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L825]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L825]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L826]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L826]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L826]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1
[L826]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L826]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L826]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L827]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L827]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L828]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L828]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L829]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L829]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L829]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L829]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L829]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L829]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L830]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L830]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L830]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0
[L830]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L830]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L830]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L831]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2)
[L832]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L832]               0  y = y$flush_delayed ? y$mem_tmp : y
[L833]               0  y$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 316 SDtfs, 334 SDslu, 477 SDs, 0 SdLazy, 342 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 102 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 22577 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...