./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 30f4e4ab
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1d7062786d1cbe42a29d98cc634a5c85ac9a3f1
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE
--- Real Ultimate output ---
This is Ultimate 0.1.24-30f4e4a
[2019-11-27 22:35:33,169 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-11-27 22:35:33,172 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-11-27 22:35:33,189 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-11-27 22:35:33,190 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-11-27 22:35:33,192 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-11-27 22:35:33,194 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-11-27 22:35:33,204 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-11-27 22:35:33,209 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-11-27 22:35:33,212 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-11-27 22:35:33,213 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-11-27 22:35:33,215 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-11-27 22:35:33,216 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-11-27 22:35:33,218 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-11-27 22:35:33,219 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-11-27 22:35:33,221 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-11-27 22:35:33,222 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-11-27 22:35:33,223 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-11-27 22:35:33,226 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-11-27 22:35:33,230 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-11-27 22:35:33,234 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-11-27 22:35:33,238 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-11-27 22:35:33,239 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-11-27 22:35:33,241 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-11-27 22:35:33,244 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-11-27 22:35:33,245 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-11-27 22:35:33,245 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-11-27 22:35:33,247 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-11-27 22:35:33,248 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-11-27 22:35:33,249 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-11-27 22:35:33,249 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-11-27 22:35:33,250 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-11-27 22:35:33,251 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-11-27 22:35:33,253 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-11-27 22:35:33,254 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-11-27 22:35:33,254 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-11-27 22:35:33,255 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-11-27 22:35:33,256 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-11-27 22:35:33,256 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-11-27 22:35:33,257 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-11-27 22:35:33,258 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-11-27 22:35:33,259 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2019-11-27 22:35:33,289 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-11-27 22:35:33,297 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-11-27 22:35:33,298 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-11-27 22:35:33,300 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-11-27 22:35:33,300 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-11-27 22:35:33,300 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-11-27 22:35:33,302 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-11-27 22:35:33,302 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-11-27 22:35:33,302 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-11-27 22:35:33,302 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-11-27 22:35:33,303 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-11-27 22:35:33,304 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-11-27 22:35:33,305 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-11-27 22:35:33,305 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-11-27 22:35:33,305 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-11-27 22:35:33,305 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-11-27 22:35:33,306 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-11-27 22:35:33,306 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-11-27 22:35:33,307 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-11-27 22:35:33,307 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-11-27 22:35:33,307 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-11-27 22:35:33,307 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-27 22:35:33,308 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-11-27 22:35:33,308 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-11-27 22:35:33,309 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-11-27 22:35:33,309 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-11-27 22:35:33,309 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-11-27 22:35:33,309 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-11-27 22:35:33,310 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1d7062786d1cbe42a29d98cc634a5c85ac9a3f1
[2019-11-27 22:35:33,633 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-11-27 22:35:33,646 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-11-27 22:35:33,649 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-11-27 22:35:33,650 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-11-27 22:35:33,651 INFO  L275        PluginConnector]: CDTParser initialized
[2019-11-27 22:35:33,651 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c
[2019-11-27 22:35:33,715 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bae7f27ea/19ad83a9d4d94089a71eb4f68d39f53a/FLAGe7a5ea097
[2019-11-27 22:35:34,189 INFO  L306              CDTParser]: Found 1 translation units.
[2019-11-27 22:35:34,190 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c
[2019-11-27 22:35:34,201 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bae7f27ea/19ad83a9d4d94089a71eb4f68d39f53a/FLAGe7a5ea097
[2019-11-27 22:35:34,548 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bae7f27ea/19ad83a9d4d94089a71eb4f68d39f53a
[2019-11-27 22:35:34,551 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-11-27 22:35:34,552 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2019-11-27 22:35:34,553 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-11-27 22:35:34,554 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-11-27 22:35:34,557 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-11-27 22:35:34,558 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:34" (1/1) ...
[2019-11-27 22:35:34,560 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b50e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:34, skipping insertion in model container
[2019-11-27 22:35:34,561 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:34" (1/1) ...
[2019-11-27 22:35:34,568 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2019-11-27 22:35:34,620 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2019-11-27 22:35:34,979 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-11-27 22:35:34,994 INFO  L203         MainTranslator]: Completed pre-run
[2019-11-27 22:35:35,052 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-11-27 22:35:35,066 INFO  L208         MainTranslator]: Completed translation
[2019-11-27 22:35:35,066 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35 WrapperNode
[2019-11-27 22:35:35,067 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-11-27 22:35:35,067 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-11-27 22:35:35,067 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-11-27 22:35:35,068 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2019-11-27 22:35:35,078 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ...
[2019-11-27 22:35:35,098 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ...
[2019-11-27 22:35:35,135 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-11-27 22:35:35,136 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-11-27 22:35:35,136 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-11-27 22:35:35,136 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-11-27 22:35:35,144 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ...
[2019-11-27 22:35:35,144 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ...
[2019-11-27 22:35:35,147 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ...
[2019-11-27 22:35:35,147 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ...
[2019-11-27 22:35:35,156 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ...
[2019-11-27 22:35:35,164 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ...
[2019-11-27 22:35:35,167 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ...
[2019-11-27 22:35:35,171 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-11-27 22:35:35,172 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-11-27 22:35:35,172 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-11-27 22:35:35,172 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-11-27 22:35:35,173 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (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
[2019-11-27 22:35:35,249 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-11-27 22:35:35,249 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-11-27 22:35:35,379 WARN  L759   $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2019-11-27 22:35:35,962 INFO  L712   $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false;
[2019-11-27 22:35:35,963 INFO  L712   $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false;
[2019-11-27 22:35:35,969 INFO  L292             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-11-27 22:35:35,970 INFO  L297             CfgBuilder]: Removed 7 assume(true) statements.
[2019-11-27 22:35:35,971 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:35 BoogieIcfgContainer
[2019-11-27 22:35:35,971 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-11-27 22:35:35,974 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-11-27 22:35:35,977 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-11-27 22:35:35,980 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-11-27 22:35:35,980 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:34" (1/3) ...
[2019-11-27 22:35:35,982 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a22b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:35, skipping insertion in model container
[2019-11-27 22:35:35,982 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (2/3) ...
[2019-11-27 22:35:35,983 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a22b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:35, skipping insertion in model container
[2019-11-27 22:35:35,983 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:35" (3/3) ...
[2019-11-27 22:35:35,985 INFO  L109   eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c
[2019-11-27 22:35:35,995 INFO  L156   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-11-27 22:35:36,005 INFO  L168   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-11-27 22:35:36,018 INFO  L249      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-11-27 22:35:36,055 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2019-11-27 22:35:36,055 INFO  L374      AbstractCegarLoop]: Hoare is true
[2019-11-27 22:35:36,055 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-11-27 22:35:36,056 INFO  L376      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-11-27 22:35:36,057 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-11-27 22:35:36,057 INFO  L378      AbstractCegarLoop]: Difference is false
[2019-11-27 22:35:36,057 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-11-27 22:35:36,057 INFO  L383      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-11-27 22:35:36,077 INFO  L276                IsEmpty]: Start isEmpty. Operand 127 states.
[2019-11-27 22:35:36,084 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2019-11-27 22:35:36,085 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:36,086 INFO  L410         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]
[2019-11-27 22:35:36,086 INFO  L410      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:36,091 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:36,092 INFO  L82        PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times
[2019-11-27 22:35:36,099 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:36,099 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100624587]
[2019-11-27 22:35:36,100 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:36,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:36,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-27 22:35:36,292 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100624587]
[2019-11-27 22:35:36,293 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:36,293 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-27 22:35:36,295 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833349112]
[2019-11-27 22:35:36,303 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:36,303 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:36,319 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:36,321 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:36,323 INFO  L87              Difference]: Start difference. First operand 127 states. Second operand 3 states.
[2019-11-27 22:35:36,551 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:36,552 INFO  L93              Difference]: Finished difference Result 251 states and 426 transitions.
[2019-11-27 22:35:36,552 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:36,554 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2019-11-27 22:35:36,555 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:36,567 INFO  L225             Difference]: With dead ends: 251
[2019-11-27 22:35:36,567 INFO  L226             Difference]: Without dead ends: 114
[2019-11-27 22:35:36,571 INFO  L630         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
[2019-11-27 22:35:36,587 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2019-11-27 22:35:36,610 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114.
[2019-11-27 22:35:36,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2019-11-27 22:35:36,614 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions.
[2019-11-27 22:35:36,615 INFO  L78                 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23
[2019-11-27 22:35:36,616 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:36,616 INFO  L462      AbstractCegarLoop]: Abstraction has 114 states and 171 transitions.
[2019-11-27 22:35:36,616 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:36,616 INFO  L276                IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions.
[2019-11-27 22:35:36,618 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2019-11-27 22:35:36,618 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:36,619 INFO  L410         BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1]
[2019-11-27 22:35:36,619 INFO  L410      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:36,619 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:36,620 INFO  L82        PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times
[2019-11-27 22:35:36,620 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:36,620 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498521659]
[2019-11-27 22:35:36,621 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:36,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:36,753 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-27 22:35:36,754 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498521659]
[2019-11-27 22:35:36,754 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:36,755 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:36,755 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737304462]
[2019-11-27 22:35:36,757 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:36,757 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:36,757 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:36,758 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:36,758 INFO  L87              Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states.
[2019-11-27 22:35:36,935 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:36,935 INFO  L93              Difference]: Finished difference Result 237 states and 359 transitions.
[2019-11-27 22:35:36,936 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:36,936 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 36
[2019-11-27 22:35:36,936 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:36,939 INFO  L225             Difference]: With dead ends: 237
[2019-11-27 22:35:36,939 INFO  L226             Difference]: Without dead ends: 132
[2019-11-27 22:35:36,941 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:36,942 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2019-11-27 22:35:36,962 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129.
[2019-11-27 22:35:36,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2019-11-27 22:35:36,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions.
[2019-11-27 22:35:36,969 INFO  L78                 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36
[2019-11-27 22:35:36,970 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:36,970 INFO  L462      AbstractCegarLoop]: Abstraction has 129 states and 191 transitions.
[2019-11-27 22:35:36,970 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:36,970 INFO  L276                IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions.
[2019-11-27 22:35:36,972 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2019-11-27 22:35:36,973 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:36,973 INFO  L410         BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1]
[2019-11-27 22:35:36,973 INFO  L410      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:36,974 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:36,976 INFO  L82        PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times
[2019-11-27 22:35:36,976 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:36,977 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610741893]
[2019-11-27 22:35:36,977 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:37,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:37,051 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2019-11-27 22:35:37,052 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610741893]
[2019-11-27 22:35:37,052 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:37,052 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:37,054 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674144844]
[2019-11-27 22:35:37,055 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:37,055 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:37,056 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:37,056 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:37,056 INFO  L87              Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states.
[2019-11-27 22:35:37,222 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:37,222 INFO  L93              Difference]: Finished difference Result 271 states and 407 transitions.
[2019-11-27 22:35:37,224 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:37,224 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 50
[2019-11-27 22:35:37,225 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:37,226 INFO  L225             Difference]: With dead ends: 271
[2019-11-27 22:35:37,226 INFO  L226             Difference]: Without dead ends: 151
[2019-11-27 22:35:37,230 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:37,232 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2019-11-27 22:35:37,253 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146.
[2019-11-27 22:35:37,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 146 states.
[2019-11-27 22:35:37,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions.
[2019-11-27 22:35:37,257 INFO  L78                 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50
[2019-11-27 22:35:37,258 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:37,259 INFO  L462      AbstractCegarLoop]: Abstraction has 146 states and 213 transitions.
[2019-11-27 22:35:37,259 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:37,259 INFO  L276                IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions.
[2019-11-27 22:35:37,261 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2019-11-27 22:35:37,265 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:37,265 INFO  L410         BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:37,266 INFO  L410      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:37,266 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:37,266 INFO  L82        PathProgramCache]: Analyzing trace with hash -1174891697, now seen corresponding path program 1 times
[2019-11-27 22:35:37,267 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:37,267 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093434651]
[2019-11-27 22:35:37,267 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:37,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:37,394 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2019-11-27 22:35:37,395 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093434651]
[2019-11-27 22:35:37,396 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:37,396 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:37,396 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825502508]
[2019-11-27 22:35:37,397 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:37,397 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:37,398 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:37,398 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:37,398 INFO  L87              Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states.
[2019-11-27 22:35:37,603 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:37,604 INFO  L93              Difference]: Finished difference Result 334 states and 502 transitions.
[2019-11-27 22:35:37,605 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:37,605 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 67
[2019-11-27 22:35:37,606 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:37,608 INFO  L225             Difference]: With dead ends: 334
[2019-11-27 22:35:37,608 INFO  L226             Difference]: Without dead ends: 196
[2019-11-27 22:35:37,609 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:37,610 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2019-11-27 22:35:37,620 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187.
[2019-11-27 22:35:37,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 187 states.
[2019-11-27 22:35:37,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions.
[2019-11-27 22:35:37,622 INFO  L78                 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67
[2019-11-27 22:35:37,622 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:37,622 INFO  L462      AbstractCegarLoop]: Abstraction has 187 states and 263 transitions.
[2019-11-27 22:35:37,623 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:37,623 INFO  L276                IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions.
[2019-11-27 22:35:37,624 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2019-11-27 22:35:37,624 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:37,625 INFO  L410         BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:37,625 INFO  L410      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:37,625 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:37,626 INFO  L82        PathProgramCache]: Analyzing trace with hash 1314637265, now seen corresponding path program 1 times
[2019-11-27 22:35:37,626 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:37,627 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897092804]
[2019-11-27 22:35:37,627 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:37,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:37,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2019-11-27 22:35:37,697 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897092804]
[2019-11-27 22:35:37,698 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:37,698 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:37,698 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213498148]
[2019-11-27 22:35:37,699 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:37,699 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:37,699 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:37,700 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:37,700 INFO  L87              Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states.
[2019-11-27 22:35:37,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:37,834 INFO  L93              Difference]: Finished difference Result 389 states and 554 transitions.
[2019-11-27 22:35:37,835 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:37,835 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 67
[2019-11-27 22:35:37,835 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:37,837 INFO  L225             Difference]: With dead ends: 389
[2019-11-27 22:35:37,837 INFO  L226             Difference]: Without dead ends: 211
[2019-11-27 22:35:37,838 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:37,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2019-11-27 22:35:37,847 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206.
[2019-11-27 22:35:37,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 206 states.
[2019-11-27 22:35:37,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions.
[2019-11-27 22:35:37,849 INFO  L78                 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67
[2019-11-27 22:35:37,850 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:37,850 INFO  L462      AbstractCegarLoop]: Abstraction has 206 states and 287 transitions.
[2019-11-27 22:35:37,850 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:37,850 INFO  L276                IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions.
[2019-11-27 22:35:37,852 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2019-11-27 22:35:37,852 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:37,852 INFO  L410         BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:37,853 INFO  L410      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:37,853 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:37,853 INFO  L82        PathProgramCache]: Analyzing trace with hash -1231866158, now seen corresponding path program 1 times
[2019-11-27 22:35:37,853 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:37,854 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360492414]
[2019-11-27 22:35:37,854 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:37,872 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:37,911 INFO  L134       CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2019-11-27 22:35:37,911 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360492414]
[2019-11-27 22:35:37,912 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:37,912 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:37,913 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082749343]
[2019-11-27 22:35:37,914 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:37,914 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:37,915 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:37,915 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:37,915 INFO  L87              Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states.
[2019-11-27 22:35:38,046 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:38,046 INFO  L93              Difference]: Finished difference Result 427 states and 603 transitions.
[2019-11-27 22:35:38,047 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:38,047 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 84
[2019-11-27 22:35:38,048 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:38,049 INFO  L225             Difference]: With dead ends: 427
[2019-11-27 22:35:38,050 INFO  L226             Difference]: Without dead ends: 230
[2019-11-27 22:35:38,050 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:38,051 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 230 states.
[2019-11-27 22:35:38,058 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227.
[2019-11-27 22:35:38,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 227 states.
[2019-11-27 22:35:38,060 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions.
[2019-11-27 22:35:38,060 INFO  L78                 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84
[2019-11-27 22:35:38,061 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:38,061 INFO  L462      AbstractCegarLoop]: Abstraction has 227 states and 313 transitions.
[2019-11-27 22:35:38,061 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:38,062 INFO  L276                IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions.
[2019-11-27 22:35:38,063 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2019-11-27 22:35:38,064 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:38,064 INFO  L410         BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:38,064 INFO  L410      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:38,065 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:38,065 INFO  L82        PathProgramCache]: Analyzing trace with hash 266431114, now seen corresponding path program 1 times
[2019-11-27 22:35:38,065 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:38,066 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582390170]
[2019-11-27 22:35:38,066 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:38,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:38,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2019-11-27 22:35:38,134 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582390170]
[2019-11-27 22:35:38,134 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:38,135 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:38,135 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797912738]
[2019-11-27 22:35:38,136 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:38,136 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:38,136 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:38,137 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:38,137 INFO  L87              Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states.
[2019-11-27 22:35:38,190 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:38,191 INFO  L93              Difference]: Finished difference Result 661 states and 912 transitions.
[2019-11-27 22:35:38,191 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:38,191 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 104
[2019-11-27 22:35:38,193 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:38,196 INFO  L225             Difference]: With dead ends: 661
[2019-11-27 22:35:38,196 INFO  L226             Difference]: Without dead ends: 443
[2019-11-27 22:35:38,197 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:38,198 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 443 states.
[2019-11-27 22:35:38,212 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443.
[2019-11-27 22:35:38,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 443 states.
[2019-11-27 22:35:38,214 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions.
[2019-11-27 22:35:38,236 INFO  L78                 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104
[2019-11-27 22:35:38,237 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:38,237 INFO  L462      AbstractCegarLoop]: Abstraction has 443 states and 609 transitions.
[2019-11-27 22:35:38,237 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:38,237 INFO  L276                IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions.
[2019-11-27 22:35:38,240 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2019-11-27 22:35:38,240 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:38,240 INFO  L410         BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:38,241 INFO  L410      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:38,241 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:38,242 INFO  L82        PathProgramCache]: Analyzing trace with hash -1706663820, now seen corresponding path program 1 times
[2019-11-27 22:35:38,242 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:38,243 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209681788]
[2019-11-27 22:35:38,243 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:38,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:38,325 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked.
[2019-11-27 22:35:38,326 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209681788]
[2019-11-27 22:35:38,326 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:38,326 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:38,327 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870702464]
[2019-11-27 22:35:38,328 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:38,328 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:38,329 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:38,329 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:38,330 INFO  L87              Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states.
[2019-11-27 22:35:38,367 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:38,367 INFO  L93              Difference]: Finished difference Result 661 states and 909 transitions.
[2019-11-27 22:35:38,368 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:38,368 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 106
[2019-11-27 22:35:38,368 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:38,373 INFO  L225             Difference]: With dead ends: 661
[2019-11-27 22:35:38,373 INFO  L226             Difference]: Without dead ends: 659
[2019-11-27 22:35:38,374 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:38,375 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 659 states.
[2019-11-27 22:35:38,389 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659.
[2019-11-27 22:35:38,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 659 states.
[2019-11-27 22:35:38,392 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions.
[2019-11-27 22:35:38,393 INFO  L78                 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106
[2019-11-27 22:35:38,394 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:38,394 INFO  L462      AbstractCegarLoop]: Abstraction has 659 states and 907 transitions.
[2019-11-27 22:35:38,394 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:38,395 INFO  L276                IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions.
[2019-11-27 22:35:38,397 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2019-11-27 22:35:38,397 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:38,397 INFO  L410         BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:38,398 INFO  L410      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:38,398 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:38,398 INFO  L82        PathProgramCache]: Analyzing trace with hash 589479754, now seen corresponding path program 1 times
[2019-11-27 22:35:38,399 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:38,399 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893151279]
[2019-11-27 22:35:38,399 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:38,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:38,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 384 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2019-11-27 22:35:38,480 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893151279]
[2019-11-27 22:35:38,481 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:38,481 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:38,485 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701026644]
[2019-11-27 22:35:38,486 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:38,486 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:38,486 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:38,487 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:38,487 INFO  L87              Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states.
[2019-11-27 22:35:38,652 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:38,653 INFO  L93              Difference]: Finished difference Result 1462 states and 2068 transitions.
[2019-11-27 22:35:38,653 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:38,653 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 161
[2019-11-27 22:35:38,654 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:38,658 INFO  L225             Difference]: With dead ends: 1462
[2019-11-27 22:35:38,659 INFO  L226             Difference]: Without dead ends: 809
[2019-11-27 22:35:38,660 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:38,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 809 states.
[2019-11-27 22:35:38,680 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776.
[2019-11-27 22:35:38,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 776 states.
[2019-11-27 22:35:38,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions.
[2019-11-27 22:35:38,683 INFO  L78                 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 161
[2019-11-27 22:35:38,684 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:38,684 INFO  L462      AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions.
[2019-11-27 22:35:38,684 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:38,684 INFO  L276                IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions.
[2019-11-27 22:35:38,687 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 189
[2019-11-27 22:35:38,687 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:38,688 INFO  L410         BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:38,688 INFO  L410      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:38,688 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:38,688 INFO  L82        PathProgramCache]: Analyzing trace with hash 1596288335, now seen corresponding path program 1 times
[2019-11-27 22:35:38,689 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:38,689 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573048045]
[2019-11-27 22:35:38,689 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:38,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:38,748 INFO  L134       CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2019-11-27 22:35:38,749 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573048045]
[2019-11-27 22:35:38,749 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:38,750 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:38,750 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651613561]
[2019-11-27 22:35:38,750 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:38,751 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:38,751 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:38,751 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:38,751 INFO  L87              Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states.
[2019-11-27 22:35:38,935 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:38,935 INFO  L93              Difference]: Finished difference Result 1824 states and 2649 transitions.
[2019-11-27 22:35:38,936 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:38,936 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 188
[2019-11-27 22:35:38,936 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:38,941 INFO  L225             Difference]: With dead ends: 1824
[2019-11-27 22:35:38,941 INFO  L226             Difference]: Without dead ends: 1006
[2019-11-27 22:35:38,943 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:38,944 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1006 states.
[2019-11-27 22:35:38,967 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965.
[2019-11-27 22:35:38,968 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 965 states.
[2019-11-27 22:35:38,971 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions.
[2019-11-27 22:35:38,972 INFO  L78                 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188
[2019-11-27 22:35:38,972 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:38,972 INFO  L462      AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions.
[2019-11-27 22:35:38,973 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:38,973 INFO  L276                IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions.
[2019-11-27 22:35:38,978 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2019-11-27 22:35:38,978 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:38,979 INFO  L410         BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:38,979 INFO  L410      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:38,979 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:38,979 INFO  L82        PathProgramCache]: Analyzing trace with hash -1275827432, now seen corresponding path program 1 times
[2019-11-27 22:35:38,980 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:38,980 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452947888]
[2019-11-27 22:35:38,980 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:39,002 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:39,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked.
[2019-11-27 22:35:39,058 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452947888]
[2019-11-27 22:35:39,058 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:39,059 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:39,059 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574980852]
[2019-11-27 22:35:39,060 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:39,060 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:39,062 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:39,062 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:39,062 INFO  L87              Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states.
[2019-11-27 22:35:39,232 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:39,232 INFO  L93              Difference]: Finished difference Result 2080 states and 2926 transitions.
[2019-11-27 22:35:39,232 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:39,233 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 209
[2019-11-27 22:35:39,233 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:39,239 INFO  L225             Difference]: With dead ends: 2080
[2019-11-27 22:35:39,239 INFO  L226             Difference]: Without dead ends: 1079
[2019-11-27 22:35:39,241 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:39,242 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1079 states.
[2019-11-27 22:35:39,271 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040.
[2019-11-27 22:35:39,272 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1040 states.
[2019-11-27 22:35:39,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions.
[2019-11-27 22:35:39,277 INFO  L78                 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209
[2019-11-27 22:35:39,278 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:39,278 INFO  L462      AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions.
[2019-11-27 22:35:39,278 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:39,279 INFO  L276                IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions.
[2019-11-27 22:35:39,283 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2019-11-27 22:35:39,283 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:39,284 INFO  L410         BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2019-11-27 22:35:39,284 INFO  L410      AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:39,284 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:39,285 INFO  L82        PathProgramCache]: Analyzing trace with hash 1859847365, now seen corresponding path program 1 times
[2019-11-27 22:35:39,285 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:39,286 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528269019]
[2019-11-27 22:35:39,287 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:39,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:39,424 INFO  L134       CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked.
[2019-11-27 22:35:39,425 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528269019]
[2019-11-27 22:35:39,425 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:39,425 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:39,426 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280890862]
[2019-11-27 22:35:39,426 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:39,427 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:39,427 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:39,428 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:39,428 INFO  L87              Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states.
[2019-11-27 22:35:39,605 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:39,606 INFO  L93              Difference]: Finished difference Result 2230 states and 3115 transitions.
[2019-11-27 22:35:39,606 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:39,606 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 233
[2019-11-27 22:35:39,607 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:39,613 INFO  L225             Difference]: With dead ends: 2230
[2019-11-27 22:35:39,613 INFO  L226             Difference]: Without dead ends: 1160
[2019-11-27 22:35:39,615 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:39,617 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1160 states.
[2019-11-27 22:35:39,640 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124.
[2019-11-27 22:35:39,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1124 states.
[2019-11-27 22:35:39,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions.
[2019-11-27 22:35:39,644 INFO  L78                 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233
[2019-11-27 22:35:39,645 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:39,645 INFO  L462      AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions.
[2019-11-27 22:35:39,645 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:39,645 INFO  L276                IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions.
[2019-11-27 22:35:39,649 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2019-11-27 22:35:39,649 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:39,650 INFO  L410         BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2019-11-27 22:35:39,650 INFO  L410      AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:39,650 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:39,651 INFO  L82        PathProgramCache]: Analyzing trace with hash 1978288839, now seen corresponding path program 1 times
[2019-11-27 22:35:39,651 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:39,651 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456298788]
[2019-11-27 22:35:39,651 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:39,673 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:39,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked.
[2019-11-27 22:35:39,735 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456298788]
[2019-11-27 22:35:39,735 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:39,735 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:39,735 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693707751]
[2019-11-27 22:35:39,736 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:39,736 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:39,737 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:39,737 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:39,737 INFO  L87              Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states.
[2019-11-27 22:35:39,929 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:39,930 INFO  L93              Difference]: Finished difference Result 2398 states and 3340 transitions.
[2019-11-27 22:35:39,930 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:39,930 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 233
[2019-11-27 22:35:39,931 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:39,937 INFO  L225             Difference]: With dead ends: 2398
[2019-11-27 22:35:39,937 INFO  L226             Difference]: Without dead ends: 1256
[2019-11-27 22:35:39,941 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:39,943 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1256 states.
[2019-11-27 22:35:39,984 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217.
[2019-11-27 22:35:39,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1217 states.
[2019-11-27 22:35:39,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions.
[2019-11-27 22:35:39,991 INFO  L78                 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233
[2019-11-27 22:35:39,992 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:39,992 INFO  L462      AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions.
[2019-11-27 22:35:39,993 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:39,993 INFO  L276                IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions.
[2019-11-27 22:35:40,002 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 264
[2019-11-27 22:35:40,002 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:40,003 INFO  L410         BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:40,003 INFO  L410      AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:40,004 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:40,005 INFO  L82        PathProgramCache]: Analyzing trace with hash 1116608197, now seen corresponding path program 1 times
[2019-11-27 22:35:40,005 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:40,012 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378510933]
[2019-11-27 22:35:40,012 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:40,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:40,174 INFO  L134       CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked.
[2019-11-27 22:35:40,176 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378510933]
[2019-11-27 22:35:40,176 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:40,177 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:40,177 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304589063]
[2019-11-27 22:35:40,178 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:40,178 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:40,179 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:40,179 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:40,179 INFO  L87              Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states.
[2019-11-27 22:35:40,235 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:40,236 INFO  L93              Difference]: Finished difference Result 3630 states and 5032 transitions.
[2019-11-27 22:35:40,237 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:40,237 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 263
[2019-11-27 22:35:40,238 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:40,251 INFO  L225             Difference]: With dead ends: 3630
[2019-11-27 22:35:40,252 INFO  L226             Difference]: Without dead ends: 2422
[2019-11-27 22:35:40,256 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:40,261 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2422 states.
[2019-11-27 22:35:40,337 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420.
[2019-11-27 22:35:40,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2420 states.
[2019-11-27 22:35:40,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions.
[2019-11-27 22:35:40,348 INFO  L78                 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263
[2019-11-27 22:35:40,348 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:40,348 INFO  L462      AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions.
[2019-11-27 22:35:40,349 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:40,349 INFO  L276                IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions.
[2019-11-27 22:35:40,359 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 264
[2019-11-27 22:35:40,360 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:40,360 INFO  L410         BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:40,361 INFO  L410      AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:40,361 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:40,362 INFO  L82        PathProgramCache]: Analyzing trace with hash 1235049671, now seen corresponding path program 1 times
[2019-11-27 22:35:40,362 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:40,362 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660373804]
[2019-11-27 22:35:40,363 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:40,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:40,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked.
[2019-11-27 22:35:40,499 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660373804]
[2019-11-27 22:35:40,499 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:40,499 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:40,500 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157103928]
[2019-11-27 22:35:40,500 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:40,501 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:40,501 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:40,501 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:40,501 INFO  L87              Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states.
[2019-11-27 22:35:40,691 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:40,691 INFO  L93              Difference]: Finished difference Result 5143 states and 7169 transitions.
[2019-11-27 22:35:40,692 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:40,692 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 263
[2019-11-27 22:35:40,693 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:40,706 INFO  L225             Difference]: With dead ends: 5143
[2019-11-27 22:35:40,706 INFO  L226             Difference]: Without dead ends: 2702
[2019-11-27 22:35:40,712 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:40,715 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2702 states.
[2019-11-27 22:35:40,782 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630.
[2019-11-27 22:35:40,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2630 states.
[2019-11-27 22:35:40,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions.
[2019-11-27 22:35:40,792 INFO  L78                 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263
[2019-11-27 22:35:40,792 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:40,793 INFO  L462      AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions.
[2019-11-27 22:35:40,793 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:40,793 INFO  L276                IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions.
[2019-11-27 22:35:40,801 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 299
[2019-11-27 22:35:40,801 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:40,801 INFO  L410         BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:40,802 INFO  L410      AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:40,802 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:40,802 INFO  L82        PathProgramCache]: Analyzing trace with hash 2135776069, now seen corresponding path program 1 times
[2019-11-27 22:35:40,803 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:40,803 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228984189]
[2019-11-27 22:35:40,803 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:40,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:40,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked.
[2019-11-27 22:35:40,941 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228984189]
[2019-11-27 22:35:40,942 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:40,942 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:40,942 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119483524]
[2019-11-27 22:35:40,943 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:40,943 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:40,943 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:40,944 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:40,944 INFO  L87              Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states.
[2019-11-27 22:35:41,154 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:41,155 INFO  L93              Difference]: Finished difference Result 5335 states and 7421 transitions.
[2019-11-27 22:35:41,156 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:41,156 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 298
[2019-11-27 22:35:41,157 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:41,172 INFO  L225             Difference]: With dead ends: 5335
[2019-11-27 22:35:41,173 INFO  L226             Difference]: Without dead ends: 2696
[2019-11-27 22:35:41,178 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:41,182 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2696 states.
[2019-11-27 22:35:41,266 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624.
[2019-11-27 22:35:41,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2624 states.
[2019-11-27 22:35:41,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions.
[2019-11-27 22:35:41,275 INFO  L78                 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298
[2019-11-27 22:35:41,276 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:41,276 INFO  L462      AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions.
[2019-11-27 22:35:41,277 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:41,277 INFO  L276                IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions.
[2019-11-27 22:35:41,290 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 308
[2019-11-27 22:35:41,290 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:41,290 INFO  L410         BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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]
[2019-11-27 22:35:41,291 INFO  L410      AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:41,291 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:41,291 INFO  L82        PathProgramCache]: Analyzing trace with hash -901475869, now seen corresponding path program 1 times
[2019-11-27 22:35:41,292 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:41,292 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538307405]
[2019-11-27 22:35:41,292 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:41,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:41,410 INFO  L134       CoverageAnalysis]: Checked inductivity of 1175 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked.
[2019-11-27 22:35:41,410 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538307405]
[2019-11-27 22:35:41,411 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:41,411 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:41,411 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867967243]
[2019-11-27 22:35:41,412 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:41,412 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:41,412 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:41,412 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:41,413 INFO  L87              Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states.
[2019-11-27 22:35:41,573 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:41,574 INFO  L93              Difference]: Finished difference Result 5299 states and 7319 transitions.
[2019-11-27 22:35:41,574 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:41,574 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 307
[2019-11-27 22:35:41,575 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:41,587 INFO  L225             Difference]: With dead ends: 5299
[2019-11-27 22:35:41,587 INFO  L226             Difference]: Without dead ends: 2684
[2019-11-27 22:35:41,592 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:41,595 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2684 states.
[2019-11-27 22:35:41,655 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624.
[2019-11-27 22:35:41,655 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2624 states.
[2019-11-27 22:35:41,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions.
[2019-11-27 22:35:41,662 INFO  L78                 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 307
[2019-11-27 22:35:41,662 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:41,663 INFO  L462      AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions.
[2019-11-27 22:35:41,663 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:41,663 INFO  L276                IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions.
[2019-11-27 22:35:41,670 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 336
[2019-11-27 22:35:41,671 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:41,671 INFO  L410         BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:41,671 INFO  L410      AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:41,672 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:41,672 INFO  L82        PathProgramCache]: Analyzing trace with hash 503398906, now seen corresponding path program 1 times
[2019-11-27 22:35:41,672 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:41,673 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149286654]
[2019-11-27 22:35:41,673 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:41,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:41,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked.
[2019-11-27 22:35:41,806 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149286654]
[2019-11-27 22:35:41,806 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:41,806 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:41,806 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16527284]
[2019-11-27 22:35:41,807 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:41,807 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:41,808 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:41,808 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:41,808 INFO  L87              Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states.
[2019-11-27 22:35:41,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:41,984 INFO  L93              Difference]: Finished difference Result 5545 states and 7499 transitions.
[2019-11-27 22:35:41,984 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:41,984 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 335
[2019-11-27 22:35:41,985 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:41,998 INFO  L225             Difference]: With dead ends: 5545
[2019-11-27 22:35:41,998 INFO  L226             Difference]: Without dead ends: 2930
[2019-11-27 22:35:42,002 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:42,006 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2930 states.
[2019-11-27 22:35:42,070 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714.
[2019-11-27 22:35:42,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2714 states.
[2019-11-27 22:35:42,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions.
[2019-11-27 22:35:42,080 INFO  L78                 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335
[2019-11-27 22:35:42,080 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:42,081 INFO  L462      AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions.
[2019-11-27 22:35:42,081 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:42,081 INFO  L276                IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions.
[2019-11-27 22:35:42,096 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 337
[2019-11-27 22:35:42,096 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:42,097 INFO  L410         BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:42,097 INFO  L410      AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:42,098 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:42,098 INFO  L82        PathProgramCache]: Analyzing trace with hash -121520003, now seen corresponding path program 1 times
[2019-11-27 22:35:42,101 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:42,101 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615834921]
[2019-11-27 22:35:42,101 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:42,135 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:42,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked.
[2019-11-27 22:35:42,402 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615834921]
[2019-11-27 22:35:42,403 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:42,403 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:42,404 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064132398]
[2019-11-27 22:35:42,405 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:42,406 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:42,406 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:42,407 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:42,407 INFO  L87              Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states.
[2019-11-27 22:35:42,523 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:42,523 INFO  L93              Difference]: Finished difference Result 7734 states and 10582 transitions.
[2019-11-27 22:35:42,524 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:42,524 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 336
[2019-11-27 22:35:42,525 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:42,578 INFO  L225             Difference]: With dead ends: 7734
[2019-11-27 22:35:42,586 INFO  L226             Difference]: Without dead ends: 5029
[2019-11-27 22:35:42,594 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:42,603 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5029 states.
[2019-11-27 22:35:42,766 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027.
[2019-11-27 22:35:42,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5027 states.
[2019-11-27 22:35:42,779 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions.
[2019-11-27 22:35:42,780 INFO  L78                 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336
[2019-11-27 22:35:42,780 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:42,781 INFO  L462      AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions.
[2019-11-27 22:35:42,781 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:42,781 INFO  L276                IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions.
[2019-11-27 22:35:42,798 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 347
[2019-11-27 22:35:42,798 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:42,799 INFO  L410         BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:42,799 INFO  L410      AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:42,800 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:42,801 INFO  L82        PathProgramCache]: Analyzing trace with hash -1651416633, now seen corresponding path program 1 times
[2019-11-27 22:35:42,801 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:42,801 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20134058]
[2019-11-27 22:35:42,802 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:42,834 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:43,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked.
[2019-11-27 22:35:43,028 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20134058]
[2019-11-27 22:35:43,028 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519585866]
[2019-11-27 22:35:43,029 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-27 22:35:43,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:43,252 INFO  L255         TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-27 22:35:43,297 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2019-11-27 22:35:43,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked.
[2019-11-27 22:35:43,668 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-11-27 22:35:43,669 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4
[2019-11-27 22:35:43,669 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713960493]
[2019-11-27 22:35:43,672 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-27 22:35:43,672 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:43,673 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-27 22:35:43,673 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-27 22:35:43,673 INFO  L87              Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states.
[2019-11-27 22:35:44,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:44,179 INFO  L93              Difference]: Finished difference Result 9987 states and 13646 transitions.
[2019-11-27 22:35:44,180 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-27 22:35:44,180 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 346
[2019-11-27 22:35:44,181 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:44,200 INFO  L225             Difference]: With dead ends: 9987
[2019-11-27 22:35:44,200 INFO  L226             Difference]: Without dead ends: 7540
[2019-11-27 22:35:44,208 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-27 22:35:44,221 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7540 states.
[2019-11-27 22:35:44,426 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561.
[2019-11-27 22:35:44,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5561 states.
[2019-11-27 22:35:44,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions.
[2019-11-27 22:35:44,440 INFO  L78                 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 346
[2019-11-27 22:35:44,441 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:44,442 INFO  L462      AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions.
[2019-11-27 22:35:44,442 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-27 22:35:44,442 INFO  L276                IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions.
[2019-11-27 22:35:44,462 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 374
[2019-11-27 22:35:44,463 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:44,464 INFO  L410         BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:44,671 WARN  L499      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-27 22:35:44,671 INFO  L410      AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:44,672 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:44,672 INFO  L82        PathProgramCache]: Analyzing trace with hash -1397611342, now seen corresponding path program 1 times
[2019-11-27 22:35:44,672 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:44,672 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204869227]
[2019-11-27 22:35:44,672 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:44,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:45,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked.
[2019-11-27 22:35:45,004 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204869227]
[2019-11-27 22:35:45,006 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134428214]
[2019-11-27 22:35:45,006 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-27 22:35:45,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:45,206 INFO  L255         TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-27 22:35:45,213 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2019-11-27 22:35:45,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked.
[2019-11-27 22:35:45,492 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-11-27 22:35:45,493 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4
[2019-11-27 22:35:45,493 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8195705]
[2019-11-27 22:35:45,495 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-27 22:35:45,495 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:45,496 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-27 22:35:45,496 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-27 22:35:45,496 INFO  L87              Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states.
[2019-11-27 22:35:45,962 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:45,962 INFO  L93              Difference]: Finished difference Result 12544 states and 16972 transitions.
[2019-11-27 22:35:45,963 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-11-27 22:35:45,963 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 373
[2019-11-27 22:35:45,964 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:45,980 INFO  L225             Difference]: With dead ends: 12544
[2019-11-27 22:35:45,980 INFO  L226             Difference]: Without dead ends: 6979
[2019-11-27 22:35:45,989 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-27 22:35:45,998 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6979 states.
[2019-11-27 22:35:46,143 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709.
[2019-11-27 22:35:46,144 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5709 states.
[2019-11-27 22:35:46,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions.
[2019-11-27 22:35:46,153 INFO  L78                 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373
[2019-11-27 22:35:46,154 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:46,154 INFO  L462      AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions.
[2019-11-27 22:35:46,155 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-27 22:35:46,155 INFO  L276                IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions.
[2019-11-27 22:35:46,172 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 413
[2019-11-27 22:35:46,173 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:46,173 INFO  L410         BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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]
[2019-11-27 22:35:46,378 WARN  L499      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-27 22:35:46,379 INFO  L410      AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:46,379 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:46,379 INFO  L82        PathProgramCache]: Analyzing trace with hash -236946382, now seen corresponding path program 1 times
[2019-11-27 22:35:46,380 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:46,380 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77862133]
[2019-11-27 22:35:46,380 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:46,414 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:46,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked.
[2019-11-27 22:35:46,607 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77862133]
[2019-11-27 22:35:46,611 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-27 22:35:46,612 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-27 22:35:46,612 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97063408]
[2019-11-27 22:35:46,613 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:46,613 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:46,614 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:46,614 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:46,615 INFO  L87              Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states.
[2019-11-27 22:35:46,841 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:46,842 INFO  L93              Difference]: Finished difference Result 11015 states and 14510 transitions.
[2019-11-27 22:35:46,843 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:46,843 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 412
[2019-11-27 22:35:46,844 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:46,850 INFO  L225             Difference]: With dead ends: 11015
[2019-11-27 22:35:46,851 INFO  L226             Difference]: Without dead ends: 3069
[2019-11-27 22:35:46,861 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-27 22:35:46,865 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3069 states.
[2019-11-27 22:35:46,929 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976.
[2019-11-27 22:35:46,930 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2976 states.
[2019-11-27 22:35:46,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions.
[2019-11-27 22:35:46,935 INFO  L78                 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412
[2019-11-27 22:35:46,935 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:46,936 INFO  L462      AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions.
[2019-11-27 22:35:46,936 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:46,936 INFO  L276                IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions.
[2019-11-27 22:35:46,948 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 497
[2019-11-27 22:35:46,948 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:46,949 INFO  L410         BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:46,949 INFO  L410      AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:46,950 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:46,950 INFO  L82        PathProgramCache]: Analyzing trace with hash -788979008, now seen corresponding path program 1 times
[2019-11-27 22:35:46,951 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:46,953 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808523901]
[2019-11-27 22:35:46,954 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:46,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:47,459 INFO  L134       CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked.
[2019-11-27 22:35:47,459 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808523901]
[2019-11-27 22:35:47,460 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097034466]
[2019-11-27 22:35:47,460 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-27 22:35:47,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:47,718 INFO  L255         TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-27 22:35:47,732 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2019-11-27 22:35:48,476 INFO  L134       CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked.
[2019-11-27 22:35:48,477 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-11-27 22:35:48,477 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2019-11-27 22:35:48,478 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105370728]
[2019-11-27 22:35:48,481 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:48,481 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:48,482 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:48,482 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-27 22:35:48,482 INFO  L87              Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states.
[2019-11-27 22:35:48,541 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:48,542 INFO  L93              Difference]: Finished difference Result 3028 states and 4049 transitions.
[2019-11-27 22:35:48,542 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:48,543 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 496
[2019-11-27 22:35:48,544 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:48,552 INFO  L225             Difference]: With dead ends: 3028
[2019-11-27 22:35:48,552 INFO  L226             Difference]: Without dead ends: 2531
[2019-11-27 22:35:48,555 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-27 22:35:48,559 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2531 states.
[2019-11-27 22:35:48,637 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481.
[2019-11-27 22:35:48,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2481 states.
[2019-11-27 22:35:48,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions.
[2019-11-27 22:35:48,645 INFO  L78                 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 496
[2019-11-27 22:35:48,646 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:48,646 INFO  L462      AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions.
[2019-11-27 22:35:48,647 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:48,647 INFO  L276                IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions.
[2019-11-27 22:35:48,671 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 498
[2019-11-27 22:35:48,672 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:48,673 INFO  L410         BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:48,880 WARN  L499      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-27 22:35:48,880 INFO  L410      AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:48,880 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:48,881 INFO  L82        PathProgramCache]: Analyzing trace with hash 866163585, now seen corresponding path program 1 times
[2019-11-27 22:35:48,881 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:48,881 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892134623]
[2019-11-27 22:35:48,882 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:48,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:49,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 2607 backedges. 1546 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked.
[2019-11-27 22:35:49,323 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892134623]
[2019-11-27 22:35:49,324 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838013574]
[2019-11-27 22:35:49,325 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-27 22:35:49,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:49,560 INFO  L255         TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 2 conjunts are in the unsatisfiable core
[2019-11-27 22:35:49,568 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2019-11-27 22:35:49,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 2607 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2339 trivial. 0 not checked.
[2019-11-27 22:35:49,966 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-11-27 22:35:49,967 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2019-11-27 22:35:49,967 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881917004]
[2019-11-27 22:35:49,970 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-27 22:35:49,971 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:49,971 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-27 22:35:49,972 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-27 22:35:49,972 INFO  L87              Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states.
[2019-11-27 22:35:50,270 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:50,270 INFO  L93              Difference]: Finished difference Result 5060 states and 6783 transitions.
[2019-11-27 22:35:50,271 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-27 22:35:50,271 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 497
[2019-11-27 22:35:50,273 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:50,282 INFO  L225             Difference]: With dead ends: 5060
[2019-11-27 22:35:50,282 INFO  L226             Difference]: Without dead ends: 2589
[2019-11-27 22:35:50,288 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-27 22:35:50,293 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2589 states.
[2019-11-27 22:35:50,385 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586.
[2019-11-27 22:35:50,386 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2586 states.
[2019-11-27 22:35:50,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions.
[2019-11-27 22:35:50,394 INFO  L78                 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 497
[2019-11-27 22:35:50,395 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:50,395 INFO  L462      AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions.
[2019-11-27 22:35:50,395 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-27 22:35:50,395 INFO  L276                IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions.
[2019-11-27 22:35:50,424 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 609
[2019-11-27 22:35:50,424 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-27 22:35:50,425 INFO  L410         BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-27 22:35:50,632 WARN  L499      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-27 22:35:50,633 INFO  L410      AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-27 22:35:50,634 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-27 22:35:50,635 INFO  L82        PathProgramCache]: Analyzing trace with hash -1604973917, now seen corresponding path program 2 times
[2019-11-27 22:35:50,636 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-27 22:35:50,636 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496552386]
[2019-11-27 22:35:50,636 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-27 22:35:50,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-27 22:35:51,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2019-11-27 22:35:51,131 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496552386]
[2019-11-27 22:35:51,131 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847030481]
[2019-11-27 22:35:51,131 INFO  L92    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-27 22:35:51,322 INFO  L249   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2019-11-27 22:35:51,323 INFO  L250   tOrderPrioritization]: Conjunction of SSA is unsat
[2019-11-27 22:35:51,326 INFO  L255         TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-27 22:35:51,336 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2019-11-27 22:35:51,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2019-11-27 22:35:51,938 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-11-27 22:35:51,938 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4
[2019-11-27 22:35:51,939 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836828639]
[2019-11-27 22:35:51,940 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-27 22:35:51,940 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-27 22:35:51,940 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-27 22:35:51,941 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-27 22:35:51,941 INFO  L87              Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states.
[2019-11-27 22:35:52,125 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-27 22:35:52,125 INFO  L93              Difference]: Finished difference Result 2848 states and 3664 transitions.
[2019-11-27 22:35:52,126 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-11-27 22:35:52,126 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 608
[2019-11-27 22:35:52,126 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-27 22:35:52,127 INFO  L225             Difference]: With dead ends: 2848
[2019-11-27 22:35:52,127 INFO  L226             Difference]: Without dead ends: 0
[2019-11-27 22:35:52,131 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-27 22:35:52,131 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-11-27 22:35:52,131 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-11-27 22:35:52,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-11-27 22:35:52,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-11-27 22:35:52,132 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 608
[2019-11-27 22:35:52,133 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-27 22:35:52,133 INFO  L462      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-11-27 22:35:52,133 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-27 22:35:52,133 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-11-27 22:35:52,134 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2019-11-27 22:35:52,339 WARN  L499      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-27 22:35:52,343 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-11-27 22:35:52,843 WARN  L192               SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111
[2019-11-27 22:35:53,872 WARN  L192               SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50
[2019-11-27 22:35:54,104 WARN  L192               SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7
[2019-11-27 22:35:54,327 INFO  L242        CegarLoopResult]: At program point  L201(lines 197 514)  the Hoare annotation is:  (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))))
[2019-11-27 22:35:54,327 INFO  L242        CegarLoopResult]: At program point  L135(lines 131 536)  the Hoare annotation is:  (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))
[2019-11-27 22:35:54,327 INFO  L246        CegarLoopResult]: For program point  L102(lines 102 104)  no Hoare annotation was computed.
[2019-11-27 22:35:54,328 INFO  L246        CegarLoopResult]: For program point  L235(lines 235 251)  no Hoare annotation was computed.
[2019-11-27 22:35:54,328 INFO  L246        CegarLoopResult]: For program point  L235-2(lines 210 508)  no Hoare annotation was computed.
[2019-11-27 22:35:54,328 INFO  L246        CegarLoopResult]: For program point  L467(lines 467 479)  no Hoare annotation was computed.
[2019-11-27 22:35:54,328 INFO  L246        CegarLoopResult]: For program point  L434(lines 434 448)  no Hoare annotation was computed.
[2019-11-27 22:35:54,328 INFO  L246        CegarLoopResult]: For program point  L434-1(lines 434 448)  no Hoare annotation was computed.
[2019-11-27 22:35:54,328 INFO  L246        CegarLoopResult]: For program point  L467-2(lines 467 479)  no Hoare annotation was computed.
[2019-11-27 22:35:54,328 INFO  L246        CegarLoopResult]: For program point  L335(lines 335 338)  no Hoare annotation was computed.
[2019-11-27 22:35:54,328 INFO  L246        CegarLoopResult]: For program point  L269(lines 269 271)  no Hoare annotation was computed.
[2019-11-27 22:35:54,329 INFO  L246        CegarLoopResult]: For program point  L203(lines 203 512)  no Hoare annotation was computed.
[2019-11-27 22:35:54,329 INFO  L246        CegarLoopResult]: For program point  L269-2(lines 210 508)  no Hoare annotation was computed.
[2019-11-27 22:35:54,329 INFO  L246        CegarLoopResult]: For program point  L170(lines 170 523)  no Hoare annotation was computed.
[2019-11-27 22:35:54,329 INFO  L246        CegarLoopResult]: For program point  L137(lines 137 534)  no Hoare annotation was computed.
[2019-11-27 22:35:54,329 INFO  L246        CegarLoopResult]: For program point  L501(lines 501 503)  no Hoare annotation was computed.
[2019-11-27 22:35:54,330 INFO  L242        CegarLoopResult]: At program point  L204(lines 203 512)  the Hoare annotation is:  (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))))
[2019-11-27 22:35:54,331 INFO  L242        CegarLoopResult]: At program point  L171(lines 161 526)  the Hoare annotation is:  (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))
[2019-11-27 22:35:54,332 INFO  L246        CegarLoopResult]: For program point  L568(lines 568 570)  no Hoare annotation was computed.
[2019-11-27 22:35:54,332 INFO  L246        CegarLoopResult]: For program point  L568-2(lines 568 570)  no Hoare annotation was computed.
[2019-11-27 22:35:54,332 INFO  L246        CegarLoopResult]: For program point  L370(lines 370 372)  no Hoare annotation was computed.
[2019-11-27 22:35:54,334 INFO  L246        CegarLoopResult]: For program point  L404(lines 404 406)  no Hoare annotation was computed.
[2019-11-27 22:35:54,334 INFO  L246        CegarLoopResult]: For program point  L206(lines 206 511)  no Hoare annotation was computed.
[2019-11-27 22:35:54,334 INFO  L246        CegarLoopResult]: For program point  L173(lines 173 522)  no Hoare annotation was computed.
[2019-11-27 22:35:54,334 INFO  L246        CegarLoopResult]: For program point  L140(lines 140 533)  no Hoare annotation was computed.
[2019-11-27 22:35:54,335 INFO  L246        CegarLoopResult]: For program point  L107-1(lines 84 574)  no Hoare annotation was computed.
[2019-11-27 22:35:54,335 INFO  L246        CegarLoopResult]: For program point  L438(lines 438 444)  no Hoare annotation was computed.
[2019-11-27 22:35:54,335 INFO  L249        CegarLoopResult]: At program point  L207(lines 206 511)  the Hoare annotation is:  true
[2019-11-27 22:35:54,335 INFO  L242        CegarLoopResult]: At program point  L141(lines 137 534)  the Hoare annotation is:  (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2)))
[2019-11-27 22:35:54,335 INFO  L246        CegarLoopResult]: For program point  L108(line 108)  no Hoare annotation was computed.
[2019-11-27 22:35:54,336 INFO  L246        CegarLoopResult]: For program point  L241(lines 241 244)  no Hoare annotation was computed.
[2019-11-27 22:35:54,336 INFO  L246        CegarLoopResult]: For program point  L473(lines 473 476)  no Hoare annotation was computed.
[2019-11-27 22:35:54,336 INFO  L249        CegarLoopResult]: At program point  L209(lines 208 511)  the Hoare annotation is:  true
[2019-11-27 22:35:54,336 INFO  L246        CegarLoopResult]: For program point  L176(lines 176 521)  no Hoare annotation was computed.
[2019-11-27 22:35:54,336 INFO  L246        CegarLoopResult]: For program point  L143(lines 143 532)  no Hoare annotation was computed.
[2019-11-27 22:35:54,336 INFO  L246        CegarLoopResult]: For program point  L110(lines 110 543)  no Hoare annotation was computed.
[2019-11-27 22:35:54,337 INFO  L249        CegarLoopResult]: At program point  L573(lines 10 575)  the Hoare annotation is:  true
[2019-11-27 22:35:54,337 INFO  L246        CegarLoopResult]: For program point  L309(lines 309 319)  no Hoare annotation was computed.
[2019-11-27 22:35:54,338 INFO  L246        CegarLoopResult]: For program point  L309-2(lines 309 319)  no Hoare annotation was computed.
[2019-11-27 22:35:54,338 INFO  L242        CegarLoopResult]: At program point  L177(lines 173 522)  the Hoare annotation is:  (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))
[2019-11-27 22:35:54,338 INFO  L242        CegarLoopResult]: At program point  L111(lines 110 543)  the Hoare annotation is:  (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0))
[2019-11-27 22:35:54,339 INFO  L246        CegarLoopResult]: For program point  L343(lines 343 345)  no Hoare annotation was computed.
[2019-11-27 22:35:54,339 INFO  L242        CegarLoopResult]: At program point  L509(lines 107 562)  the Hoare annotation is:  (let ((.cse8 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse12 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (not .cse8)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse0) (and .cse4 .cse5) (and .cse6 .cse7 .cse8 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse7 .cse8 .cse5 .cse9) (and .cse0 .cse4 .cse8) (and .cse10 .cse11 .cse12 .cse8 .cse5) (and .cse2 .cse3 .cse12 .cse8 .cse5) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse7 .cse8) (and .cse1 .cse10 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse8 .cse9) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse6 .cse0))))
[2019-11-27 22:35:54,340 INFO  L246        CegarLoopResult]: For program point  L410(lines 410 414)  no Hoare annotation was computed.
[2019-11-27 22:35:54,340 INFO  L242        CegarLoopResult]: At program point  L344(lines 84 574)  the Hoare annotation is:  false
[2019-11-27 22:35:54,340 INFO  L246        CegarLoopResult]: For program point  L410-2(lines 210 508)  no Hoare annotation was computed.
[2019-11-27 22:35:54,341 INFO  L246        CegarLoopResult]: For program point  L179(lines 179 520)  no Hoare annotation was computed.
[2019-11-27 22:35:54,341 INFO  L246        CegarLoopResult]: For program point  L146(lines 146 531)  no Hoare annotation was computed.
[2019-11-27 22:35:54,342 INFO  L246        CegarLoopResult]: For program point  L113(lines 113 542)  no Hoare annotation was computed.
[2019-11-27 22:35:54,342 INFO  L246        CegarLoopResult]: For program point  L246(lines 246 249)  no Hoare annotation was computed.
[2019-11-27 22:35:54,342 INFO  L242        CegarLoopResult]: At program point  L147(lines 143 532)  the Hoare annotation is:  (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))
[2019-11-27 22:35:54,342 INFO  L246        CegarLoopResult]: For program point  L544(lines 544 560)  no Hoare annotation was computed.
[2019-11-27 22:35:54,342 INFO  L246        CegarLoopResult]: For program point  L379(lines 379 381)  no Hoare annotation was computed.
[2019-11-27 22:35:54,342 INFO  L246        CegarLoopResult]: For program point  L346(lines 346 348)  no Hoare annotation was computed.
[2019-11-27 22:35:54,343 INFO  L246        CegarLoopResult]: For program point  L313(lines 313 315)  no Hoare annotation was computed.
[2019-11-27 22:35:54,343 INFO  L246        CegarLoopResult]: For program point  L280(lines 280 282)  no Hoare annotation was computed.
[2019-11-27 22:35:54,343 INFO  L246        CegarLoopResult]: For program point  L313-2(lines 311 319)  no Hoare annotation was computed.
[2019-11-27 22:35:54,343 INFO  L246        CegarLoopResult]: For program point  L545(lines 545 559)  no Hoare annotation was computed.
[2019-11-27 22:35:54,344 INFO  L242        CegarLoopResult]: At program point  L215(lines 113 542)  the Hoare annotation is:  (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))
[2019-11-27 22:35:54,344 INFO  L246        CegarLoopResult]: For program point  L182(lines 182 519)  no Hoare annotation was computed.
[2019-11-27 22:35:54,344 INFO  L246        CegarLoopResult]: For program point  L149(lines 149 530)  no Hoare annotation was computed.
[2019-11-27 22:35:54,344 INFO  L246        CegarLoopResult]: For program point  L116(lines 116 541)  no Hoare annotation was computed.
[2019-11-27 22:35:54,344 INFO  L246        CegarLoopResult]: For program point  L546(lines 546 551)  no Hoare annotation was computed.
[2019-11-27 22:35:54,344 INFO  L246        CegarLoopResult]: For program point  L546-2(lines 545 559)  no Hoare annotation was computed.
[2019-11-27 22:35:54,345 INFO  L242        CegarLoopResult]: At program point  L183(lines 179 520)  the Hoare annotation is:  (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))
[2019-11-27 22:35:54,345 INFO  L246        CegarLoopResult]: For program point  L548(lines 548 550)  no Hoare annotation was computed.
[2019-11-27 22:35:54,345 INFO  L246        CegarLoopResult]: For program point  L383(lines 383 388)  no Hoare annotation was computed.
[2019-11-27 22:35:54,346 INFO  L246        CegarLoopResult]: For program point  ULTIMATE.startENTRY(line -1)  no Hoare annotation was computed.
[2019-11-27 22:35:54,346 INFO  L246        CegarLoopResult]: For program point  L383-2(lines 383 388)  no Hoare annotation was computed.
[2019-11-27 22:35:54,346 INFO  L246        CegarLoopResult]: For program point  L185(lines 185 518)  no Hoare annotation was computed.
[2019-11-27 22:35:54,346 INFO  L246        CegarLoopResult]: For program point  L152(lines 152 529)  no Hoare annotation was computed.
[2019-11-27 22:35:54,346 INFO  L246        CegarLoopResult]: For program point  L119(lines 119 540)  no Hoare annotation was computed.
[2019-11-27 22:35:54,347 INFO  L242        CegarLoopResult]: At program point  L153(lines 149 530)  the Hoare annotation is:  (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))
[2019-11-27 22:35:54,347 INFO  L246        CegarLoopResult]: For program point  L484-1(lines 484 486)  no Hoare annotation was computed.
[2019-11-27 22:35:54,347 INFO  L246        CegarLoopResult]: For program point  L220(lines 220 222)  no Hoare annotation was computed.
[2019-11-27 22:35:54,347 INFO  L246        CegarLoopResult]: For program point  L220-2(lines 220 222)  no Hoare annotation was computed.
[2019-11-27 22:35:54,348 INFO  L249        CegarLoopResult]: At program point  L584(lines 576 586)  the Hoare annotation is:  true
[2019-11-27 22:35:54,348 INFO  L246        CegarLoopResult]: For program point  L419(lines 419 422)  no Hoare annotation was computed.
[2019-11-27 22:35:54,349 INFO  L246        CegarLoopResult]: For program point  L188(lines 188 517)  no Hoare annotation was computed.
[2019-11-27 22:35:54,350 INFO  L246        CegarLoopResult]: For program point  L155(lines 155 528)  no Hoare annotation was computed.
[2019-11-27 22:35:54,350 INFO  L246        CegarLoopResult]: For program point  L122(lines 122 539)  no Hoare annotation was computed.
[2019-11-27 22:35:54,350 INFO  L246        CegarLoopResult]: For program point  L288(lines 288 294)  no Hoare annotation was computed.
[2019-11-27 22:35:54,350 INFO  L242        CegarLoopResult]: At program point  L189(lines 185 518)  the Hoare annotation is:  (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))))
[2019-11-27 22:35:54,350 INFO  L246        CegarLoopResult]: For program point  L553(lines 553 557)  no Hoare annotation was computed.
[2019-11-27 22:35:54,351 INFO  L246        CegarLoopResult]: For program point  L454(lines 454 456)  no Hoare annotation was computed.
[2019-11-27 22:35:54,351 INFO  L246        CegarLoopResult]: For program point  L355(lines 355 357)  no Hoare annotation was computed.
[2019-11-27 22:35:54,351 INFO  L246        CegarLoopResult]: For program point  ULTIMATE.startEXIT(line -1)  no Hoare annotation was computed.
[2019-11-27 22:35:54,352 INFO  L246        CegarLoopResult]: For program point  L257(lines 257 260)  no Hoare annotation was computed.
[2019-11-27 22:35:54,352 INFO  L246        CegarLoopResult]: For program point  L191(lines 191 516)  no Hoare annotation was computed.
[2019-11-27 22:35:54,352 INFO  L246        CegarLoopResult]: For program point  L158(lines 158 527)  no Hoare annotation was computed.
[2019-11-27 22:35:54,352 INFO  L246        CegarLoopResult]: For program point  L125(lines 125 538)  no Hoare annotation was computed.
[2019-11-27 22:35:54,352 INFO  L246        CegarLoopResult]: For program point  L291(lines 291 293)  no Hoare annotation was computed.
[2019-11-27 22:35:54,353 INFO  L246        CegarLoopResult]: For program point  L225(lines 225 228)  no Hoare annotation was computed.
[2019-11-27 22:35:54,353 INFO  L246        CegarLoopResult]: For program point  L291-2(lines 210 508)  no Hoare annotation was computed.
[2019-11-27 22:35:54,353 INFO  L242        CegarLoopResult]: At program point  L159(lines 155 528)  the Hoare annotation is:  (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))
[2019-11-27 22:35:54,353 INFO  L246        CegarLoopResult]: For program point  L93(lines 93 99)  no Hoare annotation was computed.
[2019-11-27 22:35:54,353 INFO  L246        CegarLoopResult]: For program point  L490(lines 490 492)  no Hoare annotation was computed.
[2019-11-27 22:35:54,354 INFO  L246        CegarLoopResult]: For program point  L457(lines 457 461)  no Hoare annotation was computed.
[2019-11-27 22:35:54,354 INFO  L246        CegarLoopResult]: For program point  L490-2(lines 490 492)  no Hoare annotation was computed.
[2019-11-27 22:35:54,354 INFO  L246        CegarLoopResult]: For program point  L457-2(lines 457 461)  no Hoare annotation was computed.
[2019-11-27 22:35:54,354 INFO  L246        CegarLoopResult]: For program point  L358(lines 358 362)  no Hoare annotation was computed.
[2019-11-27 22:35:54,354 INFO  L246        CegarLoopResult]: For program point  L358-2(lines 358 362)  no Hoare annotation was computed.
[2019-11-27 22:35:54,354 INFO  L246        CegarLoopResult]: For program point  ULTIMATE.startFINAL(line -1)  no Hoare annotation was computed.
[2019-11-27 22:35:54,355 INFO  L246        CegarLoopResult]: For program point  L194(lines 194 515)  no Hoare annotation was computed.
[2019-11-27 22:35:54,355 INFO  L246        CegarLoopResult]: For program point  L161(lines 161 526)  no Hoare annotation was computed.
[2019-11-27 22:35:54,355 INFO  L246        CegarLoopResult]: For program point  L128(lines 128 537)  no Hoare annotation was computed.
[2019-11-27 22:35:54,355 INFO  L246        CegarLoopResult]: For program point  L327(lines 327 329)  no Hoare annotation was computed.
[2019-11-27 22:35:54,355 INFO  L246        CegarLoopResult]: For program point  L327-2(lines 210 508)  no Hoare annotation was computed.
[2019-11-27 22:35:54,356 INFO  L242        CegarLoopResult]: At program point  L195(lines 191 516)  the Hoare annotation is:  (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))))
[2019-11-27 22:35:54,356 INFO  L242        CegarLoopResult]: At program point  L129(lines 125 538)  the Hoare annotation is:  (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))
[2019-11-27 22:35:54,356 INFO  L246        CegarLoopResult]: For program point  L96(lines 96 98)  no Hoare annotation was computed.
[2019-11-27 22:35:54,356 INFO  L246        CegarLoopResult]: For program point  L96-2(lines 93 99)  no Hoare annotation was computed.
[2019-11-27 22:35:54,356 INFO  L246        CegarLoopResult]: For program point  L427(lines 427 429)  no Hoare annotation was computed.
[2019-11-27 22:35:54,356 INFO  L246        CegarLoopResult]: For program point  L394(lines 394 396)  no Hoare annotation was computed.
[2019-11-27 22:35:54,357 INFO  L246        CegarLoopResult]: For program point  L197(lines 197 514)  no Hoare annotation was computed.
[2019-11-27 22:35:54,357 INFO  L246        CegarLoopResult]: For program point  L164(lines 164 525)  no Hoare annotation was computed.
[2019-11-27 22:35:54,357 INFO  L246        CegarLoopResult]: For program point  L131(lines 131 536)  no Hoare annotation was computed.
[2019-11-27 22:35:54,357 INFO  L246        CegarLoopResult]: For program point  ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 572)  no Hoare annotation was computed.
[2019-11-27 22:35:54,357 INFO  L246        CegarLoopResult]: For program point  L496(lines 496 498)  no Hoare annotation was computed.
[2019-11-27 22:35:54,358 INFO  L246        CegarLoopResult]: For program point  L496-2(lines 496 498)  no Hoare annotation was computed.
[2019-11-27 22:35:54,358 INFO  L246        CegarLoopResult]: For program point  L298(lines 298 302)  no Hoare annotation was computed.
[2019-11-27 22:35:54,358 INFO  L246        CegarLoopResult]: For program point  L298-2(lines 298 302)  no Hoare annotation was computed.
[2019-11-27 22:35:54,358 INFO  L249        CegarLoopResult]: At program point  L563(lines 106 564)  the Hoare annotation is:  true
[2019-11-27 22:35:54,358 INFO  L246        CegarLoopResult]: For program point  L200(lines 200 513)  no Hoare annotation was computed.
[2019-11-27 22:35:54,358 INFO  L246        CegarLoopResult]: For program point  L167(lines 167 524)  no Hoare annotation was computed.
[2019-11-27 22:35:54,359 INFO  L246        CegarLoopResult]: For program point  L134(lines 134 535)  no Hoare annotation was computed.
[2019-11-27 22:35:54,359 INFO  L246        CegarLoopResult]: For program point  L101(lines 101 105)  no Hoare annotation was computed.
[2019-11-27 22:35:54,408 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:35:54 BoogieIcfgContainer
[2019-11-27 22:35:54,409 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-11-27 22:35:54,410 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2019-11-27 22:35:54,410 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2019-11-27 22:35:54,410 INFO  L275        PluginConnector]: Witness Printer initialized
[2019-11-27 22:35:54,411 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:35" (3/4) ...
[2019-11-27 22:35:54,416 INFO  L137         WitnessPrinter]: Generating witness for correct program
[2019-11-27 22:35:54,446 INFO  L902   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2019-11-27 22:35:54,447 INFO  L902   BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2019-11-27 22:35:54,627 INFO  L141         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2019-11-27 22:35:54,627 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2019-11-27 22:35:54,629 INFO  L168              Benchmark]: Toolchain (without parser) took 20076.40 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 936.9 MB). Free memory was 957.7 MB in the beginning and 1.4 GB in the end (delta: -410.0 MB). Peak memory consumption was 526.9 MB. Max. memory is 11.5 GB.
[2019-11-27 22:35:54,629 INFO  L168              Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2019-11-27 22:35:54,630 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 513.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB.
[2019-11-27 22:35:54,630 INFO  L168              Benchmark]: Boogie Procedure Inliner took 68.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB.
[2019-11-27 22:35:54,630 INFO  L168              Benchmark]: Boogie Preprocessor took 35.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB.
[2019-11-27 22:35:54,631 INFO  L168              Benchmark]: RCFGBuilder took 799.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB.
[2019-11-27 22:35:54,631 INFO  L168              Benchmark]: TraceAbstraction took 18434.96 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 817.4 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -340.2 MB). Peak memory consumption was 477.1 MB. Max. memory is 11.5 GB.
[2019-11-27 22:35:54,632 INFO  L168              Benchmark]: Witness Printer took 217.41 ms. Allocated memory is still 2.0 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB.
[2019-11-27 22:35:54,634 INFO  L335   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * CACSL2BoogieTranslator took 513.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB.
 * Boogie Procedure Inliner took 68.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 35.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB.
 * RCFGBuilder took 799.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB.
 * TraceAbstraction took 18434.96 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 817.4 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -340.2 MB). Peak memory consumption was 477.1 MB. Max. memory is 11.5 GB.
 * Witness Printer took 217.41 ms. Allocated memory is still 2.0 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 572]: call of __VERIFIER_error() unreachable
    For all program executions holds that call of __VERIFIER_error() unreachable at this location
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 110]: Loop Invariant
    Derived loop invariant: blastFlag <= 2 && 12292 == s__state
  - InvariantResult [Line: 206]: Loop Invariant
    Derived loop invariant: 1
  - InvariantResult [Line: 84]: Loop Invariant
    Derived loop invariant: 0
  - InvariantResult [Line: 173]: Loop Invariant
    Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state
  - InvariantResult [Line: 208]: Loop Invariant
    Derived loop invariant: 1
  - InvariantResult [Line: 131]: Loop Invariant
    Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state
  - InvariantResult [Line: 185]: Loop Invariant
    Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)
  - InvariantResult [Line: 143]: Loop Invariant
    Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit
  - InvariantResult [Line: 197]: Loop Invariant
    Derived loop invariant: (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)
  - InvariantResult [Line: 155]: Loop Invariant
    Derived loop invariant: ((s__state <= 4464 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state
  - InvariantResult [Line: 106]: Loop Invariant
    Derived loop invariant: 1
  - InvariantResult [Line: 576]: Loop Invariant
    Derived loop invariant: 1
  - InvariantResult [Line: 161]: Loop Invariant
    Derived loop invariant: ((s__state <= 4480 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state
  - InvariantResult [Line: 10]: Loop Invariant
    Derived loop invariant: 1
  - InvariantResult [Line: 107]: Loop Invariant
    Derived loop invariant: ((((((((((((blastFlag <= 2 && 4368 == s__state) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)
  - InvariantResult [Line: 125]: Loop Invariant
    Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state
  - InvariantResult [Line: 203]: Loop Invariant
    Derived loop invariant: ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)
  - InvariantResult [Line: 113]: Loop Invariant
    Derived loop invariant: s__state <= 4560 && blastFlag <= 2
  - InvariantResult [Line: 179]: Loop Invariant
    Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state
  - InvariantResult [Line: 137]: Loop Invariant
    Derived loop invariant: ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit)
  - InvariantResult [Line: 191]: Loop Invariant
    Derived loop invariant: ((((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || (((s__state <= 4560 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2)
  - InvariantResult [Line: 149]: Loop Invariant
    Derived loop invariant: ((blastFlag <= 4 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 16.2s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, HoareTripleCheckerStatistics: 4490 SDtfs, 2114 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2400 GetRequests, 2365 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 425 HoareAnnotationTreeSize, 22 FomulaSimplifications, 31460 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24851 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 8415 NumberOfCodeBlocks, 8415 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 8385 ConstructedInterpolants, 0 QuantifiedInterpolants, 4385301 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3916 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 37271/37361 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...