/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/mix030_pso.opt.i


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


This is Ultimate 0.1.25-11af1e5
[2020-10-09 12:39:49,993 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-09 12:39:49,996 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-09 12:39:50,041 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-09 12:39:50,042 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-09 12:39:50,053 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-09 12:39:50,056 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-09 12:39:50,060 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-09 12:39:50,062 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-09 12:39:50,062 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-09 12:39:50,064 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-09 12:39:50,066 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-09 12:39:50,066 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-09 12:39:50,071 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-09 12:39:50,074 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-09 12:39:50,076 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-09 12:39:50,077 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-09 12:39:50,079 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-09 12:39:50,081 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-09 12:39:50,087 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-09 12:39:50,091 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-09 12:39:50,092 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-09 12:39:50,093 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-09 12:39:50,094 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-09 12:39:50,099 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-09 12:39:50,100 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-09 12:39:50,100 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-09 12:39:50,103 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-09 12:39:50,104 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-09 12:39:50,104 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-09 12:39:50,105 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-09 12:39:50,105 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-09 12:39:50,106 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-09 12:39:50,107 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-09 12:39:50,108 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-09 12:39:50,108 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-09 12:39:50,109 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-09 12:39:50,109 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-09 12:39:50,109 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-09 12:39:50,110 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-09 12:39:50,111 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-09 12:39:50,112 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-09 12:39:50,158 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-09 12:39:50,159 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-09 12:39:50,161 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-09 12:39:50,161 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-09 12:39:50,161 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-09 12:39:50,161 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-09 12:39:50,162 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-09 12:39:50,162 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-09 12:39:50,162 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-09 12:39:50,162 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-09 12:39:50,163 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-09 12:39:50,164 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-09 12:39:50,164 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-09 12:39:50,164 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-09 12:39:50,164 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-09 12:39:50,165 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-09 12:39:50,165 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-09 12:39:50,165 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-09 12:39:50,165 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-09 12:39:50,165 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-09 12:39:50,166 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-09 12:39:50,166 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-09 12:39:50,166 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-09 12:39:50,166 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-09 12:39:50,166 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-09 12:39:50,167 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-09 12:39:50,167 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-09 12:39:50,167 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-09 12:39:50,167 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-09 12:39:50,167 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-09 12:39:50,445 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-09 12:39:50,457 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-09 12:39:50,460 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-09 12:39:50,462 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-09 12:39:50,462 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-09 12:39:50,463 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i
[2020-10-09 12:39:50,534 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96e39e3c/06331aab30b6476498bcc4ca61ca619b/FLAGd2fab975a
[2020-10-09 12:39:51,097 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-09 12:39:51,098 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i
[2020-10-09 12:39:51,113 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96e39e3c/06331aab30b6476498bcc4ca61ca619b/FLAGd2fab975a
[2020-10-09 12:39:51,354 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96e39e3c/06331aab30b6476498bcc4ca61ca619b
[2020-10-09 12:39:51,362 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-09 12:39:51,363 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-09 12:39:51,365 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-09 12:39:51,365 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-09 12:39:51,368 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-09 12:39:51,369 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:39:51" (1/1) ...
[2020-10-09 12:39:51,372 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2098c7d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:51, skipping insertion in model container
[2020-10-09 12:39:51,372 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:39:51" (1/1) ...
[2020-10-09 12:39:51,380 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-09 12:39:51,423 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-09 12:39:51,998 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-09 12:39:52,019 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-09 12:39:52,085 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-09 12:39:52,170 INFO  L208         MainTranslator]: Completed translation
[2020-10-09 12:39:52,171 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:52 WrapperNode
[2020-10-09 12:39:52,171 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-09 12:39:52,172 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-09 12:39:52,172 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-09 12:39:52,172 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-09 12:39:52,182 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:52" (1/1) ...
[2020-10-09 12:39:52,202 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:52" (1/1) ...
[2020-10-09 12:39:52,245 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-09 12:39:52,246 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-09 12:39:52,246 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-09 12:39:52,246 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-09 12:39:52,257 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:52" (1/1) ...
[2020-10-09 12:39:52,257 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:52" (1/1) ...
[2020-10-09 12:39:52,262 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:52" (1/1) ...
[2020-10-09 12:39:52,262 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:52" (1/1) ...
[2020-10-09 12:39:52,273 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:52" (1/1) ...
[2020-10-09 12:39:52,277 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:52" (1/1) ...
[2020-10-09 12:39:52,282 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:52" (1/1) ...
[2020-10-09 12:39:52,288 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-09 12:39:52,288 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-09 12:39:52,289 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-09 12:39:52,289 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-09 12:39:52,290 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:52" (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-09 12:39:52,357 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-09 12:39:52,357 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-09 12:39:52,357 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-09 12:39:52,358 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-09 12:39:52,358 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-09 12:39:52,358 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-09 12:39:52,358 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-09 12:39:52,358 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-09 12:39:52,359 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-09 12:39:52,359 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-09 12:39:52,359 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-09 12:39:52,359 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-09 12:39:52,359 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-09 12:39:52,360 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-09 12:39:52,360 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-09 12:39:52,362 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-09 12:39:54,339 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-09 12:39:54,340 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-09 12:39:54,342 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:39:54 BoogieIcfgContainer
[2020-10-09 12:39:54,342 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-09 12:39:54,344 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-09 12:39:54,344 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-09 12:39:54,348 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-09 12:39:54,348 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 12:39:51" (1/3) ...
[2020-10-09 12:39:54,349 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bef5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:39:54, skipping insertion in model container
[2020-10-09 12:39:54,349 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:52" (2/3) ...
[2020-10-09 12:39:54,350 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bef5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:39:54, skipping insertion in model container
[2020-10-09 12:39:54,350 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:39:54" (3/3) ...
[2020-10-09 12:39:54,352 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix030_pso.opt.i
[2020-10-09 12:39:54,364 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-09 12:39:54,365 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-09 12:39:54,373 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-09 12:39:54,374 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-09 12:39:54,408 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,408 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,408 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,409 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,409 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,409 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,410 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,410 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,410 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,411 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,411 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,411 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,411 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,412 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,412 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,412 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,412 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,413 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,413 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,414 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,414 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,414 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,414 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,415 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,415 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,415 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,415 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,416 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,416 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,416 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,416 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,416 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,417 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,417 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,417 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,418 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,418 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,418 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,419 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,419 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,419 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,419 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,420 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,420 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,420 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,420 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,420 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,421 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,421 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,425 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,426 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,426 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,426 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,427 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,427 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,427 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,427 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,428 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,428 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,432 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,432 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,432 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,433 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,435 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,435 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,436 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,436 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,436 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,436 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,437 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,437 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,437 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,437 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,439 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,439 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,440 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,440 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,440 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,440 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,440 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,441 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,441 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,441 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,442 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,442 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-09 12:39:54,458 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-09 12:39:54,480 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-09 12:39:54,481 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-09 12:39:54,481 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-09 12:39:54,481 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-09 12:39:54,481 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-09 12:39:54,481 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-09 12:39:54,482 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-09 12:39:54,482 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-09 12:39:54,539 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-09 12:39:54,543 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 240 flow
[2020-10-09 12:39:54,547 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 110 transitions, 240 flow
[2020-10-09 12:39:54,549 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow
[2020-10-09 12:39:54,639 INFO  L129       PetriNetUnfolder]: 2/106 cut-off events.
[2020-10-09 12:39:54,640 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-09 12:39:54,652 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-09 12:39:54,660 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2572
[2020-10-09 12:39:54,742 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-09 12:39:54,743 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:54,872 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-09 12:39:54,872 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:54,874 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-09 12:39:54,875 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:54,913 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-09 12:39:54,914 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:54,916 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-09 12:39:54,917 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:56,168 WARN  L193               SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 230 DAG size of output: 190
[2020-10-09 12:39:56,183 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term
[2020-10-09 12:39:56,184 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:56,186 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-09 12:39:56,186 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:57,047 WARN  L193               SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 127
[2020-10-09 12:39:57,164 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:57,165 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:57,166 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:57,167 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:57,172 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:57,173 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:57,181 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:57,182 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:57,210 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:57,210 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:57,211 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:57,212 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:57,222 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:57,222 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:57,227 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:57,227 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:57,716 WARN  L193               SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-09 12:39:57,977 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:57,977 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:57,978 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:57,979 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:57,981 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:57,982 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:57,987 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:57,988 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,004 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:58,004 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,005 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,006 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,008 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,009 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,011 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:58,011 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,147 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,147 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,148 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,149 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,152 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,152 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,155 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:58,155 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,174 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,175 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,176 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,176 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,179 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,180 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,182 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:58,182 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,239 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,240 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,241 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,266 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,269 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,270 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,272 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:58,272 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,287 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:58,287 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,288 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,288 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,291 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,291 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,293 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:58,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,501 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-09 12:39:58,501 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,706 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:58,706 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,707 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,707 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,711 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,711 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,714 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:58,714 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,738 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:58,739 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,740 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,740 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:58,746 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:58,746 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,751 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:58,751 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:58,917 WARN  L193               SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-09 12:39:59,021 WARN  L193               SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-09 12:39:59,223 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,223 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,224 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,224 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,226 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,227 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,228 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,229 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,248 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,249 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,249 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,250 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,251 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,251 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,252 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,253 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,364 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,365 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,366 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,366 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,367 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,368 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,369 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,369 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,381 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,381 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,382 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,382 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,384 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,384 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,386 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,386 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,436 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,436 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,437 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,437 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,439 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,439 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,440 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,441 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,451 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,452 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,452 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,453 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,454 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,454 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,455 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,456 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,491 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,491 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,492 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,492 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,494 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,494 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,496 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,496 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,508 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,508 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,509 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,509 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,511 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,511 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,513 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,513 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,531 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,532 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,532 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,532 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,534 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,535 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,536 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,537 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,548 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,548 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,549 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,549 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,551 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,551 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,552 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,553 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,641 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,641 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,642 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,642 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,644 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,644 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,645 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,646 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,657 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,657 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,658 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,658 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,660 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,660 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,662 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,662 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,721 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,721 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,722 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,722 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,723 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,724 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,725 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,725 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,736 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,736 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,737 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,737 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,738 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,739 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,740 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,740 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,768 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,769 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,770 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,770 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,771 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,771 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,772 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,773 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,786 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,786 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,787 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,787 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,788 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,789 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,790 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,791 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,807 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,807 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,808 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,808 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,810 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,810 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,811 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,812 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,822 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,822 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,823 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,823 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,825 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,825 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,826 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,827 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,847 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,847 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,848 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,848 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,849 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,850 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,851 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,851 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:39:59,862 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,862 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,863 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,863 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:39:59,864 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:39:59,865 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:39:59,866 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:39:59,867 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:40:00,083 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:40:00,083 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:40:00,084 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:40:00,085 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:40:00,086 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:40:00,086 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:40:00,087 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:40:00,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:40:00,098 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:40:00,099 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:40:00,099 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:40:00,099 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:40:00,101 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:40:00,101 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:40:00,102 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:40:00,102 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:40:00,121 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:40:00,121 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:40:00,122 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:40:00,122 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:40:00,124 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:40:00,124 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:40:00,125 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:40:00,126 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-09 12:40:00,137 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:40:00,138 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:40:00,138 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:40:00,139 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-09 12:40:00,140 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-09 12:40:00,140 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:40:00,142 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-09 12:40:00,142 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-09 12:40:00,926 WARN  L193               SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111
[2020-10-09 12:40:01,276 WARN  L193               SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-10-09 12:40:02,030 WARN  L193               SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93
[2020-10-09 12:40:02,168 WARN  L193               SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 91
[2020-10-09 12:40:03,286 WARN  L193               SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 146 DAG size of output: 137
[2020-10-09 12:40:03,781 WARN  L193               SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-09 12:40:03,898 INFO  L132        LiptonReduction]: Checked pairs total: 7693
[2020-10-09 12:40:03,898 INFO  L134        LiptonReduction]: Total number of compositions: 90
[2020-10-09 12:40:03,906 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow
[2020-10-09 12:40:04,188 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states.
[2020-10-09 12:40:04,191 INFO  L276                IsEmpty]: Start isEmpty. Operand 3890 states.
[2020-10-09 12:40:04,199 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-09 12:40:04,199 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:04,200 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:04,201 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:04,208 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:04,209 INFO  L82        PathProgramCache]: Analyzing trace with hash -1030616479, now seen corresponding path program 1 times
[2020-10-09 12:40:04,219 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:04,220 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479065717]
[2020-10-09 12:40:04,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:04,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:04,479 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-09 12:40:04,480 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479065717]
[2020-10-09 12:40:04,480 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:04,481 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-09 12:40:04,482 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575222674]
[2020-10-09 12:40:04,487 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-09 12:40:04,487 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:04,503 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-09 12:40:04,504 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-09 12:40:04,506 INFO  L87              Difference]: Start difference. First operand 3890 states. Second operand 3 states.
[2020-10-09 12:40:04,647 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:04,647 INFO  L93              Difference]: Finished difference Result 3250 states and 12738 transitions.
[2020-10-09 12:40:04,648 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-09 12:40:04,650 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-09 12:40:04,650 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:04,694 INFO  L225             Difference]: With dead ends: 3250
[2020-10-09 12:40:04,694 INFO  L226             Difference]: Without dead ends: 2650
[2020-10-09 12:40:04,695 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-09 12:40:04,735 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2650 states.
[2020-10-09 12:40:04,876 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650.
[2020-10-09 12:40:04,878 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2650 states.
[2020-10-09 12:40:04,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions.
[2020-10-09 12:40:04,896 INFO  L78                 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7
[2020-10-09 12:40:04,897 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:04,898 INFO  L481      AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions.
[2020-10-09 12:40:04,898 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-09 12:40:04,898 INFO  L276                IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions.
[2020-10-09 12:40:04,901 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-09 12:40:04,901 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:04,901 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:04,901 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-09 12:40:04,902 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:04,902 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:04,902 INFO  L82        PathProgramCache]: Analyzing trace with hash -1072761819, now seen corresponding path program 1 times
[2020-10-09 12:40:04,902 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:04,903 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191109571]
[2020-10-09 12:40:04,903 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:04,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:05,049 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-09 12:40:05,050 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191109571]
[2020-10-09 12:40:05,050 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:05,050 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-09 12:40:05,050 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705355343]
[2020-10-09 12:40:05,052 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-09 12:40:05,052 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:05,053 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-09 12:40:05,053 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-09 12:40:05,053 INFO  L87              Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states.
[2020-10-09 12:40:05,116 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:05,116 INFO  L93              Difference]: Finished difference Result 2610 states and 10046 transitions.
[2020-10-09 12:40:05,117 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-09 12:40:05,117 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-09 12:40:05,118 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:05,144 INFO  L225             Difference]: With dead ends: 2610
[2020-10-09 12:40:05,144 INFO  L226             Difference]: Without dead ends: 2610
[2020-10-09 12:40:05,145 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-09 12:40:05,159 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2610 states.
[2020-10-09 12:40:05,229 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610.
[2020-10-09 12:40:05,230 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2610 states.
[2020-10-09 12:40:05,245 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10046 transitions.
[2020-10-09 12:40:05,245 INFO  L78                 Accepts]: Start accepts. Automaton has 2610 states and 10046 transitions. Word has length 11
[2020-10-09 12:40:05,246 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:05,246 INFO  L481      AbstractCegarLoop]: Abstraction has 2610 states and 10046 transitions.
[2020-10-09 12:40:05,246 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-09 12:40:05,246 INFO  L276                IsEmpty]: Start isEmpty. Operand 2610 states and 10046 transitions.
[2020-10-09 12:40:05,249 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-09 12:40:05,249 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:05,249 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:05,249 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-09 12:40:05,250 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:05,250 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:05,250 INFO  L82        PathProgramCache]: Analyzing trace with hash -121033002, now seen corresponding path program 1 times
[2020-10-09 12:40:05,250 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:05,250 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875035692]
[2020-10-09 12:40:05,251 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:05,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:05,485 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-09 12:40:05,486 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875035692]
[2020-10-09 12:40:05,486 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:05,486 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-09 12:40:05,486 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126103617]
[2020-10-09 12:40:05,487 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-09 12:40:05,487 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:05,487 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-09 12:40:05,487 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-09 12:40:05,488 INFO  L87              Difference]: Start difference. First operand 2610 states and 10046 transitions. Second operand 5 states.
[2020-10-09 12:40:05,642 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:05,643 INFO  L93              Difference]: Finished difference Result 2690 states and 10298 transitions.
[2020-10-09 12:40:05,644 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-09 12:40:05,644 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-09 12:40:05,644 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:05,671 INFO  L225             Difference]: With dead ends: 2690
[2020-10-09 12:40:05,671 INFO  L226             Difference]: Without dead ends: 2690
[2020-10-09 12:40:05,672 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-09 12:40:05,687 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2690 states.
[2020-10-09 12:40:05,756 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2690.
[2020-10-09 12:40:05,757 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2690 states.
[2020-10-09 12:40:05,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 10298 transitions.
[2020-10-09 12:40:05,771 INFO  L78                 Accepts]: Start accepts. Automaton has 2690 states and 10298 transitions. Word has length 12
[2020-10-09 12:40:05,771 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:05,771 INFO  L481      AbstractCegarLoop]: Abstraction has 2690 states and 10298 transitions.
[2020-10-09 12:40:05,771 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-09 12:40:05,771 INFO  L276                IsEmpty]: Start isEmpty. Operand 2690 states and 10298 transitions.
[2020-10-09 12:40:05,774 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-09 12:40:05,774 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:05,774 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:05,774 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-09 12:40:05,775 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:05,775 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:05,775 INFO  L82        PathProgramCache]: Analyzing trace with hash -131988125, now seen corresponding path program 1 times
[2020-10-09 12:40:05,775 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:05,776 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640472324]
[2020-10-09 12:40:05,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:05,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:05,836 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-09 12:40:05,837 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640472324]
[2020-10-09 12:40:05,837 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:05,837 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-09 12:40:05,837 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454637288]
[2020-10-09 12:40:05,838 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-09 12:40:05,838 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:05,838 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-09 12:40:05,839 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-09 12:40:05,839 INFO  L87              Difference]: Start difference. First operand 2690 states and 10298 transitions. Second operand 3 states.
[2020-10-09 12:40:05,898 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:05,899 INFO  L93              Difference]: Finished difference Result 2682 states and 10260 transitions.
[2020-10-09 12:40:05,900 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-09 12:40:05,900 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2020-10-09 12:40:05,900 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:05,922 INFO  L225             Difference]: With dead ends: 2682
[2020-10-09 12:40:05,923 INFO  L226             Difference]: Without dead ends: 2682
[2020-10-09 12:40:05,923 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-09 12:40:05,939 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2682 states.
[2020-10-09 12:40:06,009 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2682.
[2020-10-09 12:40:06,009 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2682 states.
[2020-10-09 12:40:06,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 10260 transitions.
[2020-10-09 12:40:06,025 INFO  L78                 Accepts]: Start accepts. Automaton has 2682 states and 10260 transitions. Word has length 13
[2020-10-09 12:40:06,026 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:06,026 INFO  L481      AbstractCegarLoop]: Abstraction has 2682 states and 10260 transitions.
[2020-10-09 12:40:06,026 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-09 12:40:06,026 INFO  L276                IsEmpty]: Start isEmpty. Operand 2682 states and 10260 transitions.
[2020-10-09 12:40:06,029 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-09 12:40:06,029 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:06,029 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:06,029 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-09 12:40:06,029 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:06,030 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:06,030 INFO  L82        PathProgramCache]: Analyzing trace with hash -1786313371, now seen corresponding path program 1 times
[2020-10-09 12:40:06,030 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:06,030 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726757707]
[2020-10-09 12:40:06,031 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:06,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:06,084 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-09 12:40:06,084 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726757707]
[2020-10-09 12:40:06,084 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:06,084 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-09 12:40:06,085 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257297808]
[2020-10-09 12:40:06,085 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-09 12:40:06,085 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:06,085 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-09 12:40:06,086 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-09 12:40:06,086 INFO  L87              Difference]: Start difference. First operand 2682 states and 10260 transitions. Second operand 3 states.
[2020-10-09 12:40:06,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:06,144 INFO  L93              Difference]: Finished difference Result 2658 states and 10154 transitions.
[2020-10-09 12:40:06,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-09 12:40:06,146 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 14
[2020-10-09 12:40:06,146 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:06,170 INFO  L225             Difference]: With dead ends: 2658
[2020-10-09 12:40:06,171 INFO  L226             Difference]: Without dead ends: 2658
[2020-10-09 12:40:06,171 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-09 12:40:06,187 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2658 states.
[2020-10-09 12:40:06,321 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2658.
[2020-10-09 12:40:06,321 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2658 states.
[2020-10-09 12:40:06,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 10154 transitions.
[2020-10-09 12:40:06,335 INFO  L78                 Accepts]: Start accepts. Automaton has 2658 states and 10154 transitions. Word has length 14
[2020-10-09 12:40:06,336 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:06,336 INFO  L481      AbstractCegarLoop]: Abstraction has 2658 states and 10154 transitions.
[2020-10-09 12:40:06,336 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-09 12:40:06,336 INFO  L276                IsEmpty]: Start isEmpty. Operand 2658 states and 10154 transitions.
[2020-10-09 12:40:06,338 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-09 12:40:06,339 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:06,339 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:06,339 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-09 12:40:06,339 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:06,339 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:06,340 INFO  L82        PathProgramCache]: Analyzing trace with hash 2055302709, now seen corresponding path program 1 times
[2020-10-09 12:40:06,340 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:06,340 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669994138]
[2020-10-09 12:40:06,340 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:06,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:06,406 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-09 12:40:06,407 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669994138]
[2020-10-09 12:40:06,407 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:06,407 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-09 12:40:06,407 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006221440]
[2020-10-09 12:40:06,408 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-09 12:40:06,408 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:06,408 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-09 12:40:06,408 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-09 12:40:06,409 INFO  L87              Difference]: Start difference. First operand 2658 states and 10154 transitions. Second operand 4 states.
[2020-10-09 12:40:06,488 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:06,488 INFO  L93              Difference]: Finished difference Result 2546 states and 9694 transitions.
[2020-10-09 12:40:06,489 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-09 12:40:06,489 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-09 12:40:06,490 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:06,501 INFO  L225             Difference]: With dead ends: 2546
[2020-10-09 12:40:06,502 INFO  L226             Difference]: Without dead ends: 2546
[2020-10-09 12:40:06,502 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-09 12:40:06,515 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2546 states.
[2020-10-09 12:40:06,572 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2418.
[2020-10-09 12:40:06,573 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2418 states.
[2020-10-09 12:40:06,584 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions.
[2020-10-09 12:40:06,584 INFO  L78                 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 14
[2020-10-09 12:40:06,584 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:06,584 INFO  L481      AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions.
[2020-10-09 12:40:06,584 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-09 12:40:06,585 INFO  L276                IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions.
[2020-10-09 12:40:06,587 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-09 12:40:06,588 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:06,588 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:06,588 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-09 12:40:06,589 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:06,589 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:06,589 INFO  L82        PathProgramCache]: Analyzing trace with hash -348629036, now seen corresponding path program 1 times
[2020-10-09 12:40:06,589 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:06,590 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402031142]
[2020-10-09 12:40:06,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:06,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:06,652 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-09 12:40:06,652 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402031142]
[2020-10-09 12:40:06,653 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:06,653 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-09 12:40:06,653 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759210184]
[2020-10-09 12:40:06,653 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-09 12:40:06,654 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:06,654 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-09 12:40:06,654 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-09 12:40:06,654 INFO  L87              Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 3 states.
[2020-10-09 12:40:06,677 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:06,677 INFO  L93              Difference]: Finished difference Result 2386 states and 9070 transitions.
[2020-10-09 12:40:06,678 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-09 12:40:06,679 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 14
[2020-10-09 12:40:06,679 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:06,689 INFO  L225             Difference]: With dead ends: 2386
[2020-10-09 12:40:06,689 INFO  L226             Difference]: Without dead ends: 2386
[2020-10-09 12:40:06,690 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-09 12:40:06,702 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2386 states.
[2020-10-09 12:40:06,756 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386.
[2020-10-09 12:40:06,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2386 states.
[2020-10-09 12:40:06,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 9070 transitions.
[2020-10-09 12:40:06,766 INFO  L78                 Accepts]: Start accepts. Automaton has 2386 states and 9070 transitions. Word has length 14
[2020-10-09 12:40:06,767 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:06,767 INFO  L481      AbstractCegarLoop]: Abstraction has 2386 states and 9070 transitions.
[2020-10-09 12:40:06,767 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-09 12:40:06,767 INFO  L276                IsEmpty]: Start isEmpty. Operand 2386 states and 9070 transitions.
[2020-10-09 12:40:06,770 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-09 12:40:06,770 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:06,771 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:06,771 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-09 12:40:06,771 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:06,771 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:06,771 INFO  L82        PathProgramCache]: Analyzing trace with hash 222355305, now seen corresponding path program 1 times
[2020-10-09 12:40:06,772 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:06,772 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767798855]
[2020-10-09 12:40:06,772 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:06,786 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:06,909 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-09 12:40:06,909 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767798855]
[2020-10-09 12:40:06,909 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:06,909 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-09 12:40:06,910 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313946854]
[2020-10-09 12:40:06,910 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-09 12:40:06,910 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:06,911 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-09 12:40:06,911 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-09 12:40:06,911 INFO  L87              Difference]: Start difference. First operand 2386 states and 9070 transitions. Second operand 5 states.
[2020-10-09 12:40:07,051 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:07,051 INFO  L93              Difference]: Finished difference Result 2378 states and 9024 transitions.
[2020-10-09 12:40:07,052 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-09 12:40:07,052 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-09 12:40:07,052 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:07,063 INFO  L225             Difference]: With dead ends: 2378
[2020-10-09 12:40:07,063 INFO  L226             Difference]: Without dead ends: 2378
[2020-10-09 12:40:07,064 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-09 12:40:07,076 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2378 states.
[2020-10-09 12:40:07,129 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2338.
[2020-10-09 12:40:07,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2338 states.
[2020-10-09 12:40:07,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 8870 transitions.
[2020-10-09 12:40:07,139 INFO  L78                 Accepts]: Start accepts. Automaton has 2338 states and 8870 transitions. Word has length 15
[2020-10-09 12:40:07,139 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:07,140 INFO  L481      AbstractCegarLoop]: Abstraction has 2338 states and 8870 transitions.
[2020-10-09 12:40:07,140 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-09 12:40:07,140 INFO  L276                IsEmpty]: Start isEmpty. Operand 2338 states and 8870 transitions.
[2020-10-09 12:40:07,143 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-09 12:40:07,143 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:07,143 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:07,143 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-09 12:40:07,143 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:07,144 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:07,144 INFO  L82        PathProgramCache]: Analyzing trace with hash -93104110, now seen corresponding path program 1 times
[2020-10-09 12:40:07,144 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:07,144 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651802185]
[2020-10-09 12:40:07,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:07,172 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:07,308 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-09 12:40:07,308 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651802185]
[2020-10-09 12:40:07,309 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:07,309 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-09 12:40:07,309 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531184858]
[2020-10-09 12:40:07,309 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-09 12:40:07,310 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:07,310 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-09 12:40:07,310 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-09 12:40:07,310 INFO  L87              Difference]: Start difference. First operand 2338 states and 8870 transitions. Second operand 5 states.
[2020-10-09 12:40:07,424 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:07,425 INFO  L93              Difference]: Finished difference Result 2762 states and 10430 transitions.
[2020-10-09 12:40:07,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-09 12:40:07,426 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-09 12:40:07,426 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:07,438 INFO  L225             Difference]: With dead ends: 2762
[2020-10-09 12:40:07,438 INFO  L226             Difference]: Without dead ends: 2762
[2020-10-09 12:40:07,438 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-09 12:40:07,450 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2762 states.
[2020-10-09 12:40:07,517 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762.
[2020-10-09 12:40:07,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2762 states.
[2020-10-09 12:40:07,530 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 10430 transitions.
[2020-10-09 12:40:07,530 INFO  L78                 Accepts]: Start accepts. Automaton has 2762 states and 10430 transitions. Word has length 15
[2020-10-09 12:40:07,530 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:07,530 INFO  L481      AbstractCegarLoop]: Abstraction has 2762 states and 10430 transitions.
[2020-10-09 12:40:07,531 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-09 12:40:07,531 INFO  L276                IsEmpty]: Start isEmpty. Operand 2762 states and 10430 transitions.
[2020-10-09 12:40:07,537 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-09 12:40:07,537 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:07,537 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:07,538 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-09 12:40:07,538 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:07,538 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:07,538 INFO  L82        PathProgramCache]: Analyzing trace with hash -112806921, now seen corresponding path program 1 times
[2020-10-09 12:40:07,538 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:07,539 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181821882]
[2020-10-09 12:40:07,539 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:07,578 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:07,792 WARN  L193               SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18
[2020-10-09 12:40:07,856 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-09 12:40:07,856 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181821882]
[2020-10-09 12:40:07,856 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:07,856 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-09 12:40:07,857 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561422627]
[2020-10-09 12:40:07,857 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-09 12:40:07,857 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:07,857 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-09 12:40:07,858 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-09 12:40:07,858 INFO  L87              Difference]: Start difference. First operand 2762 states and 10430 transitions. Second operand 7 states.
[2020-10-09 12:40:08,084 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:08,084 INFO  L93              Difference]: Finished difference Result 3282 states and 12440 transitions.
[2020-10-09 12:40:08,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-09 12:40:08,085 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-09 12:40:08,085 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:08,099 INFO  L225             Difference]: With dead ends: 3282
[2020-10-09 12:40:08,099 INFO  L226             Difference]: Without dead ends: 3282
[2020-10-09 12:40:08,100 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2020-10-09 12:40:08,114 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3282 states.
[2020-10-09 12:40:08,187 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 2962.
[2020-10-09 12:40:08,188 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2962 states.
[2020-10-09 12:40:08,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 11256 transitions.
[2020-10-09 12:40:08,203 INFO  L78                 Accepts]: Start accepts. Automaton has 2962 states and 11256 transitions. Word has length 17
[2020-10-09 12:40:08,204 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:08,204 INFO  L481      AbstractCegarLoop]: Abstraction has 2962 states and 11256 transitions.
[2020-10-09 12:40:08,204 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-09 12:40:08,204 INFO  L276                IsEmpty]: Start isEmpty. Operand 2962 states and 11256 transitions.
[2020-10-09 12:40:08,212 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-09 12:40:08,212 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:08,212 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:08,213 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-09 12:40:08,213 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:08,213 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:08,213 INFO  L82        PathProgramCache]: Analyzing trace with hash -1063517833, now seen corresponding path program 2 times
[2020-10-09 12:40:08,214 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:08,214 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719758295]
[2020-10-09 12:40:08,214 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:08,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:08,506 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-09 12:40:08,506 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719758295]
[2020-10-09 12:40:08,506 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:08,506 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-09 12:40:08,507 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829128102]
[2020-10-09 12:40:08,507 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-09 12:40:08,507 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:08,507 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-09 12:40:08,508 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-09 12:40:08,508 INFO  L87              Difference]: Start difference. First operand 2962 states and 11256 transitions. Second operand 7 states.
[2020-10-09 12:40:08,744 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:08,745 INFO  L93              Difference]: Finished difference Result 3026 states and 11448 transitions.
[2020-10-09 12:40:08,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-09 12:40:08,746 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-09 12:40:08,746 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:08,758 INFO  L225             Difference]: With dead ends: 3026
[2020-10-09 12:40:08,758 INFO  L226             Difference]: Without dead ends: 3026
[2020-10-09 12:40:08,759 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2020-10-09 12:40:08,772 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3026 states.
[2020-10-09 12:40:08,828 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 2506.
[2020-10-09 12:40:08,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2506 states.
[2020-10-09 12:40:08,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9438 transitions.
[2020-10-09 12:40:08,838 INFO  L78                 Accepts]: Start accepts. Automaton has 2506 states and 9438 transitions. Word has length 17
[2020-10-09 12:40:08,838 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:08,839 INFO  L481      AbstractCegarLoop]: Abstraction has 2506 states and 9438 transitions.
[2020-10-09 12:40:08,839 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-09 12:40:08,839 INFO  L276                IsEmpty]: Start isEmpty. Operand 2506 states and 9438 transitions.
[2020-10-09 12:40:08,844 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-09 12:40:08,844 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:08,844 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:08,844 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-09 12:40:08,844 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:08,845 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:08,845 INFO  L82        PathProgramCache]: Analyzing trace with hash 207234097, now seen corresponding path program 1 times
[2020-10-09 12:40:08,845 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:08,845 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604612342]
[2020-10-09 12:40:08,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:08,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:08,942 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-09 12:40:08,942 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604612342]
[2020-10-09 12:40:08,942 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:08,942 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-09 12:40:08,943 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934318938]
[2020-10-09 12:40:08,943 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-09 12:40:08,943 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:08,943 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-09 12:40:08,944 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-09 12:40:08,944 INFO  L87              Difference]: Start difference. First operand 2506 states and 9438 transitions. Second operand 4 states.
[2020-10-09 12:40:08,995 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:08,995 INFO  L93              Difference]: Finished difference Result 2608 states and 8966 transitions.
[2020-10-09 12:40:08,996 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-09 12:40:08,996 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2020-10-09 12:40:08,996 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:09,003 INFO  L225             Difference]: With dead ends: 2608
[2020-10-09 12:40:09,004 INFO  L226             Difference]: Without dead ends: 1928
[2020-10-09 12:40:09,004 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-09 12:40:09,013 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2020-10-09 12:40:09,049 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2020-10-09 12:40:09,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1928 states.
[2020-10-09 12:40:09,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 6548 transitions.
[2020-10-09 12:40:09,056 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 6548 transitions. Word has length 17
[2020-10-09 12:40:09,056 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:09,056 INFO  L481      AbstractCegarLoop]: Abstraction has 1928 states and 6548 transitions.
[2020-10-09 12:40:09,057 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-09 12:40:09,057 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 6548 transitions.
[2020-10-09 12:40:09,060 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-09 12:40:09,061 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:09,061 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-09 12:40:09,061 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-09 12:40:09,061 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:09,061 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:09,061 INFO  L82        PathProgramCache]: Analyzing trace with hash -791241669, now seen corresponding path program 1 times
[2020-10-09 12:40:09,062 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:09,062 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721501199]
[2020-10-09 12:40:09,062 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:09,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:09,134 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-09 12:40:09,135 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721501199]
[2020-10-09 12:40:09,135 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:09,135 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-09 12:40:09,135 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215569274]
[2020-10-09 12:40:09,136 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-09 12:40:09,136 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:09,136 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-09 12:40:09,136 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-09 12:40:09,136 INFO  L87              Difference]: Start difference. First operand 1928 states and 6548 transitions. Second operand 5 states.
[2020-10-09 12:40:09,196 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:09,196 INFO  L93              Difference]: Finished difference Result 1677 states and 5264 transitions.
[2020-10-09 12:40:09,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-09 12:40:09,197 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2020-10-09 12:40:09,197 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:09,202 INFO  L225             Difference]: With dead ends: 1677
[2020-10-09 12:40:09,202 INFO  L226             Difference]: Without dead ends: 1261
[2020-10-09 12:40:09,204 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-09 12:40:09,211 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1261 states.
[2020-10-09 12:40:09,237 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1261.
[2020-10-09 12:40:09,237 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1261 states.
[2020-10-09 12:40:09,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 3880 transitions.
[2020-10-09 12:40:09,241 INFO  L78                 Accepts]: Start accepts. Automaton has 1261 states and 3880 transitions. Word has length 18
[2020-10-09 12:40:09,241 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:09,241 INFO  L481      AbstractCegarLoop]: Abstraction has 1261 states and 3880 transitions.
[2020-10-09 12:40:09,241 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-09 12:40:09,241 INFO  L276                IsEmpty]: Start isEmpty. Operand 1261 states and 3880 transitions.
[2020-10-09 12:40:09,244 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-09 12:40:09,244 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:09,244 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]
[2020-10-09 12:40:09,245 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-09 12:40:09,245 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:09,245 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:09,245 INFO  L82        PathProgramCache]: Analyzing trace with hash 694225450, now seen corresponding path program 1 times
[2020-10-09 12:40:09,245 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:09,246 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536202359]
[2020-10-09 12:40:09,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:09,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:09,311 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-09 12:40:09,311 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536202359]
[2020-10-09 12:40:09,311 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:09,312 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-09 12:40:09,312 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942398006]
[2020-10-09 12:40:09,312 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-09 12:40:09,312 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:09,312 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-09 12:40:09,313 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-09 12:40:09,313 INFO  L87              Difference]: Start difference. First operand 1261 states and 3880 transitions. Second operand 3 states.
[2020-10-09 12:40:09,329 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:09,330 INFO  L93              Difference]: Finished difference Result 1811 states and 5421 transitions.
[2020-10-09 12:40:09,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-09 12:40:09,331 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 20
[2020-10-09 12:40:09,331 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:09,335 INFO  L225             Difference]: With dead ends: 1811
[2020-10-09 12:40:09,336 INFO  L226             Difference]: Without dead ends: 1273
[2020-10-09 12:40:09,336 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-09 12:40:09,341 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1273 states.
[2020-10-09 12:40:09,359 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1253.
[2020-10-09 12:40:09,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1253 states.
[2020-10-09 12:40:09,363 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 3643 transitions.
[2020-10-09 12:40:09,363 INFO  L78                 Accepts]: Start accepts. Automaton has 1253 states and 3643 transitions. Word has length 20
[2020-10-09 12:40:09,363 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:09,363 INFO  L481      AbstractCegarLoop]: Abstraction has 1253 states and 3643 transitions.
[2020-10-09 12:40:09,363 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-09 12:40:09,364 INFO  L276                IsEmpty]: Start isEmpty. Operand 1253 states and 3643 transitions.
[2020-10-09 12:40:09,366 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-09 12:40:09,367 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:09,367 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]
[2020-10-09 12:40:09,367 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-09 12:40:09,367 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:09,367 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:09,367 INFO  L82        PathProgramCache]: Analyzing trace with hash -905674660, now seen corresponding path program 1 times
[2020-10-09 12:40:09,368 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:09,368 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381388006]
[2020-10-09 12:40:09,368 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:09,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:09,436 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-09 12:40:09,436 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381388006]
[2020-10-09 12:40:09,436 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:09,437 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-09 12:40:09,437 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973750090]
[2020-10-09 12:40:09,437 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-09 12:40:09,437 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:09,438 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-09 12:40:09,438 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-09 12:40:09,438 INFO  L87              Difference]: Start difference. First operand 1253 states and 3643 transitions. Second operand 6 states.
[2020-10-09 12:40:09,497 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:09,497 INFO  L93              Difference]: Finished difference Result 1111 states and 3191 transitions.
[2020-10-09 12:40:09,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-09 12:40:09,498 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 21
[2020-10-09 12:40:09,498 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:09,502 INFO  L225             Difference]: With dead ends: 1111
[2020-10-09 12:40:09,502 INFO  L226             Difference]: Without dead ends: 981
[2020-10-09 12:40:09,502 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-09 12:40:09,506 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 981 states.
[2020-10-09 12:40:09,519 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 949.
[2020-10-09 12:40:09,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 949 states.
[2020-10-09 12:40:09,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2767 transitions.
[2020-10-09 12:40:09,522 INFO  L78                 Accepts]: Start accepts. Automaton has 949 states and 2767 transitions. Word has length 21
[2020-10-09 12:40:09,522 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:09,522 INFO  L481      AbstractCegarLoop]: Abstraction has 949 states and 2767 transitions.
[2020-10-09 12:40:09,522 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-09 12:40:09,523 INFO  L276                IsEmpty]: Start isEmpty. Operand 949 states and 2767 transitions.
[2020-10-09 12:40:09,525 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-09 12:40:09,525 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:09,526 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, 1]
[2020-10-09 12:40:09,526 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-09 12:40:09,526 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:09,526 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:09,526 INFO  L82        PathProgramCache]: Analyzing trace with hash -730235590, now seen corresponding path program 1 times
[2020-10-09 12:40:09,526 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:09,527 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19783855]
[2020-10-09 12:40:09,527 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:09,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:09,627 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-09 12:40:09,627 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19783855]
[2020-10-09 12:40:09,628 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:09,628 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-09 12:40:09,628 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909954515]
[2020-10-09 12:40:09,629 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-09 12:40:09,629 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:09,629 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-09 12:40:09,629 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-09 12:40:09,629 INFO  L87              Difference]: Start difference. First operand 949 states and 2767 transitions. Second operand 7 states.
[2020-10-09 12:40:09,763 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:09,763 INFO  L93              Difference]: Finished difference Result 920 states and 2708 transitions.
[2020-10-09 12:40:09,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-09 12:40:09,764 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2020-10-09 12:40:09,764 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:09,767 INFO  L225             Difference]: With dead ends: 920
[2020-10-09 12:40:09,767 INFO  L226             Difference]: Without dead ends: 565
[2020-10-09 12:40:09,767 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-09 12:40:09,769 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 565 states.
[2020-10-09 12:40:09,776 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 517.
[2020-10-09 12:40:09,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 517 states.
[2020-10-09 12:40:09,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1477 transitions.
[2020-10-09 12:40:09,778 INFO  L78                 Accepts]: Start accepts. Automaton has 517 states and 1477 transitions. Word has length 24
[2020-10-09 12:40:09,778 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:09,778 INFO  L481      AbstractCegarLoop]: Abstraction has 517 states and 1477 transitions.
[2020-10-09 12:40:09,778 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-09 12:40:09,778 INFO  L276                IsEmpty]: Start isEmpty. Operand 517 states and 1477 transitions.
[2020-10-09 12:40:09,780 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-09 12:40:09,781 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:09,781 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, 1, 1, 1, 1]
[2020-10-09 12:40:09,781 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-09 12:40:09,781 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:09,781 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:09,782 INFO  L82        PathProgramCache]: Analyzing trace with hash -126296697, now seen corresponding path program 1 times
[2020-10-09 12:40:09,782 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:09,782 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661150167]
[2020-10-09 12:40:09,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:09,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:09,831 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-09 12:40:09,831 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661150167]
[2020-10-09 12:40:09,832 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:09,832 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-09 12:40:09,832 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129907930]
[2020-10-09 12:40:09,833 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-09 12:40:09,833 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:09,833 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-09 12:40:09,833 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-09 12:40:09,833 INFO  L87              Difference]: Start difference. First operand 517 states and 1477 transitions. Second operand 4 states.
[2020-10-09 12:40:09,855 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:09,856 INFO  L93              Difference]: Finished difference Result 684 states and 1931 transitions.
[2020-10-09 12:40:09,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-09 12:40:09,857 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 27
[2020-10-09 12:40:09,857 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:09,858 INFO  L225             Difference]: With dead ends: 684
[2020-10-09 12:40:09,858 INFO  L226             Difference]: Without dead ends: 214
[2020-10-09 12:40:09,858 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-09 12:40:09,861 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 214 states.
[2020-10-09 12:40:09,864 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214.
[2020-10-09 12:40:09,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 214 states.
[2020-10-09 12:40:09,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 543 transitions.
[2020-10-09 12:40:09,865 INFO  L78                 Accepts]: Start accepts. Automaton has 214 states and 543 transitions. Word has length 27
[2020-10-09 12:40:09,865 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:09,865 INFO  L481      AbstractCegarLoop]: Abstraction has 214 states and 543 transitions.
[2020-10-09 12:40:09,865 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-09 12:40:09,866 INFO  L276                IsEmpty]: Start isEmpty. Operand 214 states and 543 transitions.
[2020-10-09 12:40:09,866 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-09 12:40:09,866 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:09,867 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, 1, 1, 1, 1]
[2020-10-09 12:40:09,867 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-09 12:40:09,867 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:09,867 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:09,868 INFO  L82        PathProgramCache]: Analyzing trace with hash -666194943, now seen corresponding path program 2 times
[2020-10-09 12:40:09,868 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:09,868 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948073091]
[2020-10-09 12:40:09,868 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:09,919 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:10,327 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-09 12:40:10,329 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948073091]
[2020-10-09 12:40:10,330 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:10,330 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-09 12:40:10,330 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119911002]
[2020-10-09 12:40:10,330 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-09 12:40:10,331 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:10,331 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-09 12:40:10,331 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-10-09 12:40:10,331 INFO  L87              Difference]: Start difference. First operand 214 states and 543 transitions. Second operand 8 states.
[2020-10-09 12:40:10,635 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:10,635 INFO  L93              Difference]: Finished difference Result 388 states and 958 transitions.
[2020-10-09 12:40:10,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-09 12:40:10,636 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 27
[2020-10-09 12:40:10,636 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:10,637 INFO  L225             Difference]: With dead ends: 388
[2020-10-09 12:40:10,637 INFO  L226             Difference]: Without dead ends: 279
[2020-10-09 12:40:10,637 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2020-10-09 12:40:10,638 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 279 states.
[2020-10-09 12:40:10,641 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 216.
[2020-10-09 12:40:10,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 216 states.
[2020-10-09 12:40:10,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 539 transitions.
[2020-10-09 12:40:10,642 INFO  L78                 Accepts]: Start accepts. Automaton has 216 states and 539 transitions. Word has length 27
[2020-10-09 12:40:10,642 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:10,643 INFO  L481      AbstractCegarLoop]: Abstraction has 216 states and 539 transitions.
[2020-10-09 12:40:10,643 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-09 12:40:10,643 INFO  L276                IsEmpty]: Start isEmpty. Operand 216 states and 539 transitions.
[2020-10-09 12:40:10,643 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-09 12:40:10,644 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:10,644 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, 1, 1, 1, 1]
[2020-10-09 12:40:10,644 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-09 12:40:10,644 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:10,644 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:10,644 INFO  L82        PathProgramCache]: Analyzing trace with hash -743959581, now seen corresponding path program 3 times
[2020-10-09 12:40:10,645 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:10,645 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857393623]
[2020-10-09 12:40:10,645 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:10,673 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-09 12:40:11,119 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-09 12:40:11,119 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857393623]
[2020-10-09 12:40:11,119 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-09 12:40:11,120 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-09 12:40:11,120 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142904380]
[2020-10-09 12:40:11,120 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-09 12:40:11,120 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-09 12:40:11,120 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-09 12:40:11,121 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2020-10-09 12:40:11,121 INFO  L87              Difference]: Start difference. First operand 216 states and 539 transitions. Second operand 9 states.
[2020-10-09 12:40:11,406 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-09 12:40:11,406 INFO  L93              Difference]: Finished difference Result 254 states and 625 transitions.
[2020-10-09 12:40:11,407 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-09 12:40:11,407 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 27
[2020-10-09 12:40:11,407 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-09 12:40:11,408 INFO  L225             Difference]: With dead ends: 254
[2020-10-09 12:40:11,408 INFO  L226             Difference]: Without dead ends: 204
[2020-10-09 12:40:11,408 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2020-10-09 12:40:11,409 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2020-10-09 12:40:11,412 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 168.
[2020-10-09 12:40:11,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 168 states.
[2020-10-09 12:40:11,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 415 transitions.
[2020-10-09 12:40:11,413 INFO  L78                 Accepts]: Start accepts. Automaton has 168 states and 415 transitions. Word has length 27
[2020-10-09 12:40:11,413 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-09 12:40:11,413 INFO  L481      AbstractCegarLoop]: Abstraction has 168 states and 415 transitions.
[2020-10-09 12:40:11,413 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-09 12:40:11,413 INFO  L276                IsEmpty]: Start isEmpty. Operand 168 states and 415 transitions.
[2020-10-09 12:40:11,414 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-09 12:40:11,414 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-09 12:40:11,414 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, 1, 1, 1, 1]
[2020-10-09 12:40:11,414 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-09 12:40:11,414 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-09 12:40:11,415 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-09 12:40:11,415 INFO  L82        PathProgramCache]: Analyzing trace with hash -1540373759, now seen corresponding path program 4 times
[2020-10-09 12:40:11,415 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-09 12:40:11,415 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928642438]
[2020-10-09 12:40:11,415 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-09 12:40:11,456 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-09 12:40:11,457 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-09 12:40:11,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-09 12:40:11,505 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-09 12:40:11,542 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-09 12:40:11,542 INFO  L519         BasicCegarLoop]: Counterexample might be feasible
[2020-10-09 12:40:11,543 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-10-09 12:40:11,544 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-09 12:40:11,558 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1065] [1065] L2-->L851: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In-851188420 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-851188420 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-851188420 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-851188420 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (= ~y$r_buff0_thd0~0_In-851188420 ~y$r_buff0_thd0~0_Out-851188420) (or (and (= ~y$w_buff1_used~0_Out-851188420 ~y$w_buff1_used~0_In-851188420) .cse0) (and (= ~y$w_buff1_used~0_Out-851188420 0) .cse1 .cse2)) (= ~y$r_buff1_thd0~0_In-851188420 ~y$r_buff1_thd0~0_Out-851188420) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-851188420 0)) (or (and .cse3 (= ~y$w_buff0~0_In-851188420 ~y~0_Out-851188420) .cse4) (and .cse5 (or (and (= ~y$w_buff1~0_In-851188420 ~y~0_Out-851188420) .cse1 .cse2) (and .cse0 (= ~y~0_In-851188420 ~y~0_Out-851188420))))) (or (and (= ~y$w_buff0_used~0_Out-851188420 0) .cse3 .cse4) (and (= ~y$w_buff0_used~0_Out-851188420 ~y$w_buff0_used~0_In-851188420) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-851188420 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-851188420|))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-851188420|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-851188420, ~y$w_buff1~0=~y$w_buff1~0_In-851188420, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-851188420, ~y$w_buff0~0=~y$w_buff0~0_In-851188420, ~y~0=~y~0_In-851188420, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-851188420, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-851188420}  OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-851188420, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-851188420|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-851188420|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-851188420|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-851188420|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-851188420|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-851188420|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-851188420|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-851188420, ~y$w_buff1~0=~y$w_buff1~0_In-851188420, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-851188420, ~y$w_buff0~0=~y$w_buff0~0_In-851188420, ~y~0=~y~0_Out-851188420, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-851188420, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-851188420}  AuxVars[]  AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-09 12:40:11,564 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-09 12:40:11,564 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,566 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-09 12:40:11,566 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,566 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-09 12:40:11,566 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,567 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-09 12:40:11,567 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,567 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-09 12:40:11,567 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,567 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-09 12:40:11,567 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,567 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-09 12:40:11,568 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,569 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-09 12:40:11,569 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,569 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-09 12:40:11,569 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,569 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-09 12:40:11,570 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,570 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-09 12:40:11,570 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,570 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-09 12:40:11,570 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,570 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-09 12:40:11,571 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,571 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-09 12:40:11,571 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,571 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-09 12:40:11,571 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,572 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-09 12:40:11,572 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,572 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-09 12:40:11,572 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,572 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-09 12:40:11,572 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,573 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-09 12:40:11,573 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,574 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-09 12:40:11,574 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,574 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-09 12:40:11,574 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,574 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-09 12:40:11,574 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,575 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-09 12:40:11,575 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,575 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-09 12:40:11,575 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,575 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-09 12:40:11,575 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,576 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-09 12:40:11,576 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,576 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-09 12:40:11,576 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,576 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-09 12:40:11,576 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,577 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-09 12:40:11,577 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,577 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-09 12:40:11,577 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,577 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-09 12:40:11,577 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-09 12:40:11,678 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 12:40:11 BasicIcfg
[2020-10-09 12:40:11,678 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-09 12:40:11,680 INFO  L168              Benchmark]: Toolchain (without parser) took 20316.79 ms. Allocated memory was 253.8 MB in the beginning and 618.1 MB in the end (delta: 364.4 MB). Free memory was 208.7 MB in the beginning and 241.9 MB in the end (delta: -33.2 MB). Peak memory consumption was 331.2 MB. Max. memory is 14.2 GB.
[2020-10-09 12:40:11,681 INFO  L168              Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-09 12:40:11,683 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 806.87 ms. Allocated memory was 253.8 MB in the beginning and 322.4 MB in the end (delta: 68.7 MB). Free memory was 208.7 MB in the beginning and 268.1 MB in the end (delta: -59.5 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB.
[2020-10-09 12:40:11,684 INFO  L168              Benchmark]: Boogie Procedure Inliner took 73.61 ms. Allocated memory is still 322.4 MB. Free memory was 268.1 MB in the beginning and 265.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-09 12:40:11,684 INFO  L168              Benchmark]: Boogie Preprocessor took 42.44 ms. Allocated memory is still 322.4 MB. Free memory was 265.6 MB in the beginning and 263.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-09 12:40:11,685 INFO  L168              Benchmark]: RCFGBuilder took 2054.12 ms. Allocated memory was 322.4 MB in the beginning and 361.8 MB in the end (delta: 39.3 MB). Free memory was 263.1 MB in the beginning and 183.0 MB in the end (delta: 80.1 MB). Peak memory consumption was 119.4 MB. Max. memory is 14.2 GB.
[2020-10-09 12:40:11,686 INFO  L168              Benchmark]: TraceAbstraction took 17334.58 ms. Allocated memory was 361.8 MB in the beginning and 618.1 MB in the end (delta: 256.4 MB). Free memory was 179.8 MB in the beginning and 241.9 MB in the end (delta: -62.1 MB). Peak memory consumption was 194.3 MB. Max. memory is 14.2 GB.
[2020-10-09 12:40:11,697 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.24 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 806.87 ms. Allocated memory was 253.8 MB in the beginning and 322.4 MB in the end (delta: 68.7 MB). Free memory was 208.7 MB in the beginning and 268.1 MB in the end (delta: -59.5 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 73.61 ms. Allocated memory is still 322.4 MB. Free memory was 268.1 MB in the beginning and 265.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 42.44 ms. Allocated memory is still 322.4 MB. Free memory was 265.6 MB in the beginning and 263.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2054.12 ms. Allocated memory was 322.4 MB in the beginning and 361.8 MB in the end (delta: 39.3 MB). Free memory was 263.1 MB in the beginning and 183.0 MB in the end (delta: 80.1 MB). Peak memory consumption was 119.4 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 17334.58 ms. Allocated memory was 361.8 MB in the beginning and 618.1 MB in the end (delta: 256.4 MB). Free memory was 179.8 MB in the beginning and 241.9 MB in the end (delta: -62.1 MB). Peak memory consumption was 194.3 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1880 VarBasedMoverChecksPositive, 110 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 71 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 254 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.3s, 121 PlacesBefore, 46 PlacesAfterwards, 110 TransitionsBefore, 34 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 7693 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p3_EAX = 0;
[L703]               0  int __unbuffered_p3_EBX = 0;
[L705]               0  int a = 0;
[L706]               0  _Bool main$tmp_guard0;
[L707]               0  _Bool main$tmp_guard1;
[L709]               0  int x = 0;
[L711]               0  int y = 0;
[L712]               0  _Bool y$flush_delayed;
[L713]               0  int y$mem_tmp;
[L714]               0  _Bool y$r_buff0_thd0;
[L715]               0  _Bool y$r_buff0_thd1;
[L716]               0  _Bool y$r_buff0_thd2;
[L717]               0  _Bool y$r_buff0_thd3;
[L718]               0  _Bool y$r_buff0_thd4;
[L719]               0  _Bool y$r_buff1_thd0;
[L720]               0  _Bool y$r_buff1_thd1;
[L721]               0  _Bool y$r_buff1_thd2;
[L722]               0  _Bool y$r_buff1_thd3;
[L723]               0  _Bool y$r_buff1_thd4;
[L724]               0  _Bool y$read_delayed;
[L725]               0  int *y$read_delayed_var;
[L726]               0  int y$w_buff0;
[L727]               0  _Bool y$w_buff0_used;
[L728]               0  int y$w_buff1;
[L729]               0  _Bool y$w_buff1_used;
[L731]               0  int z = 0;
[L732]               0  _Bool weak$$choice0;
[L733]               0  _Bool weak$$choice2;
[L833]               0  pthread_t t813;
[L834]  FCALL, FORK  0  pthread_create(&t813, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L835]               0  pthread_t t814;
[L836]  FCALL, FORK  0  pthread_create(&t814, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L837]               0  pthread_t t815;
[L838]  FCALL, FORK  0  pthread_create(&t815, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L772]               3  y$w_buff1 = y$w_buff0
[L773]               3  y$w_buff0 = 2
[L774]               3  y$w_buff1_used = y$w_buff0_used
[L775]               3  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    3  !expression
[L7]                 3  __VERIFIER_error()
[L777]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L778]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L779]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L780]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L781]               3  y$r_buff1_thd4 = y$r_buff0_thd4
[L782]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L785]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L839]               0  pthread_t t816;
[L840]  FCALL, FORK  0  pthread_create(&t816, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L802]               4  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L805]               4  __unbuffered_p3_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L808]               4  __unbuffered_p3_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L811]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L811]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L811]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L811]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L812]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L812]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L813]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L813]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L814]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L814]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L815]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L815]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L818]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L820]               4  return 0;
[L737]               1  a = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L740]               1  x = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L752]               2  x = 2
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L755]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L758]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L758]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L758]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L758]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L759]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L759]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L760]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L760]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L761]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L761]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L762]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L762]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L788]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L788]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L789]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L789]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L790]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L790]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L791]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L791]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L792]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L795]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L797]               3  return 0;
[L765]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L767]               2  return 0;
[L745]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L747]               1  return 0;
[L842]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L853]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L854]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L855]               0  y$flush_delayed = weak$$choice2
[L856]               0  y$mem_tmp = y
[L857]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L857]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L858]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L858]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L858]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0
[L858]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L858]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L858]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L859]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L859]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L860]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L860]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L860]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L860]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L860]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L860]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L861]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L861]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L862]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L862]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L863]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L863]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864]               0  main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L865]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L865]               0  y = y$flush_delayed ? y$mem_tmp : y
[L866]               0  y$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 109 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.0s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 610 SDtfs, 839 SDslu, 1083 SDs, 0 SdLazy, 509 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 1207 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 68096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...