/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/mix033_tso.oepc.i


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


This is Ultimate 0.1.25-c7e336b
[2020-10-05 22:41:39,336 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-05 22:41:39,338 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-05 22:41:39,363 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-05 22:41:39,364 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-05 22:41:39,365 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-05 22:41:39,366 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-05 22:41:39,368 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-05 22:41:39,370 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-05 22:41:39,371 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-05 22:41:39,372 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-05 22:41:39,373 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-05 22:41:39,373 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-05 22:41:39,374 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-05 22:41:39,375 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-05 22:41:39,376 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-05 22:41:39,377 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-05 22:41:39,378 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-05 22:41:39,380 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-05 22:41:39,382 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-05 22:41:39,384 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-05 22:41:39,385 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-05 22:41:39,386 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-05 22:41:39,387 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-05 22:41:39,393 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-05 22:41:39,393 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-05 22:41:39,394 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-05 22:41:39,395 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-05 22:41:39,395 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-05 22:41:39,396 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-05 22:41:39,396 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-05 22:41:39,397 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-05 22:41:39,398 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-05 22:41:39,399 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-05 22:41:39,400 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-05 22:41:39,400 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-05 22:41:39,400 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-05 22:41:39,401 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-05 22:41:39,401 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-05 22:41:39,402 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-05 22:41:39,403 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-05 22:41:39,403 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-05 22:41:39,427 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-05 22:41:39,428 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-05 22:41:39,429 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-05 22:41:39,429 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-05 22:41:39,429 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-05 22:41:39,430 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-05 22:41:39,430 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-05 22:41:39,430 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-05 22:41:39,430 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-05 22:41:39,430 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-05 22:41:39,430 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-05 22:41:39,431 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-05 22:41:39,431 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-05 22:41:39,431 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-05 22:41:39,431 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-05 22:41:39,431 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-05 22:41:39,431 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-05 22:41:39,432 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-05 22:41:39,432 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-05 22:41:39,432 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-05 22:41:39,432 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-05 22:41:39,433 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-05 22:41:39,433 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-05 22:41:39,433 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-05 22:41:39,433 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-05 22:41:39,433 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-05 22:41:39,433 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-05 22:41:39,434 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-05 22:41:39,434 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-05 22:41:39,434 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-05 22:41:39,766 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-05 22:41:39,783 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-05 22:41:39,786 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-05 22:41:39,788 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-05 22:41:39,788 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-05 22:41:39,789 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i
[2020-10-05 22:41:39,855 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4bfbdca/99dfa6548a554ac7b3f05f215498c19b/FLAG5a24d68f3
[2020-10-05 22:41:40,440 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-05 22:41:40,440 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i
[2020-10-05 22:41:40,457 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4bfbdca/99dfa6548a554ac7b3f05f215498c19b/FLAG5a24d68f3
[2020-10-05 22:41:40,732 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4bfbdca/99dfa6548a554ac7b3f05f215498c19b
[2020-10-05 22:41:40,740 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-05 22:41:40,742 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-05 22:41:40,743 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-05 22:41:40,744 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-05 22:41:40,750 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-05 22:41:40,751 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:41:40" (1/1) ...
[2020-10-05 22:41:40,754 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696d7bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:40, skipping insertion in model container
[2020-10-05 22:41:40,755 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:41:40" (1/1) ...
[2020-10-05 22:41:40,763 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-05 22:41:40,817 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-05 22:41:41,360 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-05 22:41:41,467 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-05 22:41:41,538 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-05 22:41:41,625 INFO  L208         MainTranslator]: Completed translation
[2020-10-05 22:41:41,625 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:41 WrapperNode
[2020-10-05 22:41:41,625 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-05 22:41:41,626 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-05 22:41:41,627 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-05 22:41:41,627 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-05 22:41:41,637 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:41" (1/1) ...
[2020-10-05 22:41:41,658 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:41" (1/1) ...
[2020-10-05 22:41:41,708 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-05 22:41:41,709 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-05 22:41:41,709 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-05 22:41:41,709 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-05 22:41:41,720 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:41" (1/1) ...
[2020-10-05 22:41:41,721 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:41" (1/1) ...
[2020-10-05 22:41:41,726 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:41" (1/1) ...
[2020-10-05 22:41:41,727 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:41" (1/1) ...
[2020-10-05 22:41:41,738 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:41" (1/1) ...
[2020-10-05 22:41:41,743 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:41" (1/1) ...
[2020-10-05 22:41:41,747 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:41" (1/1) ...
[2020-10-05 22:41:41,753 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-05 22:41:41,754 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-05 22:41:41,754 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-05 22:41:41,754 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-05 22:41:41,755 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:41" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-05 22:41:41,823 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-05 22:41:41,824 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-05 22:41:41,824 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-05 22:41:41,824 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-05 22:41:41,827 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-05 22:41:41,827 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-05 22:41:41,828 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-05 22:41:41,828 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-05 22:41:41,828 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-05 22:41:41,828 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-05 22:41:41,828 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-05 22:41:41,828 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-05 22:41:41,829 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-05 22:41:41,831 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-05 22:41:44,103 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-05 22:41:44,103 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-05 22:41:44,106 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:41:44 BoogieIcfgContainer
[2020-10-05 22:41:44,106 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-05 22:41:44,107 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-05 22:41:44,107 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-05 22:41:44,111 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-05 22:41:44,111 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:41:40" (1/3) ...
[2020-10-05 22:41:44,112 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115f82e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:41:44, skipping insertion in model container
[2020-10-05 22:41:44,112 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:41" (2/3) ...
[2020-10-05 22:41:44,113 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115f82e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:41:44, skipping insertion in model container
[2020-10-05 22:41:44,113 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:41:44" (3/3) ...
[2020-10-05 22:41:44,115 INFO  L109   eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i
[2020-10-05 22:41:44,126 WARN  L146   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-05 22:41:44,126 INFO  L157   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-05 22:41:44,134 INFO  L169   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-05 22:41:44,135 INFO  L340   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-05 22:41:44,177 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,178 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,178 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,178 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,178 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,179 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,179 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,179 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,179 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,179 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,179 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,180 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,180 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,182 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,182 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,183 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,183 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,183 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,183 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,184 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,184 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,184 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,184 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,185 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,185 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,185 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,185 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,185 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,186 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,186 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,187 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,187 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,187 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,187 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,188 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,188 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,189 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,189 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,189 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,190 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,191 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,192 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,192 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,197 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,198 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,198 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,198 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,198 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,198 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,199 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,199 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,199 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,199 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,201 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,202 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,202 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,202 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,202 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,202 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,203 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,203 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,203 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,203 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,203 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,203 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,206 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,207 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,207 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,207 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,207 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,207 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,208 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,208 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,208 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,208 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:41:44,224 INFO  L251      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-05 22:41:44,249 INFO  L375      AbstractCegarLoop]: Interprodecural is true
[2020-10-05 22:41:44,250 INFO  L376      AbstractCegarLoop]: Hoare is true
[2020-10-05 22:41:44,250 INFO  L377      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-05 22:41:44,250 INFO  L378      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-05 22:41:44,251 INFO  L379      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-05 22:41:44,251 INFO  L380      AbstractCegarLoop]: Difference is false
[2020-10-05 22:41:44,251 INFO  L381      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-05 22:41:44,251 INFO  L385      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-05 22:41:44,275 INFO  L152   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 217 flow
[2020-10-05 22:41:44,278 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow
[2020-10-05 22:41:44,361 INFO  L129       PetriNetUnfolder]: 2/98 cut-off events.
[2020-10-05 22:41:44,362 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-05 22:41:44,371 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. 
[2020-10-05 22:41:44,378 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow
[2020-10-05 22:41:44,423 INFO  L129       PetriNetUnfolder]: 2/98 cut-off events.
[2020-10-05 22:41:44,423 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-05 22:41:44,425 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. 
[2020-10-05 22:41:44,428 INFO  L158   etLargeBlockEncoding]: Number of co-enabled transitions 1990
[2020-10-05 22:41:44,430 INFO  L170   etLargeBlockEncoding]: Semantic Check.
[2020-10-05 22:41:44,647 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:44,647 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:44,650 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:44,650 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:44,655 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:41:44,656 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-05 22:41:44,661 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:41:44,662 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:44,738 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:44,738 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:44,742 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:44,742 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:44,744 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:44,744 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:44,749 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:44,750 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:44,752 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:44,752 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:44,755 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:44,755 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:44,759 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:41:44,760 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:44,763 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:44,764 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:44,766 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:44,767 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:44,975 WARN  L193               SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42
[2020-10-05 22:41:45,365 WARN  L193               SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-05 22:41:45,487 WARN  L193               SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-05 22:41:45,521 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:45,521 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,522 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:45,523 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,542 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:45,543 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:45,544 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-05 22:41:45,544 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:45,600 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:45,601 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:45,603 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:45,603 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,605 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:45,605 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,608 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:45,608 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:45,611 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:45,612 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:45,613 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:45,614 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:45,616 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:41:45,616 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,619 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:45,619 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,621 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:45,621 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,663 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:45,663 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,664 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:45,664 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,667 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:41:45,668 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-05 22:41:45,671 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:41:45,671 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,755 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:45,756 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,757 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:45,757 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,772 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:45,772 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,773 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:45,774 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,814 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:45,814 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:45,825 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:45,825 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,826 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:45,826 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,830 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:45,830 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:45,832 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:45,833 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:45,834 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:45,835 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:45,837 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:41:45,837 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,839 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:45,840 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,841 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:45,842 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,883 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:45,884 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,885 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:45,885 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:45,888 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:41:45,888 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-05 22:41:45,891 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:41:45,891 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:46,101 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:46,102 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:46,103 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:46,104 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:46,108 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:41:46,109 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-05 22:41:46,115 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:41:46,115 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:46,183 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:46,184 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:46,190 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:46,190 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:46,192 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:46,192 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:46,196 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:46,196 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:46,198 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:46,199 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:46,202 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:46,202 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:46,205 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:41:46,206 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:46,266 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:46,267 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:46,268 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:46,269 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:46,333 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:46,334 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:46,335 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-05 22:41:46,335 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:46,367 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:46,367 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:46,369 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:46,369 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:48,077 WARN  L193               SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 230 DAG size of output: 189
[2020-10-05 22:41:48,087 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2020-10-05 22:41:48,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:48,089 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:48,092 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,168 WARN  L193               SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 147 DAG size of output: 127
[2020-10-05 22:41:49,200 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:49,201 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,202 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:49,202 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,204 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:41:49,205 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-05 22:41:49,207 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:41:49,208 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,272 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:49,273 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:49,276 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,277 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,278 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,278 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,281 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,282 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:49,285 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,286 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:49,287 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,287 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:49,289 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:41:49,290 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,293 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:49,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,295 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:49,295 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,392 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:49,393 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,394 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:49,394 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,415 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:49,415 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,416 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:49,416 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,454 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:49,454 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:49,459 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,459 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,460 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,461 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,463 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,463 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:49,465 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,465 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:49,466 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,467 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:41:49,468 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:41:49,469 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,471 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:49,471 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,473 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:49,473 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,523 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:41:49,524 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,524 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:41:49,525 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,527 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:41:49,527 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-05 22:41:49,530 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:41:49,530 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:49,693 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,694 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:49,694 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,695 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:49,696 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,697 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:49,698 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:49,698 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:49,723 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,723 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:49,724 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,725 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:49,726 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:49,727 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:49,729 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:49,729 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:50,095 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,096 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,096 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,097 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,098 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,098 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:50,100 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,100 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:50,114 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,115 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,115 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,116 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,117 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,117 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:50,118 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,118 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:50,278 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-05 22:41:50,279 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,548 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,549 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,549 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,550 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,551 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,552 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:50,553 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,553 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:50,564 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,564 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,565 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,565 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,566 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,567 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:50,568 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,568 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:50,595 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,595 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,596 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,596 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,598 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,598 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:50,599 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,600 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:50,611 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,611 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,612 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,612 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,613 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,614 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:50,615 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,615 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:50,761 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,762 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,763 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,763 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,765 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,765 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:50,766 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,767 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:50,778 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,778 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,779 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,779 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:50,781 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:50,781 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:50,782 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:50,783 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:51,511 WARN  L193               SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124
[2020-10-05 22:41:51,843 WARN  L193               SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 121
[2020-10-05 22:41:52,511 WARN  L193               SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112
[2020-10-05 22:41:52,817 WARN  L193               SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 109
[2020-10-05 22:41:52,858 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:52,858 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:52,859 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,859 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:52,860 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,860 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:52,862 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:52,862 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:52,879 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:52,880 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:52,881 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,881 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:52,883 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,883 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:52,884 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:52,885 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:52,912 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:52,913 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:52,914 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,914 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:52,915 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,916 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:52,917 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:52,917 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:52,928 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:52,929 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:52,929 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,930 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:52,931 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,931 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:52,933 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:52,933 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:52,961 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:52,961 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:52,962 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,962 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:52,963 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,964 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:52,965 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:52,965 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:41:52,975 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,976 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:52,977 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,978 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:41:52,980 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:41:52,980 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:52,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:41:52,982 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:41:53,795 WARN  L193               SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 128
[2020-10-05 22:41:54,142 WARN  L193               SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 128
[2020-10-05 22:41:55,071 WARN  L193               SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-05 22:41:55,410 WARN  L193               SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 132
[2020-10-05 22:41:55,912 WARN  L193               SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95
[2020-10-05 22:41:56,049 WARN  L193               SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2020-10-05 22:41:56,059 INFO  L206   etLargeBlockEncoding]: Checked pairs total: 5652
[2020-10-05 22:41:56,060 INFO  L214   etLargeBlockEncoding]: Total number of compositions: 85
[2020-10-05 22:41:56,063 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow
[2020-10-05 22:41:56,132 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1132 states.
[2020-10-05 22:41:56,135 INFO  L276                IsEmpty]: Start isEmpty. Operand 1132 states.
[2020-10-05 22:41:56,142 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-05 22:41:56,143 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:56,144 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-05 22:41:56,144 INFO  L427      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:56,151 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:56,151 INFO  L82        PathProgramCache]: Analyzing trace with hash 1030804295, now seen corresponding path program 1 times
[2020-10-05 22:41:56,162 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:56,163 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108171990]
[2020-10-05 22:41:56,163 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:56,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:56,409 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-05 22:41:56,410 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108171990]
[2020-10-05 22:41:56,411 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:56,411 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-05 22:41:56,413 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248840705]
[2020-10-05 22:41:56,418 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-05 22:41:56,419 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:56,435 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-05 22:41:56,436 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-05 22:41:56,439 INFO  L87              Difference]: Start difference. First operand 1132 states. Second operand 3 states.
[2020-10-05 22:41:56,622 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:56,622 INFO  L93              Difference]: Finished difference Result 972 states and 3118 transitions.
[2020-10-05 22:41:56,627 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-05 22:41:56,629 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-05 22:41:56,629 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:56,662 INFO  L225             Difference]: With dead ends: 972
[2020-10-05 22:41:56,662 INFO  L226             Difference]: Without dead ends: 792
[2020-10-05 22:41:56,664 INFO  L675         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-05 22:41:56,692 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 792 states.
[2020-10-05 22:41:56,796 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792.
[2020-10-05 22:41:56,797 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 792 states.
[2020-10-05 22:41:56,803 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2494 transitions.
[2020-10-05 22:41:56,805 INFO  L78                 Accepts]: Start accepts. Automaton has 792 states and 2494 transitions. Word has length 5
[2020-10-05 22:41:56,805 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:56,805 INFO  L479      AbstractCegarLoop]: Abstraction has 792 states and 2494 transitions.
[2020-10-05 22:41:56,805 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-05 22:41:56,806 INFO  L276                IsEmpty]: Start isEmpty. Operand 792 states and 2494 transitions.
[2020-10-05 22:41:56,807 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-05 22:41:56,807 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:56,807 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:56,808 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-05 22:41:56,808 INFO  L427      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:56,808 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:56,808 INFO  L82        PathProgramCache]: Analyzing trace with hash -1427448916, now seen corresponding path program 1 times
[2020-10-05 22:41:56,808 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:56,809 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353345323]
[2020-10-05 22:41:56,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:56,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:56,929 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-05 22:41:56,929 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353345323]
[2020-10-05 22:41:56,929 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:56,930 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-05 22:41:56,930 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355658467]
[2020-10-05 22:41:56,931 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-05 22:41:56,932 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:56,932 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-05 22:41:56,932 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-05 22:41:56,932 INFO  L87              Difference]: Start difference. First operand 792 states and 2494 transitions. Second operand 3 states.
[2020-10-05 22:41:56,946 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:56,947 INFO  L93              Difference]: Finished difference Result 732 states and 2276 transitions.
[2020-10-05 22:41:56,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-05 22:41:56,948 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-05 22:41:56,948 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:56,954 INFO  L225             Difference]: With dead ends: 732
[2020-10-05 22:41:56,954 INFO  L226             Difference]: Without dead ends: 732
[2020-10-05 22:41:56,955 INFO  L675         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-05 22:41:56,958 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 732 states.
[2020-10-05 22:41:56,975 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732.
[2020-10-05 22:41:56,975 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 732 states.
[2020-10-05 22:41:56,979 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2276 transitions.
[2020-10-05 22:41:56,980 INFO  L78                 Accepts]: Start accepts. Automaton has 732 states and 2276 transitions. Word has length 9
[2020-10-05 22:41:56,981 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:56,981 INFO  L479      AbstractCegarLoop]: Abstraction has 732 states and 2276 transitions.
[2020-10-05 22:41:56,981 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-05 22:41:56,981 INFO  L276                IsEmpty]: Start isEmpty. Operand 732 states and 2276 transitions.
[2020-10-05 22:41:56,983 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-05 22:41:56,983 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:56,983 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:56,984 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-05 22:41:56,984 INFO  L427      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:56,984 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:56,984 INFO  L82        PathProgramCache]: Analyzing trace with hash -1704713446, now seen corresponding path program 1 times
[2020-10-05 22:41:56,984 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:56,985 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157651818]
[2020-10-05 22:41:56,985 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:57,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:57,054 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-05 22:41:57,055 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157651818]
[2020-10-05 22:41:57,055 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:57,055 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-05 22:41:57,055 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880570163]
[2020-10-05 22:41:57,056 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-05 22:41:57,056 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:57,056 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-05 22:41:57,056 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-05 22:41:57,057 INFO  L87              Difference]: Start difference. First operand 732 states and 2276 transitions. Second operand 3 states.
[2020-10-05 22:41:57,104 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:57,104 INFO  L93              Difference]: Finished difference Result 712 states and 2205 transitions.
[2020-10-05 22:41:57,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-05 22:41:57,105 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-05 22:41:57,106 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:57,111 INFO  L225             Difference]: With dead ends: 712
[2020-10-05 22:41:57,111 INFO  L226             Difference]: Without dead ends: 712
[2020-10-05 22:41:57,112 INFO  L675         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-05 22:41:57,115 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 712 states.
[2020-10-05 22:41:57,131 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712.
[2020-10-05 22:41:57,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 712 states.
[2020-10-05 22:41:57,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 2205 transitions.
[2020-10-05 22:41:57,136 INFO  L78                 Accepts]: Start accepts. Automaton has 712 states and 2205 transitions. Word has length 11
[2020-10-05 22:41:57,136 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:57,136 INFO  L479      AbstractCegarLoop]: Abstraction has 712 states and 2205 transitions.
[2020-10-05 22:41:57,136 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-05 22:41:57,136 INFO  L276                IsEmpty]: Start isEmpty. Operand 712 states and 2205 transitions.
[2020-10-05 22:41:57,138 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-05 22:41:57,139 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:57,139 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:57,139 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-05 22:41:57,139 INFO  L427      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:57,139 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:57,139 INFO  L82        PathProgramCache]: Analyzing trace with hash -1306510250, now seen corresponding path program 1 times
[2020-10-05 22:41:57,140 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:57,140 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575936517]
[2020-10-05 22:41:57,140 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:57,165 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:57,216 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-05 22:41:57,216 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575936517]
[2020-10-05 22:41:57,216 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:57,216 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-05 22:41:57,217 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189493875]
[2020-10-05 22:41:57,217 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-05 22:41:57,217 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:57,218 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-05 22:41:57,218 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-05 22:41:57,218 INFO  L87              Difference]: Start difference. First operand 712 states and 2205 transitions. Second operand 3 states.
[2020-10-05 22:41:57,230 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:57,231 INFO  L93              Difference]: Finished difference Result 692 states and 2134 transitions.
[2020-10-05 22:41:57,232 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-05 22:41:57,232 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-05 22:41:57,232 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:57,237 INFO  L225             Difference]: With dead ends: 692
[2020-10-05 22:41:57,237 INFO  L226             Difference]: Without dead ends: 692
[2020-10-05 22:41:57,238 INFO  L675         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-05 22:41:57,241 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 692 states.
[2020-10-05 22:41:57,254 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692.
[2020-10-05 22:41:57,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 692 states.
[2020-10-05 22:41:57,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2134 transitions.
[2020-10-05 22:41:57,258 INFO  L78                 Accepts]: Start accepts. Automaton has 692 states and 2134 transitions. Word has length 12
[2020-10-05 22:41:57,258 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:57,258 INFO  L479      AbstractCegarLoop]: Abstraction has 692 states and 2134 transitions.
[2020-10-05 22:41:57,259 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-05 22:41:57,259 INFO  L276                IsEmpty]: Start isEmpty. Operand 692 states and 2134 transitions.
[2020-10-05 22:41:57,261 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-05 22:41:57,261 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:57,261 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:57,261 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-05 22:41:57,261 INFO  L427      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:57,262 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:57,262 INFO  L82        PathProgramCache]: Analyzing trace with hash -1847113155, now seen corresponding path program 1 times
[2020-10-05 22:41:57,262 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:57,262 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716312544]
[2020-10-05 22:41:57,262 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:57,281 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:57,359 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-05 22:41:57,360 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716312544]
[2020-10-05 22:41:57,360 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:57,360 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-05 22:41:57,360 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197693815]
[2020-10-05 22:41:57,361 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-05 22:41:57,361 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:57,361 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-05 22:41:57,362 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-05 22:41:57,362 INFO  L87              Difference]: Start difference. First operand 692 states and 2134 transitions. Second operand 5 states.
[2020-10-05 22:41:57,473 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:57,473 INFO  L93              Difference]: Finished difference Result 720 states and 2216 transitions.
[2020-10-05 22:41:57,474 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-05 22:41:57,474 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-05 22:41:57,474 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:57,480 INFO  L225             Difference]: With dead ends: 720
[2020-10-05 22:41:57,480 INFO  L226             Difference]: Without dead ends: 720
[2020-10-05 22:41:57,480 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-05 22:41:57,483 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 720 states.
[2020-10-05 22:41:57,499 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720.
[2020-10-05 22:41:57,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 720 states.
[2020-10-05 22:41:57,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 2216 transitions.
[2020-10-05 22:41:57,503 INFO  L78                 Accepts]: Start accepts. Automaton has 720 states and 2216 transitions. Word has length 13
[2020-10-05 22:41:57,503 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:57,503 INFO  L479      AbstractCegarLoop]: Abstraction has 720 states and 2216 transitions.
[2020-10-05 22:41:57,504 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-05 22:41:57,504 INFO  L276                IsEmpty]: Start isEmpty. Operand 720 states and 2216 transitions.
[2020-10-05 22:41:57,505 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-05 22:41:57,505 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:57,506 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:57,506 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-05 22:41:57,506 INFO  L427      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:57,506 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:57,506 INFO  L82        PathProgramCache]: Analyzing trace with hash -1274319043, now seen corresponding path program 1 times
[2020-10-05 22:41:57,506 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:57,507 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031950009]
[2020-10-05 22:41:57,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:57,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:57,642 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-05 22:41:57,642 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031950009]
[2020-10-05 22:41:57,643 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:57,643 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-05 22:41:57,643 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656620159]
[2020-10-05 22:41:57,643 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-05 22:41:57,643 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:57,644 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-05 22:41:57,644 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-05 22:41:57,644 INFO  L87              Difference]: Start difference. First operand 720 states and 2216 transitions. Second operand 6 states.
[2020-10-05 22:41:57,819 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:57,819 INFO  L93              Difference]: Finished difference Result 860 states and 2630 transitions.
[2020-10-05 22:41:57,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-05 22:41:57,821 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2020-10-05 22:41:57,821 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:57,827 INFO  L225             Difference]: With dead ends: 860
[2020-10-05 22:41:57,828 INFO  L226             Difference]: Without dead ends: 860
[2020-10-05 22:41:57,828 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2020-10-05 22:41:57,832 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 860 states.
[2020-10-05 22:41:57,852 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 854.
[2020-10-05 22:41:57,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 854 states.
[2020-10-05 22:41:57,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 2611 transitions.
[2020-10-05 22:41:57,857 INFO  L78                 Accepts]: Start accepts. Automaton has 854 states and 2611 transitions. Word has length 15
[2020-10-05 22:41:57,858 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:57,858 INFO  L479      AbstractCegarLoop]: Abstraction has 854 states and 2611 transitions.
[2020-10-05 22:41:57,858 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-05 22:41:57,858 INFO  L276                IsEmpty]: Start isEmpty. Operand 854 states and 2611 transitions.
[2020-10-05 22:41:57,860 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-05 22:41:57,861 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:57,861 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:57,861 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-05 22:41:57,861 INFO  L427      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:57,861 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:57,862 INFO  L82        PathProgramCache]: Analyzing trace with hash -1269893802, now seen corresponding path program 1 times
[2020-10-05 22:41:57,862 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:57,864 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350535051]
[2020-10-05 22:41:57,864 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:57,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:58,173 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-05 22:41:58,174 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350535051]
[2020-10-05 22:41:58,174 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:58,174 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-05 22:41:58,174 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95180403]
[2020-10-05 22:41:58,175 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-05 22:41:58,175 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:58,175 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-05 22:41:58,176 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-05 22:41:58,176 INFO  L87              Difference]: Start difference. First operand 854 states and 2611 transitions. Second operand 6 states.
[2020-10-05 22:41:58,321 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:58,321 INFO  L93              Difference]: Finished difference Result 846 states and 2583 transitions.
[2020-10-05 22:41:58,322 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-05 22:41:58,322 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2020-10-05 22:41:58,323 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:58,329 INFO  L225             Difference]: With dead ends: 846
[2020-10-05 22:41:58,330 INFO  L226             Difference]: Without dead ends: 846
[2020-10-05 22:41:58,331 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-05 22:41:58,335 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 846 states.
[2020-10-05 22:41:58,359 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846.
[2020-10-05 22:41:58,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 846 states.
[2020-10-05 22:41:58,363 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 2583 transitions.
[2020-10-05 22:41:58,363 INFO  L78                 Accepts]: Start accepts. Automaton has 846 states and 2583 transitions. Word has length 15
[2020-10-05 22:41:58,363 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:58,363 INFO  L479      AbstractCegarLoop]: Abstraction has 846 states and 2583 transitions.
[2020-10-05 22:41:58,364 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-05 22:41:58,364 INFO  L276                IsEmpty]: Start isEmpty. Operand 846 states and 2583 transitions.
[2020-10-05 22:41:58,366 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-05 22:41:58,366 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:58,366 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:58,366 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-05 22:41:58,366 INFO  L427      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:58,367 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:58,367 INFO  L82        PathProgramCache]: Analyzing trace with hash -1254305700, now seen corresponding path program 1 times
[2020-10-05 22:41:58,367 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:58,368 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188812872]
[2020-10-05 22:41:58,368 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:58,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:58,446 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-05 22:41:58,447 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188812872]
[2020-10-05 22:41:58,447 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:58,448 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-05 22:41:58,448 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631888255]
[2020-10-05 22:41:58,449 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-05 22:41:58,449 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:58,449 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-05 22:41:58,449 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-05 22:41:58,450 INFO  L87              Difference]: Start difference. First operand 846 states and 2583 transitions. Second operand 4 states.
[2020-10-05 22:41:58,476 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:58,477 INFO  L93              Difference]: Finished difference Result 1119 states and 3359 transitions.
[2020-10-05 22:41:58,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-05 22:41:58,478 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-05 22:41:58,478 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:58,484 INFO  L225             Difference]: With dead ends: 1119
[2020-10-05 22:41:58,485 INFO  L226             Difference]: Without dead ends: 810
[2020-10-05 22:41:58,485 INFO  L675         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-05 22:41:58,489 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 810 states.
[2020-10-05 22:41:58,510 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 780.
[2020-10-05 22:41:58,510 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 780 states.
[2020-10-05 22:41:58,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2275 transitions.
[2020-10-05 22:41:58,514 INFO  L78                 Accepts]: Start accepts. Automaton has 780 states and 2275 transitions. Word has length 15
[2020-10-05 22:41:58,514 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:58,515 INFO  L479      AbstractCegarLoop]: Abstraction has 780 states and 2275 transitions.
[2020-10-05 22:41:58,515 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-05 22:41:58,515 INFO  L276                IsEmpty]: Start isEmpty. Operand 780 states and 2275 transitions.
[2020-10-05 22:41:58,517 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-05 22:41:58,517 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:58,517 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:58,517 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-05 22:41:58,518 INFO  L427      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:58,518 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:58,518 INFO  L82        PathProgramCache]: Analyzing trace with hash 323564224, now seen corresponding path program 2 times
[2020-10-05 22:41:58,518 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:58,519 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781566572]
[2020-10-05 22:41:58,519 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:58,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:58,629 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-05 22:41:58,630 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781566572]
[2020-10-05 22:41:58,630 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:58,630 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-05 22:41:58,630 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632144740]
[2020-10-05 22:41:58,631 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-05 22:41:58,631 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:58,631 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-05 22:41:58,631 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-05 22:41:58,632 INFO  L87              Difference]: Start difference. First operand 780 states and 2275 transitions. Second operand 4 states.
[2020-10-05 22:41:58,670 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:58,671 INFO  L93              Difference]: Finished difference Result 738 states and 1909 transitions.
[2020-10-05 22:41:58,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-05 22:41:58,672 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-05 22:41:58,672 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:58,676 INFO  L225             Difference]: With dead ends: 738
[2020-10-05 22:41:58,676 INFO  L226             Difference]: Without dead ends: 526
[2020-10-05 22:41:58,676 INFO  L675         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-05 22:41:58,678 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 526 states.
[2020-10-05 22:41:58,689 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526.
[2020-10-05 22:41:58,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 526 states.
[2020-10-05 22:41:58,691 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1307 transitions.
[2020-10-05 22:41:58,691 INFO  L78                 Accepts]: Start accepts. Automaton has 526 states and 1307 transitions. Word has length 15
[2020-10-05 22:41:58,691 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:58,691 INFO  L479      AbstractCegarLoop]: Abstraction has 526 states and 1307 transitions.
[2020-10-05 22:41:58,691 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-05 22:41:58,691 INFO  L276                IsEmpty]: Start isEmpty. Operand 526 states and 1307 transitions.
[2020-10-05 22:41:58,693 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-05 22:41:58,693 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:58,693 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:58,695 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-05 22:41:58,695 INFO  L427      AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:58,695 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:58,695 INFO  L82        PathProgramCache]: Analyzing trace with hash 542786463, now seen corresponding path program 1 times
[2020-10-05 22:41:58,696 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:58,696 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827679057]
[2020-10-05 22:41:58,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:58,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:58,833 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-05 22:41:58,833 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827679057]
[2020-10-05 22:41:58,833 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:58,834 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-05 22:41:58,834 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626149604]
[2020-10-05 22:41:58,834 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-05 22:41:58,834 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:58,835 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-05 22:41:58,835 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-05 22:41:58,835 INFO  L87              Difference]: Start difference. First operand 526 states and 1307 transitions. Second operand 5 states.
[2020-10-05 22:41:58,886 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:58,886 INFO  L93              Difference]: Finished difference Result 430 states and 1005 transitions.
[2020-10-05 22:41:58,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-05 22:41:58,891 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2020-10-05 22:41:58,891 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:58,895 INFO  L225             Difference]: With dead ends: 430
[2020-10-05 22:41:58,895 INFO  L226             Difference]: Without dead ends: 335
[2020-10-05 22:41:58,896 INFO  L675         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-05 22:41:58,897 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 335 states.
[2020-10-05 22:41:58,903 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 287.
[2020-10-05 22:41:58,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 287 states.
[2020-10-05 22:41:58,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 658 transitions.
[2020-10-05 22:41:58,905 INFO  L78                 Accepts]: Start accepts. Automaton has 287 states and 658 transitions. Word has length 16
[2020-10-05 22:41:58,905 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:58,905 INFO  L479      AbstractCegarLoop]: Abstraction has 287 states and 658 transitions.
[2020-10-05 22:41:58,905 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-05 22:41:58,905 INFO  L276                IsEmpty]: Start isEmpty. Operand 287 states and 658 transitions.
[2020-10-05 22:41:58,906 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-05 22:41:58,906 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:58,906 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:58,907 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-05 22:41:58,907 INFO  L427      AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:58,907 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:58,907 INFO  L82        PathProgramCache]: Analyzing trace with hash 2138523494, now seen corresponding path program 1 times
[2020-10-05 22:41:58,907 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:58,908 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12715484]
[2020-10-05 22:41:58,908 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:58,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:59,001 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-05 22:41:59,001 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12715484]
[2020-10-05 22:41:59,002 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:59,002 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-05 22:41:59,002 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673604074]
[2020-10-05 22:41:59,002 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-05 22:41:59,003 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:59,003 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-05 22:41:59,003 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-05 22:41:59,003 INFO  L87              Difference]: Start difference. First operand 287 states and 658 transitions. Second operand 6 states.
[2020-10-05 22:41:59,076 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:59,077 INFO  L93              Difference]: Finished difference Result 265 states and 613 transitions.
[2020-10-05 22:41:59,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-05 22:41:59,078 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2020-10-05 22:41:59,079 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:59,081 INFO  L225             Difference]: With dead ends: 265
[2020-10-05 22:41:59,082 INFO  L226             Difference]: Without dead ends: 180
[2020-10-05 22:41:59,082 INFO  L675         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-05 22:41:59,083 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 180 states.
[2020-10-05 22:41:59,086 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180.
[2020-10-05 22:41:59,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 180 states.
[2020-10-05 22:41:59,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 415 transitions.
[2020-10-05 22:41:59,087 INFO  L78                 Accepts]: Start accepts. Automaton has 180 states and 415 transitions. Word has length 19
[2020-10-05 22:41:59,088 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:59,088 INFO  L479      AbstractCegarLoop]: Abstraction has 180 states and 415 transitions.
[2020-10-05 22:41:59,088 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-05 22:41:59,088 INFO  L276                IsEmpty]: Start isEmpty. Operand 180 states and 415 transitions.
[2020-10-05 22:41:59,089 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-05 22:41:59,089 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:59,089 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:59,089 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-05 22:41:59,089 INFO  L427      AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:59,090 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:59,090 INFO  L82        PathProgramCache]: Analyzing trace with hash -1778848949, now seen corresponding path program 1 times
[2020-10-05 22:41:59,090 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:59,090 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388940867]
[2020-10-05 22:41:59,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:59,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:59,258 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-05 22:41:59,258 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388940867]
[2020-10-05 22:41:59,258 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:59,259 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-05 22:41:59,259 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617530790]
[2020-10-05 22:41:59,259 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-05 22:41:59,259 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:59,260 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-05 22:41:59,260 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-05 22:41:59,261 INFO  L87              Difference]: Start difference. First operand 180 states and 415 transitions. Second operand 6 states.
[2020-10-05 22:41:59,353 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:59,353 INFO  L93              Difference]: Finished difference Result 302 states and 695 transitions.
[2020-10-05 22:41:59,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-05 22:41:59,354 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 23
[2020-10-05 22:41:59,354 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:59,355 INFO  L225             Difference]: With dead ends: 302
[2020-10-05 22:41:59,355 INFO  L226             Difference]: Without dead ends: 160
[2020-10-05 22:41:59,356 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-10-05 22:41:59,357 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2020-10-05 22:41:59,360 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160.
[2020-10-05 22:41:59,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 160 states.
[2020-10-05 22:41:59,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 367 transitions.
[2020-10-05 22:41:59,361 INFO  L78                 Accepts]: Start accepts. Automaton has 160 states and 367 transitions. Word has length 23
[2020-10-05 22:41:59,361 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:59,361 INFO  L479      AbstractCegarLoop]: Abstraction has 160 states and 367 transitions.
[2020-10-05 22:41:59,361 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-05 22:41:59,362 INFO  L276                IsEmpty]: Start isEmpty. Operand 160 states and 367 transitions.
[2020-10-05 22:41:59,362 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-05 22:41:59,362 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:59,363 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:59,363 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-05 22:41:59,363 INFO  L427      AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:59,364 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:59,364 INFO  L82        PathProgramCache]: Analyzing trace with hash -401613663, now seen corresponding path program 2 times
[2020-10-05 22:41:59,364 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:59,366 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095020972]
[2020-10-05 22:41:59,366 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:59,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:59,470 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-05 22:41:59,470 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095020972]
[2020-10-05 22:41:59,470 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:59,471 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-05 22:41:59,471 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251183994]
[2020-10-05 22:41:59,471 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-05 22:41:59,471 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:59,471 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-05 22:41:59,472 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-05 22:41:59,472 INFO  L87              Difference]: Start difference. First operand 160 states and 367 transitions. Second operand 5 states.
[2020-10-05 22:41:59,504 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:41:59,504 INFO  L93              Difference]: Finished difference Result 198 states and 444 transitions.
[2020-10-05 22:41:59,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-05 22:41:59,505 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 23
[2020-10-05 22:41:59,505 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:41:59,506 INFO  L225             Difference]: With dead ends: 198
[2020-10-05 22:41:59,506 INFO  L226             Difference]: Without dead ends: 76
[2020-10-05 22:41:59,507 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-05 22:41:59,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76 states.
[2020-10-05 22:41:59,508 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76.
[2020-10-05 22:41:59,509 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 76 states.
[2020-10-05 22:41:59,509 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 143 transitions.
[2020-10-05 22:41:59,509 INFO  L78                 Accepts]: Start accepts. Automaton has 76 states and 143 transitions. Word has length 23
[2020-10-05 22:41:59,509 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:41:59,509 INFO  L479      AbstractCegarLoop]: Abstraction has 76 states and 143 transitions.
[2020-10-05 22:41:59,509 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-05 22:41:59,510 INFO  L276                IsEmpty]: Start isEmpty. Operand 76 states and 143 transitions.
[2020-10-05 22:41:59,510 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-05 22:41:59,510 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:41:59,510 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:41:59,510 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-05 22:41:59,511 INFO  L427      AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:41:59,511 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:41:59,511 INFO  L82        PathProgramCache]: Analyzing trace with hash 573624203, now seen corresponding path program 3 times
[2020-10-05 22:41:59,511 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:41:59,511 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207532507]
[2020-10-05 22:41:59,512 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:41:59,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:41:59,982 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-05 22:41:59,983 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207532507]
[2020-10-05 22:41:59,983 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:41:59,983 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-05 22:41:59,983 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334991779]
[2020-10-05 22:41:59,984 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-05 22:41:59,984 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:41:59,984 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-05 22:41:59,984 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2020-10-05 22:41:59,984 INFO  L87              Difference]: Start difference. First operand 76 states and 143 transitions. Second operand 9 states.
[2020-10-05 22:42:00,250 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:42:00,250 INFO  L93              Difference]: Finished difference Result 111 states and 201 transitions.
[2020-10-05 22:42:00,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-05 22:42:00,251 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 23
[2020-10-05 22:42:00,252 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:42:00,252 INFO  L225             Difference]: With dead ends: 111
[2020-10-05 22:42:00,252 INFO  L226             Difference]: Without dead ends: 69
[2020-10-05 22:42:00,253 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2020-10-05 22:42:00,253 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2020-10-05 22:42:00,254 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54.
[2020-10-05 22:42:00,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2020-10-05 22:42:00,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions.
[2020-10-05 22:42:00,255 INFO  L78                 Accepts]: Start accepts. Automaton has 54 states and 91 transitions. Word has length 23
[2020-10-05 22:42:00,255 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:42:00,256 INFO  L479      AbstractCegarLoop]: Abstraction has 54 states and 91 transitions.
[2020-10-05 22:42:00,256 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-05 22:42:00,256 INFO  L276                IsEmpty]: Start isEmpty. Operand 54 states and 91 transitions.
[2020-10-05 22:42:00,257 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-05 22:42:00,257 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:42:00,258 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:42:00,258 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-05 22:42:00,258 INFO  L427      AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:42:00,258 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:42:00,258 INFO  L82        PathProgramCache]: Analyzing trace with hash 2031733363, now seen corresponding path program 4 times
[2020-10-05 22:42:00,258 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:42:00,259 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647981214]
[2020-10-05 22:42:00,259 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:42:00,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-05 22:42:00,325 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-05 22:42:00,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-05 22:42:00,374 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-05 22:42:00,426 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-05 22:42:00,426 INFO  L520         BasicCegarLoop]: Counterexample might be feasible
[2020-10-05 22:42:00,426 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-05 22:42:00,428 WARN  L633   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-05 22:42:00,441 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L2-->L845: Formula: (let ((.cse6 (= 0 (mod ~x$r_buff0_thd0~0_In-513938196 256))) (.cse7 (= (mod ~x$w_buff0_used~0_In-513938196 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-513938196 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-513938196 256) 0))) (let ((.cse5 (or .cse8 .cse9)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (or (and .cse0 .cse1 (= ~x$w_buff0~0_In-513938196 ~x~0_Out-513938196)) (and .cse2 (or (and (= ~x$w_buff1~0_In-513938196 ~x~0_Out-513938196) .cse3 .cse4) (and (= ~x~0_In-513938196 ~x~0_Out-513938196) .cse5)))) (= ~x$r_buff0_thd0~0_In-513938196 ~x$r_buff0_thd0~0_Out-513938196) (or (and (= ~x$w_buff1_used~0_In-513938196 ~x$w_buff1_used~0_Out-513938196) .cse5) (and .cse3 (= ~x$w_buff1_used~0_Out-513938196 0) .cse4)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-513938196 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-513938196|) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out-513938196)) (= ~x$r_buff1_thd0~0_Out-513938196 ~x$r_buff1_thd0~0_In-513938196) (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out-513938196 0)) (and .cse2 (= ~x$w_buff0_used~0_Out-513938196 ~x$w_buff0_used~0_In-513938196))))))  InVars {~x$w_buff0~0=~x$w_buff0~0_In-513938196, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-513938196, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-513938196|, ~x$w_buff1~0=~x$w_buff1~0_In-513938196, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-513938196, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-513938196, ~x~0=~x~0_In-513938196, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513938196}  OutVars{~x$w_buff0~0=~x$w_buff0~0_In-513938196, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-513938196, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-513938196|, ~x$w_buff1~0=~x$w_buff1~0_In-513938196, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-513938196|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-513938196, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-513938196|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-513938196|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-513938196|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-513938196, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-513938196, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-513938196|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-513938196|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-513938196, ~x~0=~x~0_Out-513938196}  AuxVars[]  AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge
[2020-10-05 22:42:00,453 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-05 22:42:00,453 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,456 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-05 22:42:00,456 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,456 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-05 22:42:00,457 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,457 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-05 22:42:00,457 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,457 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-05 22:42:00,457 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,457 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-05 22:42:00,457 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,458 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-05 22:42:00,458 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,458 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-05 22:42:00,459 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,459 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-05 22:42:00,459 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,460 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-05 22:42:00,460 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,460 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-05 22:42:00,460 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,460 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-05 22:42:00,460 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,461 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-05 22:42:00,461 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,461 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-05 22:42:00,461 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,461 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-05 22:42:00,461 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,462 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-05 22:42:00,462 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,462 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-05 22:42:00,462 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,462 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-05 22:42:00,462 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,469 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-05 22:42:00,469 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,469 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-05 22:42:00,469 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,469 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-05 22:42:00,469 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,470 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-05 22:42:00,470 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,470 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-05 22:42:00,470 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,470 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-05 22:42:00,470 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,471 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-05 22:42:00,471 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,471 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-05 22:42:00,471 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,472 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-05 22:42:00,472 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,472 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-05 22:42:00,472 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,472 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-05 22:42:00,472 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:42:00,577 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:42:00 BasicIcfg
[2020-10-05 22:42:00,577 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-05 22:42:00,578 INFO  L168              Benchmark]: Toolchain (without parser) took 19837.12 ms. Allocated memory was 146.3 MB in the beginning and 446.2 MB in the end (delta: 299.9 MB). Free memory was 100.5 MB in the beginning and 146.4 MB in the end (delta: -45.9 MB). Peak memory consumption was 254.0 MB. Max. memory is 7.1 GB.
[2020-10-05 22:42:00,579 INFO  L168              Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.3 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-10-05 22:42:00,580 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 882.46 ms. Allocated memory was 146.3 MB in the beginning and 230.7 MB in the end (delta: 84.4 MB). Free memory was 100.1 MB in the beginning and 193.8 MB in the end (delta: -93.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB.
[2020-10-05 22:42:00,581 INFO  L168              Benchmark]: Boogie Procedure Inliner took 82.29 ms. Allocated memory is still 230.7 MB. Free memory was 193.8 MB in the beginning and 190.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB.
[2020-10-05 22:42:00,581 INFO  L168              Benchmark]: Boogie Preprocessor took 44.33 ms. Allocated memory is still 230.7 MB. Free memory was 190.2 MB in the beginning and 187.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2020-10-05 22:42:00,582 INFO  L168              Benchmark]: RCFGBuilder took 2352.37 ms. Allocated memory was 230.7 MB in the beginning and 250.6 MB in the end (delta: 19.9 MB). Free memory was 187.5 MB in the beginning and 225.8 MB in the end (delta: -38.2 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB.
[2020-10-05 22:42:00,583 INFO  L168              Benchmark]: TraceAbstraction took 16469.73 ms. Allocated memory was 250.6 MB in the beginning and 446.2 MB in the end (delta: 195.6 MB). Free memory was 225.8 MB in the beginning and 146.4 MB in the end (delta: 79.4 MB). Peak memory consumption was 274.9 MB. Max. memory is 7.1 GB.
[2020-10-05 22:42:00,587 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.25 ms. Allocated memory is still 146.3 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 882.46 ms. Allocated memory was 146.3 MB in the beginning and 230.7 MB in the end (delta: 84.4 MB). Free memory was 100.1 MB in the beginning and 193.8 MB in the end (delta: -93.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 82.29 ms. Allocated memory is still 230.7 MB. Free memory was 193.8 MB in the beginning and 190.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 44.33 ms. Allocated memory is still 230.7 MB. Free memory was 190.2 MB in the beginning and 187.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2352.37 ms. Allocated memory was 230.7 MB in the beginning and 250.6 MB in the end (delta: 19.9 MB). Free memory was 187.5 MB in the beginning and 225.8 MB in the end (delta: -38.2 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 16469.73 ms. Allocated memory was 250.6 MB in the beginning and 446.2 MB in the end (delta: 195.6 MB). Free memory was 225.8 MB in the beginning and 146.4 MB in the end (delta: 79.4 MB). Peak memory consumption was 274.9 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    LbeTime: 11.7s, 109 ProgramPointsBefore, 38 ProgramPointsAfterwards, 101 TransitionsBefore, 29 TransitionsAfterwards, 1990 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 1055 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 68 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.6s, 0 MoverChecksTotal, 5652 CheckedPairsTotal, 85 TotalNumberOfCompositions
  - 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_p1_EAX = 0;
[L702]               0  int __unbuffered_p1_EBX = 0;
[L704]               0  int __unbuffered_p2_EAX = 0;
[L706]               0  int __unbuffered_p2_EBX = 0;
[L708]               0  int a = 0;
[L710]               0  int b = 0;
[L711]               0  _Bool main$tmp_guard0;
[L712]               0  _Bool main$tmp_guard1;
[L714]               0  int x = 0;
[L715]               0  _Bool x$flush_delayed;
[L716]               0  int x$mem_tmp;
[L717]               0  _Bool x$r_buff0_thd0;
[L718]               0  _Bool x$r_buff0_thd1;
[L719]               0  _Bool x$r_buff0_thd2;
[L720]               0  _Bool x$r_buff0_thd3;
[L721]               0  _Bool x$r_buff1_thd0;
[L722]               0  _Bool x$r_buff1_thd1;
[L723]               0  _Bool x$r_buff1_thd2;
[L724]               0  _Bool x$r_buff1_thd3;
[L725]               0  _Bool x$read_delayed;
[L726]               0  int *x$read_delayed_var;
[L727]               0  int x$w_buff0;
[L728]               0  _Bool x$w_buff0_used;
[L729]               0  int x$w_buff1;
[L730]               0  _Bool x$w_buff1_used;
[L732]               0  int y = 0;
[L734]               0  int z = 0;
[L735]               0  _Bool weak$$choice0;
[L736]               0  _Bool weak$$choice2;
[L829]               0  pthread_t t891;
[L830]  FCALL, FORK  0  pthread_create(&t891, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L831]               0  pthread_t t892;
[L832]  FCALL, FORK  0  pthread_create(&t892, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L833]               0  pthread_t t893;
[L834]  FCALL, FORK  0  pthread_create(&t893, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L760]               2  x$w_buff1 = x$w_buff0
[L761]               2  x$w_buff0 = 2
[L762]               2  x$w_buff1_used = x$w_buff0_used
[L763]               2  x$w_buff0_used = (_Bool)1
[L7]    COND TRUE    2  !expression
[L7]                 2  __VERIFIER_error()
[L765]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L766]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L767]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L768]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L769]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L772]               2  y = 1
[L775]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L778]               2  __unbuffered_p1_EBX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L795]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L798]               3  a = 1
[L801]               3  __unbuffered_p2_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L804]               3  __unbuffered_p2_EBX = b
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L740]               1  b = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L743]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L781]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L781]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L781]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L781]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L782]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L782]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L783]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L783]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L784]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L784]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L785]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L785]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L788]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L790]               2  return 0;
[L746]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L746]               1  x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L747]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L747]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L748]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L748]               1  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L749]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L749]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L750]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L750]               1  x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L753]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L755]               1  return 0;
[L807]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L807]  EXPR         3  x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L807]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L807]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L808]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L808]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L809]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L809]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L810]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L810]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L811]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L811]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L814]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L816]               3  return 0;
[L836]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L847]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L848]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L849]               0  x$flush_delayed = weak$$choice2
[L850]               0  x$mem_tmp = x
[L851]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L851]               0  x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L852]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L852]               0  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L853]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L853]               0  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L854]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L854]               0  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L855]  EXPR         0  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L855]               0  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L856]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L856]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)
[L856]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L856]               0  x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L857]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L857]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L857]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0
[L857]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L857]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L857]               0  x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L858]               0  main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L859]  EXPR         0  x$flush_delayed ? x$mem_tmp : x
[L859]               0  x = x$flush_delayed ? x$mem_tmp : x
[L860]               0  x$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.1s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.8s, HoareTripleCheckerStatistics: 380 SDtfs, 413 SDslu, 662 SDs, 0 SdLazy, 324 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 99 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 30502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...