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


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


This is Ultimate 0.1.25-11af1e5
[2020-10-11 14:49:16,953 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-11 14:49:16,956 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-11 14:49:16,984 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-11 14:49:16,984 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-11 14:49:16,992 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-11 14:49:16,993 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-11 14:49:16,997 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-11 14:49:16,999 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-11 14:49:17,000 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-11 14:49:17,002 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-11 14:49:17,004 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-11 14:49:17,005 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-11 14:49:17,008 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-11 14:49:17,010 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-11 14:49:17,012 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-11 14:49:17,013 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-11 14:49:17,015 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-11 14:49:17,017 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-11 14:49:17,023 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-11 14:49:17,026 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-11 14:49:17,027 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-11 14:49:17,029 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-11 14:49:17,030 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-11 14:49:17,041 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-11 14:49:17,041 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-11 14:49:17,042 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-11 14:49:17,042 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-11 14:49:17,043 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-11 14:49:17,046 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-11 14:49:17,046 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-11 14:49:17,048 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-11 14:49:17,049 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-11 14:49:17,050 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-11 14:49:17,051 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-11 14:49:17,051 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-11 14:49:17,052 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-11 14:49:17,053 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-11 14:49:17,054 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-11 14:49:17,054 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-11 14:49:17,056 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-11 14:49:17,057 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-11 14:49:17,099 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-11 14:49:17,100 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-11 14:49:17,101 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-11 14:49:17,102 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-11 14:49:17,102 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-11 14:49:17,102 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-11 14:49:17,102 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-11 14:49:17,103 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-11 14:49:17,103 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-11 14:49:17,103 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-11 14:49:17,104 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-11 14:49:17,104 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-11 14:49:17,105 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-11 14:49:17,105 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-11 14:49:17,105 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-11 14:49:17,105 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-11 14:49:17,106 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-11 14:49:17,106 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-11 14:49:17,106 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-11 14:49:17,106 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-11 14:49:17,106 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-11 14:49:17,107 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 14:49:17,107 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-11 14:49:17,107 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-11 14:49:17,107 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-11 14:49:17,107 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-11 14:49:17,108 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-11 14:49:17,108 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-11 14:49:17,108 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-11 14:49:17,108 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-11 14:49:17,425 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-11 14:49:17,436 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-11 14:49:17,442 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-11 14:49:17,445 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-11 14:49:17,450 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-11 14:49:17,451 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-11 14:49:17,502 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d32ae2e7/ae30f963cc7343d4af0a6f9e9d67db5c/FLAG572664e40
[2020-10-11 14:49:17,997 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-11 14:49:17,998 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i
[2020-10-11 14:49:18,028 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d32ae2e7/ae30f963cc7343d4af0a6f9e9d67db5c/FLAG572664e40
[2020-10-11 14:49:18,257 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d32ae2e7/ae30f963cc7343d4af0a6f9e9d67db5c
[2020-10-11 14:49:18,265 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-11 14:49:18,267 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-11 14:49:18,269 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-11 14:49:18,269 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-11 14:49:18,272 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-11 14:49:18,274 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:49:18" (1/1) ...
[2020-10-11 14:49:18,277 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37bd446f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18, skipping insertion in model container
[2020-10-11 14:49:18,277 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:49:18" (1/1) ...
[2020-10-11 14:49:18,284 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-11 14:49:18,335 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-11 14:49:18,827 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:49:18,841 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-11 14:49:18,909 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:49:18,987 INFO  L208         MainTranslator]: Completed translation
[2020-10-11 14:49:18,988 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18 WrapperNode
[2020-10-11 14:49:18,988 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-11 14:49:18,989 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-11 14:49:18,989 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-11 14:49:18,989 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-11 14:49:18,999 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18" (1/1) ...
[2020-10-11 14:49:19,019 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18" (1/1) ...
[2020-10-11 14:49:19,055 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-11 14:49:19,056 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-11 14:49:19,056 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-11 14:49:19,056 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-11 14:49:19,064 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18" (1/1) ...
[2020-10-11 14:49:19,064 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18" (1/1) ...
[2020-10-11 14:49:19,069 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18" (1/1) ...
[2020-10-11 14:49:19,070 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18" (1/1) ...
[2020-10-11 14:49:19,081 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18" (1/1) ...
[2020-10-11 14:49:19,086 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18" (1/1) ...
[2020-10-11 14:49:19,089 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18" (1/1) ...
[2020-10-11 14:49:19,095 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-11 14:49:19,096 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-11 14:49:19,096 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-11 14:49:19,096 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-11 14:49:19,097 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 14:49:19,173 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-11 14:49:19,173 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-11 14:49:19,173 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-11 14:49:19,174 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-11 14:49:19,174 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-11 14:49:19,174 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-11 14:49:19,174 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-11 14:49:19,174 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-11 14:49:19,174 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-11 14:49:19,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-11 14:49:19,175 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-11 14:49:19,175 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-11 14:49:19,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-11 14:49:19,177 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-11 14:49:21,443 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-11 14:49:21,443 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-11 14:49:21,445 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:49:21 BoogieIcfgContainer
[2020-10-11 14:49:21,446 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-11 14:49:21,447 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-11 14:49:21,447 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-11 14:49:21,450 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-11 14:49:21,451 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:49:18" (1/3) ...
[2020-10-11 14:49:21,451 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd57b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:49:21, skipping insertion in model container
[2020-10-11 14:49:21,452 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:18" (2/3) ...
[2020-10-11 14:49:21,452 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd57b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:49:21, skipping insertion in model container
[2020-10-11 14:49:21,452 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:49:21" (3/3) ...
[2020-10-11 14:49:21,454 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i
[2020-10-11 14:49:21,465 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-11 14:49:21,466 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-11 14:49:21,473 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-11 14:49:21,474 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-11 14:49:21,504 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,504 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,505 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,505 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,505 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,508 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,508 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,508 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,509 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,509 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,509 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,509 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,510 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,510 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,512 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,512 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,512 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,513 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,513 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,513 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,514 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,514 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,514 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,514 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,515 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,515 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,515 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,515 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,516 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,516 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,516 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,517 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,521 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,521 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,521 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,521 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,522 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,522 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,522 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,522 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,523 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,523 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,528 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,528 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,528 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,529 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,529 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,529 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,529 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,529 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,530 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,530 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,530 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,530 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,532 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,532 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,533 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,533 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,533 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,533 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,533 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,534 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,534 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,534 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:49:21,550 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-11 14:49:21,572 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-11 14:49:21,572 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-11 14:49:21,572 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-11 14:49:21,572 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-11 14:49:21,573 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-11 14:49:21,573 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-11 14:49:21,573 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-11 14:49:21,573 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-11 14:49:21,588 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-11 14:49:21,591 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 217 flow
[2020-10-11 14:49:21,594 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 101 transitions, 217 flow
[2020-10-11 14:49:21,596 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow
[2020-10-11 14:49:21,649 INFO  L129       PetriNetUnfolder]: 2/98 cut-off events.
[2020-10-11 14:49:21,649 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 14:49:21,655 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-11 14:49:21,659 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1990
[2020-10-11 14:49:21,926 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:21,927 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:21,930 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:21,931 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:21,943 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:49:21,944 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:49:21,954 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:49:21,955 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,032 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:22,032 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:22,036 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:22,036 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,038 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:22,038 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,042 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:22,043 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:22,045 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:22,045 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:22,049 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:22,049 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:22,052 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:49:22,052 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,054 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-11 14:49:22,055 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,056 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-11 14:49:22,057 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,601 WARN  L193               SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-11 14:49:22,730 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:22,730 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,731 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:22,731 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,749 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:22,750 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:22,751 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-11 14:49:22,751 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:22,806 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:22,806 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:22,809 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:22,809 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,810 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:22,811 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,814 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:22,814 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:22,817 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:22,817 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:22,819 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:22,819 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:22,821 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:49:22,822 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,824 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-11 14:49:22,825 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,827 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-11 14:49:22,827 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,873 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:22,874 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,875 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:22,875 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,878 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:49:22,878 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:49:22,881 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:49:22,882 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,969 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:22,969 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:22,970 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:23,000 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,018 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:23,018 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,020 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:23,020 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,094 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:23,094 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:23,115 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:23,115 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,117 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:23,117 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,123 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:23,124 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:23,127 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:23,127 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:23,129 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:23,129 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:23,132 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:49:23,133 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,137 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-11 14:49:23,138 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,141 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-11 14:49:23,142 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,205 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:23,206 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,211 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:23,211 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,216 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:49:23,217 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:49:23,221 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:49:23,221 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,439 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:23,440 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,440 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:23,441 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,444 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:49:23,445 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:49:23,448 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:49:23,449 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,499 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:23,499 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:23,501 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:23,502 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,503 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:23,504 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,508 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:23,508 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:23,510 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:23,510 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:23,512 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:23,512 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:23,516 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:49:23,516 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,518 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-11 14:49:23,518 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,520 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-11 14:49:23,520 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,571 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:23,572 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:23,572 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-11 14:49:23,573 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:23,595 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:23,596 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:23,597 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:23,597 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:24,737 WARN  L193               SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 230 DAG size of output: 189
[2020-10-11 14:49:24,744 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2020-10-11 14:49:24,745 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:24,745 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:24,745 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:25,813 WARN  L193               SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 147 DAG size of output: 127
[2020-10-11 14:49:25,860 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:25,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:25,862 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:25,862 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:25,872 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:49:25,872 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:49:25,877 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:49:25,877 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:25,944 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:25,944 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:25,946 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:25,946 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:25,948 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:25,948 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:25,951 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:25,951 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:25,953 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:25,954 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:25,955 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:25,955 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:25,957 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:49:25,957 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:25,959 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-11 14:49:25,960 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:25,961 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-11 14:49:25,961 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,056 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:26,056 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,057 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:26,057 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,079 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:26,080 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,081 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:26,081 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,124 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:26,124 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:26,126 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,127 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,128 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,128 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,130 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,131 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:26,133 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,133 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:26,134 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,135 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:49:26,136 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:49:26,137 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,139 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-11 14:49:26,139 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,141 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-11 14:49:26,141 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,182 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:49:26,182 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,183 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:49:26,183 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,185 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:49:26,186 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:49:26,188 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:49:26,189 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:26,366 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,366 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:26,367 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,367 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:26,369 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,370 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:26,371 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:26,372 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:26,387 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,387 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:26,388 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,389 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:26,390 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,390 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:26,392 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:26,392 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:26,586 WARN  L193               SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-11 14:49:26,689 WARN  L193               SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-11 14:49:26,756 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,757 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:26,757 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,758 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:26,764 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,765 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:26,766 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:26,767 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:26,782 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:26,782 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:26,783 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,783 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:26,784 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:26,785 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:26,786 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:26,787 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:26,939 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:49:26,939 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,220 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:27,220 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,221 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,221 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,223 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,223 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:27,225 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:27,225 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:27,236 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:27,236 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,237 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,237 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,238 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,239 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:27,240 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:27,240 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:27,263 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,264 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,264 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,265 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,266 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,267 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:27,268 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:27,269 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:27,279 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:27,279 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,280 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,280 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,282 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,282 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:27,283 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:27,284 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:27,427 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:27,428 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,428 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,429 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,430 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,431 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:27,432 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:27,432 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:27,449 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,450 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,450 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,451 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:27,452 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:27,452 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:27,454 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:27,454 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:28,129 WARN  L193               SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124
[2020-10-11 14:49:28,465 WARN  L193               SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 121
[2020-10-11 14:49:29,133 WARN  L193               SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112
[2020-10-11 14:49:29,427 WARN  L193               SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 109
[2020-10-11 14:49:29,468 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:29,468 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:29,469 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,469 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:29,470 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,471 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:29,472 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:29,473 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:29,491 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:29,491 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:29,492 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,492 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:29,494 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,494 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:29,496 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:29,496 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:29,516 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:29,516 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:29,517 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,517 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:29,518 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,518 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:29,519 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:29,520 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:29,529 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:29,530 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:29,530 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,531 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:29,532 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,532 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:29,533 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:29,533 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:29,547 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:29,547 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:29,548 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,548 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:29,550 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,550 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:29,551 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:29,552 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:49:29,562 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,562 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:29,563 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,563 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:49:29,565 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:49:29,566 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:29,567 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:49:29,568 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:49:30,340 WARN  L193               SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 128
[2020-10-11 14:49:30,695 WARN  L193               SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 128
[2020-10-11 14:49:31,580 WARN  L193               SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-11 14:49:31,900 WARN  L193               SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 132
[2020-10-11 14:49:32,358 WARN  L193               SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95
[2020-10-11 14:49:32,490 WARN  L193               SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2020-10-11 14:49:32,499 INFO  L132        LiptonReduction]: Checked pairs total: 5878
[2020-10-11 14:49:32,500 INFO  L134        LiptonReduction]: Total number of compositions: 86
[2020-10-11 14:49:32,507 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow
[2020-10-11 14:49:32,573 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1132 states.
[2020-10-11 14:49:32,575 INFO  L276                IsEmpty]: Start isEmpty. Operand 1132 states.
[2020-10-11 14:49:32,581 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-11 14:49:32,582 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:32,583 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-11 14:49:32,583 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:32,589 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:32,589 INFO  L82        PathProgramCache]: Analyzing trace with hash 1030804295, now seen corresponding path program 1 times
[2020-10-11 14:49:32,599 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:32,600 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63864830]
[2020-10-11 14:49:32,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:32,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:49:32,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:49:32,844 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63864830]
[2020-10-11 14:49:32,844 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:49:32,845 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:49:32,845 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823571314]
[2020-10-11 14:49:32,850 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:49:32,850 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:49:32,862 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:49:32,863 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:49:32,865 INFO  L87              Difference]: Start difference. First operand 1132 states. Second operand 3 states.
[2020-10-11 14:49:32,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:49:32,983 INFO  L93              Difference]: Finished difference Result 972 states and 3118 transitions.
[2020-10-11 14:49:32,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:49:32,986 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-11 14:49:32,987 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:49:33,028 INFO  L225             Difference]: With dead ends: 972
[2020-10-11 14:49:33,028 INFO  L226             Difference]: Without dead ends: 792
[2020-10-11 14:49:33,030 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:49:33,063 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 792 states.
[2020-10-11 14:49:33,174 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792.
[2020-10-11 14:49:33,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 792 states.
[2020-10-11 14:49:33,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2494 transitions.
[2020-10-11 14:49:33,190 INFO  L78                 Accepts]: Start accepts. Automaton has 792 states and 2494 transitions. Word has length 5
[2020-10-11 14:49:33,190 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:49:33,191 INFO  L481      AbstractCegarLoop]: Abstraction has 792 states and 2494 transitions.
[2020-10-11 14:49:33,191 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:49:33,191 INFO  L276                IsEmpty]: Start isEmpty. Operand 792 states and 2494 transitions.
[2020-10-11 14:49:33,193 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-11 14:49:33,193 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:33,193 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:49:33,194 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-11 14:49:33,194 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:33,194 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:33,194 INFO  L82        PathProgramCache]: Analyzing trace with hash -1427448916, now seen corresponding path program 1 times
[2020-10-11 14:49:33,195 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:33,196 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872673512]
[2020-10-11 14:49:33,196 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:33,286 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:49:33,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:49:33,340 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872673512]
[2020-10-11 14:49:33,341 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:49:33,341 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:49:33,341 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982868645]
[2020-10-11 14:49:33,342 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:49:33,343 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:49:33,343 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:49:33,343 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:49:33,344 INFO  L87              Difference]: Start difference. First operand 792 states and 2494 transitions. Second operand 3 states.
[2020-10-11 14:49:33,359 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:49:33,359 INFO  L93              Difference]: Finished difference Result 732 states and 2276 transitions.
[2020-10-11 14:49:33,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:49:33,360 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-11 14:49:33,361 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:49:33,366 INFO  L225             Difference]: With dead ends: 732
[2020-10-11 14:49:33,367 INFO  L226             Difference]: Without dead ends: 732
[2020-10-11 14:49:33,367 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:49:33,371 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 732 states.
[2020-10-11 14:49:33,390 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732.
[2020-10-11 14:49:33,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 732 states.
[2020-10-11 14:49:33,394 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2276 transitions.
[2020-10-11 14:49:33,394 INFO  L78                 Accepts]: Start accepts. Automaton has 732 states and 2276 transitions. Word has length 9
[2020-10-11 14:49:33,395 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:49:33,395 INFO  L481      AbstractCegarLoop]: Abstraction has 732 states and 2276 transitions.
[2020-10-11 14:49:33,396 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:49:33,396 INFO  L276                IsEmpty]: Start isEmpty. Operand 732 states and 2276 transitions.
[2020-10-11 14:49:33,398 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-11 14:49:33,398 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:33,398 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:49:33,398 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-11 14:49:33,399 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:33,399 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:33,399 INFO  L82        PathProgramCache]: Analyzing trace with hash -1704713446, now seen corresponding path program 1 times
[2020-10-11 14:49:33,399 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:33,400 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604812837]
[2020-10-11 14:49:33,400 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:33,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:49:33,488 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:49:33,489 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604812837]
[2020-10-11 14:49:33,489 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:49:33,489 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:49:33,489 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034630106]
[2020-10-11 14:49:33,490 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:49:33,490 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:49:33,490 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:49:33,490 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:49:33,491 INFO  L87              Difference]: Start difference. First operand 732 states and 2276 transitions. Second operand 3 states.
[2020-10-11 14:49:33,516 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:49:33,516 INFO  L93              Difference]: Finished difference Result 692 states and 2134 transitions.
[2020-10-11 14:49:33,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:49:33,518 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-11 14:49:33,518 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:49:33,523 INFO  L225             Difference]: With dead ends: 692
[2020-10-11 14:49:33,523 INFO  L226             Difference]: Without dead ends: 692
[2020-10-11 14:49:33,524 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:49:33,527 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 692 states.
[2020-10-11 14:49:33,544 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692.
[2020-10-11 14:49:33,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 692 states.
[2020-10-11 14:49:33,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2134 transitions.
[2020-10-11 14:49:33,548 INFO  L78                 Accepts]: Start accepts. Automaton has 692 states and 2134 transitions. Word has length 11
[2020-10-11 14:49:33,548 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:49:33,548 INFO  L481      AbstractCegarLoop]: Abstraction has 692 states and 2134 transitions.
[2020-10-11 14:49:33,548 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:49:33,549 INFO  L276                IsEmpty]: Start isEmpty. Operand 692 states and 2134 transitions.
[2020-10-11 14:49:33,552 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-11 14:49:33,552 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:33,552 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:49:33,552 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-11 14:49:33,552 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:33,553 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:33,553 INFO  L82        PathProgramCache]: Analyzing trace with hash -1847113155, now seen corresponding path program 1 times
[2020-10-11 14:49:33,553 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:33,553 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335619322]
[2020-10-11 14:49:33,553 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:33,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:49:33,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:49:33,729 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335619322]
[2020-10-11 14:49:33,729 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:49:33,730 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:49:33,730 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505041126]
[2020-10-11 14:49:33,730 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:49:33,731 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:49:33,731 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:49:33,731 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:49:33,731 INFO  L87              Difference]: Start difference. First operand 692 states and 2134 transitions. Second operand 5 states.
[2020-10-11 14:49:33,807 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:49:33,807 INFO  L93              Difference]: Finished difference Result 684 states and 2102 transitions.
[2020-10-11 14:49:33,808 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:49:33,809 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-11 14:49:33,809 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:49:33,814 INFO  L225             Difference]: With dead ends: 684
[2020-10-11 14:49:33,815 INFO  L226             Difference]: Without dead ends: 684
[2020-10-11 14:49:33,815 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:49:33,819 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 684 states.
[2020-10-11 14:49:33,835 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684.
[2020-10-11 14:49:33,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 684 states.
[2020-10-11 14:49:33,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 2102 transitions.
[2020-10-11 14:49:33,839 INFO  L78                 Accepts]: Start accepts. Automaton has 684 states and 2102 transitions. Word has length 13
[2020-10-11 14:49:33,839 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:49:33,839 INFO  L481      AbstractCegarLoop]: Abstraction has 684 states and 2102 transitions.
[2020-10-11 14:49:33,839 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:49:33,839 INFO  L276                IsEmpty]: Start isEmpty. Operand 684 states and 2102 transitions.
[2020-10-11 14:49:33,841 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-11 14:49:33,842 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:33,842 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:49:33,842 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-11 14:49:33,842 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:33,842 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:33,843 INFO  L82        PathProgramCache]: Analyzing trace with hash -1274319043, now seen corresponding path program 1 times
[2020-10-11 14:49:33,843 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:33,843 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303085311]
[2020-10-11 14:49:33,843 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:33,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:49:33,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:49:33,973 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303085311]
[2020-10-11 14:49:34,014 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:49:34,016 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:49:34,016 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423099165]
[2020-10-11 14:49:34,017 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:49:34,017 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:49:34,017 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:49:34,018 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:49:34,018 INFO  L87              Difference]: Start difference. First operand 684 states and 2102 transitions. Second operand 6 states.
[2020-10-11 14:49:34,214 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:49:34,215 INFO  L93              Difference]: Finished difference Result 860 states and 2630 transitions.
[2020-10-11 14:49:34,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:49:34,216 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2020-10-11 14:49:34,217 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:49:34,225 INFO  L225             Difference]: With dead ends: 860
[2020-10-11 14:49:34,226 INFO  L226             Difference]: Without dead ends: 860
[2020-10-11 14:49:34,226 INFO  L673         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-11 14:49:34,233 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 860 states.
[2020-10-11 14:49:34,259 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 854.
[2020-10-11 14:49:34,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 854 states.
[2020-10-11 14:49:34,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 2611 transitions.
[2020-10-11 14:49:34,266 INFO  L78                 Accepts]: Start accepts. Automaton has 854 states and 2611 transitions. Word has length 15
[2020-10-11 14:49:34,266 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:49:34,267 INFO  L481      AbstractCegarLoop]: Abstraction has 854 states and 2611 transitions.
[2020-10-11 14:49:34,267 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:49:34,267 INFO  L276                IsEmpty]: Start isEmpty. Operand 854 states and 2611 transitions.
[2020-10-11 14:49:34,269 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-11 14:49:34,270 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:34,270 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:49:34,270 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-11 14:49:34,270 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:34,271 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:34,271 INFO  L82        PathProgramCache]: Analyzing trace with hash -1269893802, now seen corresponding path program 1 times
[2020-10-11 14:49:34,271 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:34,272 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869359903]
[2020-10-11 14:49:34,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:34,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:49:34,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:49:34,531 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869359903]
[2020-10-11 14:49:34,532 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:49:34,532 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:49:34,532 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605829867]
[2020-10-11 14:49:34,532 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:49:34,533 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:49:34,533 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:49:34,533 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:49:34,533 INFO  L87              Difference]: Start difference. First operand 854 states and 2611 transitions. Second operand 6 states.
[2020-10-11 14:49:34,672 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:49:34,673 INFO  L93              Difference]: Finished difference Result 846 states and 2583 transitions.
[2020-10-11 14:49:34,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-11 14:49:34,674 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2020-10-11 14:49:34,674 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:49:34,680 INFO  L225             Difference]: With dead ends: 846
[2020-10-11 14:49:34,680 INFO  L226             Difference]: Without dead ends: 846
[2020-10-11 14:49:34,681 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:49:34,685 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 846 states.
[2020-10-11 14:49:34,706 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846.
[2020-10-11 14:49:34,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 846 states.
[2020-10-11 14:49:34,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 2583 transitions.
[2020-10-11 14:49:34,711 INFO  L78                 Accepts]: Start accepts. Automaton has 846 states and 2583 transitions. Word has length 15
[2020-10-11 14:49:34,712 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:49:34,712 INFO  L481      AbstractCegarLoop]: Abstraction has 846 states and 2583 transitions.
[2020-10-11 14:49:34,712 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:49:34,712 INFO  L276                IsEmpty]: Start isEmpty. Operand 846 states and 2583 transitions.
[2020-10-11 14:49:34,714 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-11 14:49:34,714 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:34,714 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:49:34,715 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-11 14:49:34,715 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:34,715 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:34,715 INFO  L82        PathProgramCache]: Analyzing trace with hash -1254305700, now seen corresponding path program 1 times
[2020-10-11 14:49:34,715 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:34,716 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099992747]
[2020-10-11 14:49:34,716 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:34,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:49:34,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:49:34,781 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099992747]
[2020-10-11 14:49:34,781 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:49:34,781 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:49:34,782 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459865103]
[2020-10-11 14:49:34,782 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:49:34,782 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:49:34,782 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:49:34,783 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:49:34,783 INFO  L87              Difference]: Start difference. First operand 846 states and 2583 transitions. Second operand 5 states.
[2020-10-11 14:49:34,833 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:49:34,833 INFO  L93              Difference]: Finished difference Result 1119 states and 3359 transitions.
[2020-10-11 14:49:34,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:49:34,834 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-11 14:49:34,834 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:49:34,840 INFO  L225             Difference]: With dead ends: 1119
[2020-10-11 14:49:34,841 INFO  L226             Difference]: Without dead ends: 810
[2020-10-11 14:49:34,841 INFO  L673         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-11 14:49:34,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 810 states.
[2020-10-11 14:49:34,863 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 780.
[2020-10-11 14:49:34,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 780 states.
[2020-10-11 14:49:34,867 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2275 transitions.
[2020-10-11 14:49:34,867 INFO  L78                 Accepts]: Start accepts. Automaton has 780 states and 2275 transitions. Word has length 15
[2020-10-11 14:49:34,868 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:49:34,868 INFO  L481      AbstractCegarLoop]: Abstraction has 780 states and 2275 transitions.
[2020-10-11 14:49:34,868 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:49:34,868 INFO  L276                IsEmpty]: Start isEmpty. Operand 780 states and 2275 transitions.
[2020-10-11 14:49:34,870 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-11 14:49:34,870 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:34,870 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:49:34,871 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-11 14:49:34,871 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:34,871 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:34,871 INFO  L82        PathProgramCache]: Analyzing trace with hash 323564224, now seen corresponding path program 2 times
[2020-10-11 14:49:34,871 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:34,872 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108778348]
[2020-10-11 14:49:34,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:34,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:49:34,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:49:34,939 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108778348]
[2020-10-11 14:49:34,939 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:49:34,940 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:49:34,940 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620359601]
[2020-10-11 14:49:34,940 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:49:34,940 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:49:34,941 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:49:34,941 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:49:34,941 INFO  L87              Difference]: Start difference. First operand 780 states and 2275 transitions. Second operand 4 states.
[2020-10-11 14:49:34,993 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:49:34,993 INFO  L93              Difference]: Finished difference Result 738 states and 1909 transitions.
[2020-10-11 14:49:34,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:49:34,994 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-11 14:49:34,994 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:49:34,998 INFO  L225             Difference]: With dead ends: 738
[2020-10-11 14:49:34,998 INFO  L226             Difference]: Without dead ends: 526
[2020-10-11 14:49:35,001 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:49:35,004 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 526 states.
[2020-10-11 14:49:35,028 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526.
[2020-10-11 14:49:35,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 526 states.
[2020-10-11 14:49:35,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1307 transitions.
[2020-10-11 14:49:35,032 INFO  L78                 Accepts]: Start accepts. Automaton has 526 states and 1307 transitions. Word has length 15
[2020-10-11 14:49:35,032 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:49:35,032 INFO  L481      AbstractCegarLoop]: Abstraction has 526 states and 1307 transitions.
[2020-10-11 14:49:35,032 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:49:35,032 INFO  L276                IsEmpty]: Start isEmpty. Operand 526 states and 1307 transitions.
[2020-10-11 14:49:35,034 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-11 14:49:35,034 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:35,035 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:49:35,035 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-11 14:49:35,035 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:35,036 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:35,036 INFO  L82        PathProgramCache]: Analyzing trace with hash 542786463, now seen corresponding path program 1 times
[2020-10-11 14:49:35,036 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:35,037 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108778030]
[2020-10-11 14:49:35,037 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:35,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:49:35,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:49:35,175 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108778030]
[2020-10-11 14:49:35,175 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:49:35,175 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:49:35,176 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654930967]
[2020-10-11 14:49:35,176 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:49:35,176 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:49:35,176 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:49:35,176 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:49:35,177 INFO  L87              Difference]: Start difference. First operand 526 states and 1307 transitions. Second operand 5 states.
[2020-10-11 14:49:35,226 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:49:35,226 INFO  L93              Difference]: Finished difference Result 430 states and 1005 transitions.
[2020-10-11 14:49:35,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 14:49:35,227 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2020-10-11 14:49:35,227 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:49:35,230 INFO  L225             Difference]: With dead ends: 430
[2020-10-11 14:49:35,230 INFO  L226             Difference]: Without dead ends: 335
[2020-10-11 14:49:35,230 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:49:35,232 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 335 states.
[2020-10-11 14:49:35,238 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 287.
[2020-10-11 14:49:35,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 287 states.
[2020-10-11 14:49:35,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 658 transitions.
[2020-10-11 14:49:35,239 INFO  L78                 Accepts]: Start accepts. Automaton has 287 states and 658 transitions. Word has length 16
[2020-10-11 14:49:35,239 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:49:35,240 INFO  L481      AbstractCegarLoop]: Abstraction has 287 states and 658 transitions.
[2020-10-11 14:49:35,240 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:49:35,240 INFO  L276                IsEmpty]: Start isEmpty. Operand 287 states and 658 transitions.
[2020-10-11 14:49:35,241 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-11 14:49:35,241 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:35,241 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:49:35,241 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-11 14:49:35,241 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:35,242 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:35,242 INFO  L82        PathProgramCache]: Analyzing trace with hash 2138523494, now seen corresponding path program 1 times
[2020-10-11 14:49:35,242 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:35,242 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606499798]
[2020-10-11 14:49:35,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:35,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:49:35,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:49:35,385 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606499798]
[2020-10-11 14:49:35,386 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:49:35,386 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:49:35,386 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399603737]
[2020-10-11 14:49:35,386 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:49:35,387 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:49:35,387 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:49:35,387 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:49:35,387 INFO  L87              Difference]: Start difference. First operand 287 states and 658 transitions. Second operand 6 states.
[2020-10-11 14:49:35,443 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:49:35,443 INFO  L93              Difference]: Finished difference Result 265 states and 613 transitions.
[2020-10-11 14:49:35,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:49:35,444 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2020-10-11 14:49:35,445 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:49:35,446 INFO  L225             Difference]: With dead ends: 265
[2020-10-11 14:49:35,446 INFO  L226             Difference]: Without dead ends: 180
[2020-10-11 14:49:35,446 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:49:35,447 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 180 states.
[2020-10-11 14:49:35,451 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180.
[2020-10-11 14:49:35,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 180 states.
[2020-10-11 14:49:35,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 415 transitions.
[2020-10-11 14:49:35,452 INFO  L78                 Accepts]: Start accepts. Automaton has 180 states and 415 transitions. Word has length 19
[2020-10-11 14:49:35,454 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:49:35,454 INFO  L481      AbstractCegarLoop]: Abstraction has 180 states and 415 transitions.
[2020-10-11 14:49:35,454 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:49:35,454 INFO  L276                IsEmpty]: Start isEmpty. Operand 180 states and 415 transitions.
[2020-10-11 14:49:35,455 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-11 14:49:35,455 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:35,455 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:49:35,455 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-11 14:49:35,455 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:35,456 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:35,456 INFO  L82        PathProgramCache]: Analyzing trace with hash -1778848949, now seen corresponding path program 1 times
[2020-10-11 14:49:35,456 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:35,456 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569382384]
[2020-10-11 14:49:35,456 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:35,486 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:49:35,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:49:35,578 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569382384]
[2020-10-11 14:49:35,578 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:49:35,578 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:49:35,578 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524442962]
[2020-10-11 14:49:35,579 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 14:49:35,579 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:49:35,580 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 14:49:35,580 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:49:35,580 INFO  L87              Difference]: Start difference. First operand 180 states and 415 transitions. Second operand 7 states.
[2020-10-11 14:49:35,676 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:49:35,677 INFO  L93              Difference]: Finished difference Result 218 states and 492 transitions.
[2020-10-11 14:49:35,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:49:35,678 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 23
[2020-10-11 14:49:35,678 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:49:35,679 INFO  L225             Difference]: With dead ends: 218
[2020-10-11 14:49:35,679 INFO  L226             Difference]: Without dead ends: 76
[2020-10-11 14:49:35,679 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2020-10-11 14:49:35,680 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76 states.
[2020-10-11 14:49:35,681 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76.
[2020-10-11 14:49:35,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 76 states.
[2020-10-11 14:49:35,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 143 transitions.
[2020-10-11 14:49:35,682 INFO  L78                 Accepts]: Start accepts. Automaton has 76 states and 143 transitions. Word has length 23
[2020-10-11 14:49:35,682 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:49:35,682 INFO  L481      AbstractCegarLoop]: Abstraction has 76 states and 143 transitions.
[2020-10-11 14:49:35,682 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 14:49:35,682 INFO  L276                IsEmpty]: Start isEmpty. Operand 76 states and 143 transitions.
[2020-10-11 14:49:35,683 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-11 14:49:35,683 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:35,683 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:49:35,683 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-11 14:49:35,683 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:35,684 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:35,684 INFO  L82        PathProgramCache]: Analyzing trace with hash 573624203, now seen corresponding path program 2 times
[2020-10-11 14:49:35,684 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:35,684 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82870687]
[2020-10-11 14:49:35,684 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:35,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:49:36,044 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:49:36,045 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82870687]
[2020-10-11 14:49:36,045 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:49:36,046 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 14:49:36,046 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811024260]
[2020-10-11 14:49:36,046 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-11 14:49:36,046 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:49:36,047 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-11 14:49:36,047 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-10-11 14:49:36,047 INFO  L87              Difference]: Start difference. First operand 76 states and 143 transitions. Second operand 8 states.
[2020-10-11 14:49:36,266 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:49:36,266 INFO  L93              Difference]: Finished difference Result 115 states and 209 transitions.
[2020-10-11 14:49:36,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:49:36,267 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 23
[2020-10-11 14:49:36,268 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:49:36,268 INFO  L225             Difference]: With dead ends: 115
[2020-10-11 14:49:36,268 INFO  L226             Difference]: Without dead ends: 69
[2020-10-11 14:49:36,269 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2020-10-11 14:49:36,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2020-10-11 14:49:36,270 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54.
[2020-10-11 14:49:36,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2020-10-11 14:49:36,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions.
[2020-10-11 14:49:36,271 INFO  L78                 Accepts]: Start accepts. Automaton has 54 states and 91 transitions. Word has length 23
[2020-10-11 14:49:36,271 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:49:36,271 INFO  L481      AbstractCegarLoop]: Abstraction has 54 states and 91 transitions.
[2020-10-11 14:49:36,272 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-11 14:49:36,272 INFO  L276                IsEmpty]: Start isEmpty. Operand 54 states and 91 transitions.
[2020-10-11 14:49:36,272 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-11 14:49:36,272 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:49:36,272 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:49:36,273 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-11 14:49:36,273 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:49:36,273 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:49:36,273 INFO  L82        PathProgramCache]: Analyzing trace with hash 2031733363, now seen corresponding path program 3 times
[2020-10-11 14:49:36,273 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:49:36,274 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028965378]
[2020-10-11 14:49:36,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:49:36,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:49:36,313 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:49:36,353 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:49:36,354 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:49:36,389 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-11 14:49:36,389 INFO  L519         BasicCegarLoop]: Counterexample might be feasible
[2020-10-11 14:49:36,390 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-11 14:49:36,391 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-11 14:49:36,403 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L2-->L845: Formula: (let ((.cse6 (= (mod ~x$r_buff0_thd0~0_In515171362 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In515171362 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In515171362 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In515171362 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out515171362 0)) (or (and .cse0 (= ~x$w_buff1_used~0_Out515171362 ~x$w_buff1_used~0_In515171362)) (and .cse1 .cse2 (= ~x$w_buff1_used~0_Out515171362 0))) (= ~x$r_buff0_thd0~0_In515171362 ~x$r_buff0_thd0~0_Out515171362) (= ~x$r_buff1_thd0~0_In515171362 ~x$r_buff1_thd0~0_Out515171362) (or (and (or (and .cse1 (= ~x~0_Out515171362 ~x$w_buff1~0_In515171362) .cse2) (and (= ~x~0_Out515171362 ~x~0_In515171362) .cse0)) .cse3) (and .cse4 .cse5 (= ~x~0_Out515171362 ~x$w_buff0~0_In515171362))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In515171362| ULTIMATE.start_assume_abort_if_not_~cond_Out515171362) (or (and (= ~x$w_buff0_used~0_In515171362 ~x$w_buff0_used~0_Out515171362) .cse3) (and .cse4 (= 0 ~x$w_buff0_used~0_Out515171362) .cse5)))))  InVars {~x$w_buff0~0=~x$w_buff0~0_In515171362, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In515171362, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In515171362|, ~x$w_buff1~0=~x$w_buff1~0_In515171362, ~x$w_buff1_used~0=~x$w_buff1_used~0_In515171362, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In515171362, ~x~0=~x~0_In515171362, ~x$w_buff0_used~0=~x$w_buff0_used~0_In515171362}  OutVars{~x$w_buff0~0=~x$w_buff0~0_In515171362, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out515171362, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out515171362|, ~x$w_buff1~0=~x$w_buff1~0_In515171362, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out515171362|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out515171362, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out515171362|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out515171362|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out515171362|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out515171362, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out515171362, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out515171362|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In515171362|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out515171362, ~x~0=~x~0_Out515171362}  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-11 14:49:36,409 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,410 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,411 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,411 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,411 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,412 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,412 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,412 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,412 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,412 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,412 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,413 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,413 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,413 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,413 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,414 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,414 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,414 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,414 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,414 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,414 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,415 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,415 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,415 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,415 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,416 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,416 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,416 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,416 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,416 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,416 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,417 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,417 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,417 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,417 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,417 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,418 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,418 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,418 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,418 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,419 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,419 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,419 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,419 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,419 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,419 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,420 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,420 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,420 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,420 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,420 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,420 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,421 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,421 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,421 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,421 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,421 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:49:36,421 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:49:36,484 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:49:36 BasicIcfg
[2020-10-11 14:49:36,484 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-11 14:49:36,486 INFO  L168              Benchmark]: Toolchain (without parser) took 18219.40 ms. Allocated memory was 251.7 MB in the beginning and 548.4 MB in the end (delta: 296.7 MB). Free memory was 207.0 MB in the beginning and 167.9 MB in the end (delta: 39.1 MB). Peak memory consumption was 335.9 MB. Max. memory is 14.2 GB.
[2020-10-11 14:49:36,487 INFO  L168              Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-11 14:49:36,487 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 720.08 ms. Allocated memory was 251.7 MB in the beginning and 315.1 MB in the end (delta: 63.4 MB). Free memory was 207.0 MB in the beginning and 267.6 MB in the end (delta: -60.6 MB). Peak memory consumption was 35.9 MB. Max. memory is 14.2 GB.
[2020-10-11 14:49:36,488 INFO  L168              Benchmark]: Boogie Procedure Inliner took 66.24 ms. Allocated memory is still 315.1 MB. Free memory was 267.6 MB in the beginning and 262.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB.
[2020-10-11 14:49:36,489 INFO  L168              Benchmark]: Boogie Preprocessor took 39.70 ms. Allocated memory is still 315.1 MB. Free memory was 262.6 MB in the beginning and 260.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 14:49:36,490 INFO  L168              Benchmark]: RCFGBuilder took 2350.20 ms. Allocated memory was 315.1 MB in the beginning and 358.6 MB in the end (delta: 43.5 MB). Free memory was 260.1 MB in the beginning and 188.7 MB in the end (delta: 71.4 MB). Peak memory consumption was 114.9 MB. Max. memory is 14.2 GB.
[2020-10-11 14:49:36,490 INFO  L168              Benchmark]: TraceAbstraction took 15037.74 ms. Allocated memory was 358.6 MB in the beginning and 548.4 MB in the end (delta: 189.8 MB). Free memory was 185.4 MB in the beginning and 167.9 MB in the end (delta: 17.5 MB). Peak memory consumption was 207.3 MB. Max. memory is 14.2 GB.
[2020-10-11 14:49:36,494 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 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 720.08 ms. Allocated memory was 251.7 MB in the beginning and 315.1 MB in the end (delta: 63.4 MB). Free memory was 207.0 MB in the beginning and 267.6 MB in the end (delta: -60.6 MB). Peak memory consumption was 35.9 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 66.24 ms. Allocated memory is still 315.1 MB. Free memory was 267.6 MB in the beginning and 262.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 39.70 ms. Allocated memory is still 315.1 MB. Free memory was 262.6 MB in the beginning and 260.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2350.20 ms. Allocated memory was 315.1 MB in the beginning and 358.6 MB in the end (delta: 43.5 MB). Free memory was 260.1 MB in the beginning and 188.7 MB in the end (delta: 71.4 MB). Peak memory consumption was 114.9 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 15037.74 ms. Allocated memory was 358.6 MB in the beginning and 548.4 MB in the end (delta: 189.8 MB). Free memory was 185.4 MB in the beginning and 167.9 MB in the end (delta: 17.5 MB). Peak memory consumption was 207.3 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1419 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 32 SemBasedMoverChecksPositive, 68 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.6s, 195 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.9s, 109 PlacesBefore, 38 PlacesAfterwards, 101 TransitionsBefore, 29 TransitionsAfterwards, 1990 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 5878 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_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: 14.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.9s, HoareTripleCheckerStatistics: 323 SDtfs, 400 SDslu, 550 SDs, 0 SdLazy, 267 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s 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, 12 MinimizatonAttempts, 99 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 25927 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...