./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer --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 4189574b2550552a572f663e591e000dc3f42b46 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 19:40:30,241 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 19:40:30,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 19:40:30,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 19:40:30,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 19:40:30,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 19:40:30,249 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 19:40:30,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 19:40:30,251 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 19:40:30,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 19:40:30,252 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 19:40:30,252 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 19:40:30,253 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 19:40:30,253 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 19:40:30,254 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 19:40:30,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 19:40:30,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 19:40:30,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 19:40:30,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 19:40:30,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 19:40:30,258 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 19:40:30,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 19:40:30,260 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 19:40:30,260 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 19:40:30,260 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 19:40:30,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 19:40:30,261 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 19:40:30,262 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 19:40:30,262 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 19:40:30,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 19:40:30,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 19:40:30,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 19:40:30,263 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 19:40:30,263 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 19:40:30,264 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 19:40:30,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 19:40:30,265 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 19:40:30,272 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 19:40:30,272 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 19:40:30,272 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 19:40:30,272 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 19:40:30,273 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 19:40:30,273 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 19:40:30,273 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 19:40:30,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 19:40:30,273 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 19:40:30,273 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 19:40:30,274 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 19:40:30,274 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 19:40:30,274 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 19:40:30,274 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 19:40:30,274 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 19:40:30,274 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 19:40:30,274 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 19:40:30,274 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 19:40:30,274 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 19:40:30,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 19:40:30,275 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 19:40:30,275 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 19:40:30,275 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 19:40:30,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 19:40:30,275 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 19:40:30,275 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 19:40:30,275 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 19:40:30,275 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 19:40:30,275 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 19:40:30,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 19:40:30,275 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer 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 -> 4189574b2550552a572f663e591e000dc3f42b46 [2018-12-01 19:40:30,293 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 19:40:30,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 19:40:30,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 19:40:30,305 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 19:40:30,306 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 19:40:30,306 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-12-01 19:40:30,348 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/data/e858b6ca4/168cd7632f3d40efb56d2888be891b8e/FLAGa6681eaa8 [2018-12-01 19:40:30,686 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 19:40:30,687 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-12-01 19:40:30,692 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/data/e858b6ca4/168cd7632f3d40efb56d2888be891b8e/FLAGa6681eaa8 [2018-12-01 19:40:30,700 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/data/e858b6ca4/168cd7632f3d40efb56d2888be891b8e [2018-12-01 19:40:30,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 19:40:30,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 19:40:30,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 19:40:30,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 19:40:30,705 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 19:40:30,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:40:30" (1/1) ... [2018-12-01 19:40:30,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d58bc2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30, skipping insertion in model container [2018-12-01 19:40:30,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:40:30" (1/1) ... [2018-12-01 19:40:30,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 19:40:30,729 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 19:40:30,839 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:40:30,842 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 19:40:30,871 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 19:40:30,909 INFO L195 MainTranslator]: Completed translation [2018-12-01 19:40:30,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30 WrapperNode [2018-12-01 19:40:30,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 19:40:30,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 19:40:30,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 19:40:30,910 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 19:40:30,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30" (1/1) ... [2018-12-01 19:40:30,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30" (1/1) ... [2018-12-01 19:40:30,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 19:40:30,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 19:40:30,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 19:40:30,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 19:40:30,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30" (1/1) ... [2018-12-01 19:40:30,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30" (1/1) ... [2018-12-01 19:40:30,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30" (1/1) ... [2018-12-01 19:40:30,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30" (1/1) ... [2018-12-01 19:40:30,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30" (1/1) ... [2018-12-01 19:40:30,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30" (1/1) ... [2018-12-01 19:40:30,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30" (1/1) ... [2018-12-01 19:40:30,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 19:40:30,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 19:40:30,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 19:40:30,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 19:40:30,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/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 [2018-12-01 19:40:30,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 19:40:30,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 19:40:30,980 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-01 19:40:30,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-01 19:40:30,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 19:40:30,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 19:40:30,981 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 19:40:30,981 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 19:40:31,053 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 19:40:31,053 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 19:40:31,282 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 19:40:31,282 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 19:40:31,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:40:31 BoogieIcfgContainer [2018-12-01 19:40:31,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 19:40:31,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 19:40:31,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 19:40:31,285 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 19:40:31,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 07:40:30" (1/3) ... [2018-12-01 19:40:31,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d6cab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:40:31, skipping insertion in model container [2018-12-01 19:40:31,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:40:30" (2/3) ... [2018-12-01 19:40:31,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d6cab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:40:31, skipping insertion in model container [2018-12-01 19:40:31,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:40:31" (3/3) ... [2018-12-01 19:40:31,287 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-12-01 19:40:31,293 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 19:40:31,298 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 19:40:31,308 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 19:40:31,326 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 19:40:31,327 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 19:40:31,327 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 19:40:31,327 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 19:40:31,327 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 19:40:31,327 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 19:40:31,327 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 19:40:31,327 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 19:40:31,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 19:40:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-12-01 19:40:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 19:40:31,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:31,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:40:31,346 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:31,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:31,349 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2018-12-01 19:40:31,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:31,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:31,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:31,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:31,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:40:31,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:31,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:31,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:31,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:31,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:31,482 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-12-01 19:40:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:31,531 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-12-01 19:40:31,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:31,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 19:40:31,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:31,540 INFO L225 Difference]: With dead ends: 377 [2018-12-01 19:40:31,540 INFO L226 Difference]: Without dead ends: 220 [2018-12-01 19:40:31,542 INFO L631 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 [2018-12-01 19:40:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-01 19:40:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-12-01 19:40:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-01 19:40:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-12-01 19:40:31,574 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2018-12-01 19:40:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:31,574 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-12-01 19:40:31,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-12-01 19:40:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-01 19:40:31,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:31,575 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-01 19:40:31,575 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:31,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:31,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2018-12-01 19:40:31,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:31,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:31,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:31,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:31,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 19:40:31,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:31,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:31,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:31,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:31,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:31,616 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-12-01 19:40:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:31,696 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2018-12-01 19:40:31,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:31,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-01 19:40:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:31,697 INFO L225 Difference]: With dead ends: 470 [2018-12-01 19:40:31,697 INFO L226 Difference]: Without dead ends: 262 [2018-12-01 19:40:31,698 INFO L631 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 [2018-12-01 19:40:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-01 19:40:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2018-12-01 19:40:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-01 19:40:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2018-12-01 19:40:31,708 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2018-12-01 19:40:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:31,708 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2018-12-01 19:40:31,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:31,708 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2018-12-01 19:40:31,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-01 19:40:31,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:31,709 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-12-01 19:40:31,710 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:31,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:31,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1578262845, now seen corresponding path program 1 times [2018-12-01 19:40:31,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:31,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:31,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:31,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 19:40:31,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:31,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:31,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:31,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:31,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:31,754 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2018-12-01 19:40:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:31,865 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-12-01 19:40:31,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:31,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-01 19:40:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:31,866 INFO L225 Difference]: With dead ends: 598 [2018-12-01 19:40:31,867 INFO L226 Difference]: Without dead ends: 354 [2018-12-01 19:40:31,867 INFO L631 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 [2018-12-01 19:40:31,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-01 19:40:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2018-12-01 19:40:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-12-01 19:40:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2018-12-01 19:40:31,879 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2018-12-01 19:40:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:31,879 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2018-12-01 19:40:31,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2018-12-01 19:40:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-01 19:40:31,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:31,881 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-12-01 19:40:31,881 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:31,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash -227175489, now seen corresponding path program 1 times [2018-12-01 19:40:31,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:31,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:31,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:31,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:31,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 19:40:31,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:31,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:31,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:31,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:31,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:31,917 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2018-12-01 19:40:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:31,993 INFO L93 Difference]: Finished difference Result 710 states and 1008 transitions. [2018-12-01 19:40:31,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:31,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-01 19:40:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:31,995 INFO L225 Difference]: With dead ends: 710 [2018-12-01 19:40:31,995 INFO L226 Difference]: Without dead ends: 386 [2018-12-01 19:40:31,996 INFO L631 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 [2018-12-01 19:40:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-01 19:40:32,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 374. [2018-12-01 19:40:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-12-01 19:40:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-12-01 19:40:32,005 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2018-12-01 19:40:32,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:32,005 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-12-01 19:40:32,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-12-01 19:40:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-01 19:40:32,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:32,007 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-01 19:40:32,007 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:32,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:32,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1103228957, now seen corresponding path program 1 times [2018-12-01 19:40:32,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:32,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:32,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:32,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-01 19:40:32,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:32,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:32,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:32,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:32,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:32,034 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-12-01 19:40:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:32,137 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2018-12-01 19:40:32,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:32,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-01 19:40:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:32,138 INFO L225 Difference]: With dead ends: 842 [2018-12-01 19:40:32,139 INFO L226 Difference]: Without dead ends: 478 [2018-12-01 19:40:32,139 INFO L631 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 [2018-12-01 19:40:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-12-01 19:40:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2018-12-01 19:40:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-12-01 19:40:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2018-12-01 19:40:32,149 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2018-12-01 19:40:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:32,149 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2018-12-01 19:40:32,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2018-12-01 19:40:32,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-01 19:40:32,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:32,151 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-01 19:40:32,151 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:32,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:32,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1629529054, now seen corresponding path program 1 times [2018-12-01 19:40:32,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:32,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:32,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:32,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-01 19:40:32,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:32,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:32,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:32,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:32,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:32,180 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2018-12-01 19:40:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:32,262 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2018-12-01 19:40:32,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:32,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-01 19:40:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:32,265 INFO L225 Difference]: With dead ends: 940 [2018-12-01 19:40:32,265 INFO L226 Difference]: Without dead ends: 500 [2018-12-01 19:40:32,266 INFO L631 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 [2018-12-01 19:40:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-12-01 19:40:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2018-12-01 19:40:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-12-01 19:40:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2018-12-01 19:40:32,282 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2018-12-01 19:40:32,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:32,283 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2018-12-01 19:40:32,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2018-12-01 19:40:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-01 19:40:32,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:32,285 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2018-12-01 19:40:32,285 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:32,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash -233915046, now seen corresponding path program 1 times [2018-12-01 19:40:32,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:32,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:32,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:32,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-01 19:40:32,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:32,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:32,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:32,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:32,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:32,325 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2018-12-01 19:40:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:32,360 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2018-12-01 19:40:32,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:32,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-12-01 19:40:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:32,362 INFO L225 Difference]: With dead ends: 976 [2018-12-01 19:40:32,362 INFO L226 Difference]: Without dead ends: 734 [2018-12-01 19:40:32,362 INFO L631 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 [2018-12-01 19:40:32,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-01 19:40:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-12-01 19:40:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-12-01 19:40:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2018-12-01 19:40:32,374 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2018-12-01 19:40:32,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:32,374 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2018-12-01 19:40:32,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2018-12-01 19:40:32,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-01 19:40:32,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:32,376 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2018-12-01 19:40:32,376 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:32,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:32,376 INFO L82 PathProgramCache]: Analyzing trace with hash -674483159, now seen corresponding path program 1 times [2018-12-01 19:40:32,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:32,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:32,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:32,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-01 19:40:32,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:32,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:32,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:32,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:32,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:32,416 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2018-12-01 19:40:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:32,443 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2018-12-01 19:40:32,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:32,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-01 19:40:32,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:32,445 INFO L225 Difference]: With dead ends: 976 [2018-12-01 19:40:32,446 INFO L226 Difference]: Without dead ends: 974 [2018-12-01 19:40:32,446 INFO L631 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 [2018-12-01 19:40:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-12-01 19:40:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2018-12-01 19:40:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-12-01 19:40:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2018-12-01 19:40:32,459 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2018-12-01 19:40:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:32,459 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2018-12-01 19:40:32,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2018-12-01 19:40:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-01 19:40:32,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:32,460 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 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] [2018-12-01 19:40:32,460 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:32,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2095197958, now seen corresponding path program 1 times [2018-12-01 19:40:32,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:32,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:32,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:32,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-01 19:40:32,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:32,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:32,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:32,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:32,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:32,498 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2018-12-01 19:40:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:32,597 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2018-12-01 19:40:32,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:32,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-12-01 19:40:32,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:32,600 INFO L225 Difference]: With dead ends: 2140 [2018-12-01 19:40:32,600 INFO L226 Difference]: Without dead ends: 1170 [2018-12-01 19:40:32,601 INFO L631 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 [2018-12-01 19:40:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-12-01 19:40:32,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2018-12-01 19:40:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-12-01 19:40:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2018-12-01 19:40:32,617 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 139 [2018-12-01 19:40:32,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:32,617 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2018-12-01 19:40:32,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2018-12-01 19:40:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-01 19:40:32,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:32,619 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 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] [2018-12-01 19:40:32,619 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:32,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:32,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2111242741, now seen corresponding path program 1 times [2018-12-01 19:40:32,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:32,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:32,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:32,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-01 19:40:32,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:32,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:32,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:32,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:32,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:32,657 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2018-12-01 19:40:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:32,751 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2018-12-01 19:40:32,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:32,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-12-01 19:40:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:32,755 INFO L225 Difference]: With dead ends: 2354 [2018-12-01 19:40:32,755 INFO L226 Difference]: Without dead ends: 1236 [2018-12-01 19:40:32,757 INFO L631 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 [2018-12-01 19:40:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-12-01 19:40:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2018-12-01 19:40:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-12-01 19:40:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2018-12-01 19:40:32,781 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 175 [2018-12-01 19:40:32,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:32,781 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2018-12-01 19:40:32,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2018-12-01 19:40:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-01 19:40:32,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:32,783 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 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] [2018-12-01 19:40:32,783 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:32,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:32,783 INFO L82 PathProgramCache]: Analyzing trace with hash 834252520, now seen corresponding path program 1 times [2018-12-01 19:40:32,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:32,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:32,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:32,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-01 19:40:32,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:32,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:32,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:32,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:32,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:32,821 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2018-12-01 19:40:32,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:32,894 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2018-12-01 19:40:32,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:32,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2018-12-01 19:40:32,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:32,897 INFO L225 Difference]: With dead ends: 2544 [2018-12-01 19:40:32,897 INFO L226 Difference]: Without dead ends: 1334 [2018-12-01 19:40:32,899 INFO L631 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 [2018-12-01 19:40:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-12-01 19:40:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2018-12-01 19:40:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-12-01 19:40:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2018-12-01 19:40:32,916 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 196 [2018-12-01 19:40:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:32,916 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2018-12-01 19:40:32,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2018-12-01 19:40:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-01 19:40:32,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:32,918 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2018-12-01 19:40:32,918 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:32,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:32,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1654542421, now seen corresponding path program 1 times [2018-12-01 19:40:32,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:32,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-01 19:40:32,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:32,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:32,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:32,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:32,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:32,959 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2018-12-01 19:40:33,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:33,055 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2018-12-01 19:40:33,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:33,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-12-01 19:40:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:33,059 INFO L225 Difference]: With dead ends: 2752 [2018-12-01 19:40:33,059 INFO L226 Difference]: Without dead ends: 1442 [2018-12-01 19:40:33,061 INFO L631 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 [2018-12-01 19:40:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-12-01 19:40:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2018-12-01 19:40:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-12-01 19:40:33,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2018-12-01 19:40:33,084 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 220 [2018-12-01 19:40:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:33,084 INFO L480 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2018-12-01 19:40:33,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2018-12-01 19:40:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-01 19:40:33,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:33,087 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2018-12-01 19:40:33,087 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:33,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:33,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1609383977, now seen corresponding path program 1 times [2018-12-01 19:40:33,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:33,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:33,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:33,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:33,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-01 19:40:33,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:33,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:33,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:33,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:33,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:33,156 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2018-12-01 19:40:33,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:33,243 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2018-12-01 19:40:33,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:33,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-12-01 19:40:33,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:33,248 INFO L225 Difference]: With dead ends: 2992 [2018-12-01 19:40:33,248 INFO L226 Difference]: Without dead ends: 1570 [2018-12-01 19:40:33,250 INFO L631 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 [2018-12-01 19:40:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-12-01 19:40:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2018-12-01 19:40:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-12-01 19:40:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2018-12-01 19:40:33,278 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 220 [2018-12-01 19:40:33,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:33,278 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2018-12-01 19:40:33,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2018-12-01 19:40:33,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-01 19:40:33,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:33,280 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:40:33,280 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:33,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:33,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1500640469, now seen corresponding path program 1 times [2018-12-01 19:40:33,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:33,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:33,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:33,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:33,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-01 19:40:33,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:33,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:33,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:33,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:33,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:33,325 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2018-12-01 19:40:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:33,351 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2018-12-01 19:40:33,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:33,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-12-01 19:40:33,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:33,356 INFO L225 Difference]: With dead ends: 4646 [2018-12-01 19:40:33,356 INFO L226 Difference]: Without dead ends: 3100 [2018-12-01 19:40:33,358 INFO L631 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 [2018-12-01 19:40:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-12-01 19:40:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2018-12-01 19:40:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-12-01 19:40:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2018-12-01 19:40:33,395 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 250 [2018-12-01 19:40:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:33,395 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2018-12-01 19:40:33,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2018-12-01 19:40:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-01 19:40:33,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:33,398 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:40:33,398 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:33,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:33,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1763285929, now seen corresponding path program 1 times [2018-12-01 19:40:33,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:33,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:33,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:33,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:33,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-01 19:40:33,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:33,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:33,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:33,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:33,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:33,440 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2018-12-01 19:40:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:33,536 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2018-12-01 19:40:33,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:33,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-12-01 19:40:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:33,542 INFO L225 Difference]: With dead ends: 6484 [2018-12-01 19:40:33,542 INFO L226 Difference]: Without dead ends: 3398 [2018-12-01 19:40:33,545 INFO L631 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 [2018-12-01 19:40:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-12-01 19:40:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2018-12-01 19:40:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2018-12-01 19:40:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2018-12-01 19:40:33,582 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 250 [2018-12-01 19:40:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:33,582 INFO L480 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2018-12-01 19:40:33,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2018-12-01 19:40:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-12-01 19:40:33,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:33,586 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 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] [2018-12-01 19:40:33,586 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:33,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1165577599, now seen corresponding path program 1 times [2018-12-01 19:40:33,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:33,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:33,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2018-12-01 19:40:33,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:33,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:33,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:33,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:33,646 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2018-12-01 19:40:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:33,764 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2018-12-01 19:40:33,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:33,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2018-12-01 19:40:33,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:33,770 INFO L225 Difference]: With dead ends: 6900 [2018-12-01 19:40:33,770 INFO L226 Difference]: Without dead ends: 3530 [2018-12-01 19:40:33,774 INFO L631 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 [2018-12-01 19:40:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2018-12-01 19:40:33,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2018-12-01 19:40:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-12-01 19:40:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2018-12-01 19:40:33,811 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 274 [2018-12-01 19:40:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:33,812 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2018-12-01 19:40:33,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2018-12-01 19:40:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-01 19:40:33,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:33,816 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:40:33,816 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:33,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash -373875199, now seen corresponding path program 1 times [2018-12-01 19:40:33,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:33,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:33,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-12-01 19:40:33,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:33,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:33,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:33,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:33,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:33,859 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2018-12-01 19:40:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:33,958 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2018-12-01 19:40:33,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:33,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-12-01 19:40:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:33,964 INFO L225 Difference]: With dead ends: 7416 [2018-12-01 19:40:33,964 INFO L226 Difference]: Without dead ends: 3914 [2018-12-01 19:40:33,968 INFO L631 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 [2018-12-01 19:40:33,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2018-12-01 19:40:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2018-12-01 19:40:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-12-01 19:40:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2018-12-01 19:40:34,008 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 285 [2018-12-01 19:40:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:34,009 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2018-12-01 19:40:34,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2018-12-01 19:40:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-12-01 19:40:34,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:34,013 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:40:34,013 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:34,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:34,013 INFO L82 PathProgramCache]: Analyzing trace with hash -233584477, now seen corresponding path program 1 times [2018-12-01 19:40:34,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:34,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:34,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:34,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:34,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-12-01 19:40:34,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:34,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:34,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:34,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:34,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:34,065 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2018-12-01 19:40:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:34,172 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2018-12-01 19:40:34,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:34,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2018-12-01 19:40:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:34,180 INFO L225 Difference]: With dead ends: 8048 [2018-12-01 19:40:34,180 INFO L226 Difference]: Without dead ends: 4234 [2018-12-01 19:40:34,184 INFO L631 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 [2018-12-01 19:40:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2018-12-01 19:40:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2018-12-01 19:40:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-12-01 19:40:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2018-12-01 19:40:34,228 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 299 [2018-12-01 19:40:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:34,229 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2018-12-01 19:40:34,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2018-12-01 19:40:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-01 19:40:34,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:34,232 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:40:34,232 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:34,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:34,232 INFO L82 PathProgramCache]: Analyzing trace with hash -110745964, now seen corresponding path program 1 times [2018-12-01 19:40:34,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:34,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:34,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:34,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:34,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2018-12-01 19:40:34,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:34,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:34,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:34,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:34,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:34,304 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2018-12-01 19:40:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:34,360 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2018-12-01 19:40:34,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:34,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-12-01 19:40:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:34,374 INFO L225 Difference]: With dead ends: 11310 [2018-12-01 19:40:34,374 INFO L226 Difference]: Without dead ends: 7376 [2018-12-01 19:40:34,380 INFO L631 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 [2018-12-01 19:40:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2018-12-01 19:40:34,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2018-12-01 19:40:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2018-12-01 19:40:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2018-12-01 19:40:34,458 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 300 [2018-12-01 19:40:34,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:34,458 INFO L480 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2018-12-01 19:40:34,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2018-12-01 19:40:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-12-01 19:40:34,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:34,463 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:40:34,463 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:34,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:34,464 INFO L82 PathProgramCache]: Analyzing trace with hash 123119806, now seen corresponding path program 1 times [2018-12-01 19:40:34,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:34,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:34,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:34,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:34,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2018-12-01 19:40:34,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:34,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:34,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:34,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:34,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:34,508 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2018-12-01 19:40:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:34,629 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2018-12-01 19:40:34,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:34,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2018-12-01 19:40:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:34,637 INFO L225 Difference]: With dead ends: 14744 [2018-12-01 19:40:34,637 INFO L226 Difference]: Without dead ends: 7382 [2018-12-01 19:40:34,642 INFO L631 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 [2018-12-01 19:40:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-12-01 19:40:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2018-12-01 19:40:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-12-01 19:40:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2018-12-01 19:40:34,710 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 301 [2018-12-01 19:40:34,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:34,710 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2018-12-01 19:40:34,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2018-12-01 19:40:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-12-01 19:40:34,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:34,715 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:40:34,715 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:34,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:34,715 INFO L82 PathProgramCache]: Analyzing trace with hash -994522767, now seen corresponding path program 1 times [2018-12-01 19:40:34,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:34,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:34,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:34,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:34,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 637 proven. 14 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-12-01 19:40:34,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 19:40:34,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 19:40:34,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:34,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:40:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2018-12-01 19:40:34,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 19:40:34,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-12-01 19:40:34,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 19:40:34,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 19:40:34,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:40:34,982 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 7 states. [2018-12-01 19:40:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:35,409 INFO L93 Difference]: Finished difference Result 18408 states and 23982 transitions. [2018-12-01 19:40:35,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 19:40:35,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 324 [2018-12-01 19:40:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:35,427 INFO L225 Difference]: With dead ends: 18408 [2018-12-01 19:40:35,427 INFO L226 Difference]: Without dead ends: 11034 [2018-12-01 19:40:35,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-01 19:40:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2018-12-01 19:40:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2018-12-01 19:40:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2018-12-01 19:40:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2018-12-01 19:40:35,581 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 324 [2018-12-01 19:40:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:35,581 INFO L480 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2018-12-01 19:40:35,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 19:40:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2018-12-01 19:40:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-12-01 19:40:35,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:35,587 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:40:35,587 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:35,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:35,587 INFO L82 PathProgramCache]: Analyzing trace with hash 233855425, now seen corresponding path program 1 times [2018-12-01 19:40:35,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:35,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:35,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:35,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:35,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 714 proven. 5 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2018-12-01 19:40:35,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 19:40:35,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 19:40:35,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:35,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:40:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2018-12-01 19:40:35,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 19:40:35,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-01 19:40:35,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 19:40:35,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 19:40:35,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:40:35,820 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 5 states. [2018-12-01 19:40:36,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:36,129 INFO L93 Difference]: Finished difference Result 18172 states and 23218 transitions. [2018-12-01 19:40:36,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 19:40:36,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 350 [2018-12-01 19:40:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:36,139 INFO L225 Difference]: With dead ends: 18172 [2018-12-01 19:40:36,139 INFO L226 Difference]: Without dead ends: 9722 [2018-12-01 19:40:36,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 19:40:36,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9722 states. [2018-12-01 19:40:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9722 to 7983. [2018-12-01 19:40:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7983 states. [2018-12-01 19:40:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 9971 transitions. [2018-12-01 19:40:36,248 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 9971 transitions. Word has length 350 [2018-12-01 19:40:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:36,248 INFO L480 AbstractCegarLoop]: Abstraction has 7983 states and 9971 transitions. [2018-12-01 19:40:36,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 19:40:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 9971 transitions. [2018-12-01 19:40:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-12-01 19:40:36,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:36,255 INFO L402 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, 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] [2018-12-01 19:40:36,255 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:36,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:36,255 INFO L82 PathProgramCache]: Analyzing trace with hash 675475598, now seen corresponding path program 1 times [2018-12-01 19:40:36,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:36,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:36,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:36,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:36,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-12-01 19:40:36,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 19:40:36,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 19:40:36,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 19:40:36,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 19:40:36,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 19:40:36,348 INFO L87 Difference]: Start difference. First operand 7983 states and 9971 transitions. Second operand 3 states. [2018-12-01 19:40:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:36,478 INFO L93 Difference]: Finished difference Result 15357 states and 18836 transitions. [2018-12-01 19:40:36,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 19:40:36,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2018-12-01 19:40:36,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:36,483 INFO L225 Difference]: With dead ends: 15357 [2018-12-01 19:40:36,483 INFO L226 Difference]: Without dead ends: 3807 [2018-12-01 19:40:36,490 INFO L631 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 [2018-12-01 19:40:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2018-12-01 19:40:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 3549. [2018-12-01 19:40:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2018-12-01 19:40:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4386 transitions. [2018-12-01 19:40:36,526 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4386 transitions. Word has length 420 [2018-12-01 19:40:36,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:36,526 INFO L480 AbstractCegarLoop]: Abstraction has 3549 states and 4386 transitions. [2018-12-01 19:40:36,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 19:40:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4386 transitions. [2018-12-01 19:40:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-12-01 19:40:36,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 19:40:36,531 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 19:40:36,531 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 19:40:36,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 19:40:36,531 INFO L82 PathProgramCache]: Analyzing trace with hash 331734252, now seen corresponding path program 1 times [2018-12-01 19:40:36,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 19:40:36,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 19:40:36,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:36,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:36,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 19:40:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-12-01 19:40:36,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 19:40:36,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 19:40:36,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 19:40:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 19:40:36,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 19:40:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-12-01 19:40:36,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 19:40:36,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-01 19:40:36,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 19:40:36,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 19:40:36,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 19:40:36,856 INFO L87 Difference]: Start difference. First operand 3549 states and 4386 transitions. Second operand 4 states. [2018-12-01 19:40:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 19:40:36,959 INFO L93 Difference]: Finished difference Result 4045 states and 5011 transitions. [2018-12-01 19:40:36,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 19:40:36,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 487 [2018-12-01 19:40:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 19:40:36,960 INFO L225 Difference]: With dead ends: 4045 [2018-12-01 19:40:36,960 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 19:40:36,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 19:40:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 19:40:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 19:40:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 19:40:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 19:40:36,965 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 487 [2018-12-01 19:40:36,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 19:40:36,966 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 19:40:36,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 19:40:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 19:40:36,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 19:40:36,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 19:40:36,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:36,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:36,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:36,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:36,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:36,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,269 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 390 DAG size of output: 100 [2018-12-01 19:40:37,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 19:40:37,944 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2018-12-01 19:40:37,960 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-01 19:40:37,960 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 19:40:37,960 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-12-01 19:40:37,960 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-12-01 19:40:37,961 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-12-01 19:40:37,961 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-12-01 19:40:37,961 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-12-01 19:40:37,961 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-12-01 19:40:37,961 INFO L444 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-12-01 19:40:37,961 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2018-12-01 19:40:37,961 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-12-01 19:40:37,961 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-12-01 19:40:37,961 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-12-01 19:40:37,961 INFO L448 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-12-01 19:40:37,961 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-12-01 19:40:37,962 INFO L448 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-12-01 19:40:37,962 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-12-01 19:40:37,962 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-12-01 19:40:37,962 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-12-01 19:40:37,962 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-12-01 19:40:37,962 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-12-01 19:40:37,962 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-12-01 19:40:37,962 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-12-01 19:40:37,962 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-12-01 19:40:37,962 INFO L448 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-12-01 19:40:37,962 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-12-01 19:40:37,962 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-12-01 19:40:37,963 INFO L444 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0)) [2018-12-01 19:40:37,963 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-12-01 19:40:37,963 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-12-01 19:40:37,963 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-12-01 19:40:37,963 INFO L444 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-12-01 19:40:37,963 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-12-01 19:40:37,963 INFO L448 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-12-01 19:40:37,963 INFO L451 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-12-01 19:40:37,963 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-12-01 19:40:37,963 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-12-01 19:40:37,963 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-12-01 19:40:37,972 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2018-12-01 19:40:37,972 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-12-01 19:40:37,972 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-12-01 19:40:37,972 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-12-01 19:40:37,972 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-12-01 19:40:37,972 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-12-01 19:40:37,972 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-12-01 19:40:37,972 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-12-01 19:40:37,972 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-12-01 19:40:37,972 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-12-01 19:40:37,972 INFO L448 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L444 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2018-12-01 19:40:37,973 INFO L448 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L444 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-12-01 19:40:37,974 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560)))) [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L444 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse9 (= ssl3_connect_~s__state~0 4448)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse14 (<= ssl3_connect_~s__state~0 4352)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1) (and .cse3 .cse9 .cse1) (and .cse5 .cse0 .cse1) (and .cse10 .cse6 .cse1) (and .cse11 .cse0 .cse1) (and .cse6 .cse5) (and .cse3 .cse12 .cse1) (and .cse3 .cse7 .cse1 .cse8 .cse13) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse10 .cse3) (and .cse3 .cse1 .cse2) (and .cse6 .cse12) (and .cse11 .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse6 (= ssl3_connect_~s__state~0 4384)) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse14 .cse15) (and (= ssl3_connect_~s__state~0 4416) .cse0 .cse1) (and .cse12 .cse0 .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse3 .cse14 .cse15 .cse1 .cse13) (and .cse4 .cse0 .cse1) (and .cse6 (= ssl3_connect_~s__state~0 4400) .cse1))) [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-12-01 19:40:37,974 INFO L444 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-12-01 19:40:37,975 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-12-01 19:40:37,976 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-12-01 19:40:37,976 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-12-01 19:40:37,976 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-12-01 19:40:37,976 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-12-01 19:40:37,976 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-12-01 19:40:37,976 INFO L448 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-12-01 19:40:37,976 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-12-01 19:40:37,976 INFO L444 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (= ssl3_connect_~s__hit~0 0) .cse1 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2018-12-01 19:40:37,976 INFO L444 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-12-01 19:40:37,976 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-12-01 19:40:37,976 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-12-01 19:40:37,976 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-12-01 19:40:37,976 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-12-01 19:40:37,977 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-12-01 19:40:37,977 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-12-01 19:40:37,977 INFO L448 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-12-01 19:40:37,977 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-12-01 19:40:37,977 INFO L444 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1))) [2018-12-01 19:40:37,977 INFO L444 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) .cse2))) [2018-12-01 19:40:37,977 INFO L448 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-12-01 19:40:37,977 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-12-01 19:40:37,977 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-12-01 19:40:37,977 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-12-01 19:40:37,977 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2018-12-01 19:40:37,978 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-12-01 19:40:37,978 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-12-01 19:40:37,978 INFO L444 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-12-01 19:40:37,978 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-01 19:40:37,978 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-12-01 19:40:37,978 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-12-01 19:40:37,978 INFO L448 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2018-12-01 19:40:37,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 19:40:37,978 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-01 19:40:37,978 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 19:40:37,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 19:40:37,978 INFO L444 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2018-12-01 19:40:37,978 INFO L448 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-12-01 19:40:37,979 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-12-01 19:40:37,979 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-12-01 19:40:37,979 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-12-01 19:40:37,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 07:40:37 BoogieIcfgContainer [2018-12-01 19:40:37,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 19:40:37,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 19:40:37,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 19:40:37,997 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 19:40:37,997 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:40:31" (3/4) ... [2018-12-01 19:40:38,001 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 19:40:38,007 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 19:40:38,007 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-12-01 19:40:38,007 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 19:40:38,014 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-01 19:40:38,014 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-01 19:40:38,015 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 19:40:38,037 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-12-01 19:40:38,037 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-12-01 19:40:38,037 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) [2018-12-01 19:40:38,037 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-12-01 19:40:38,037 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-12-01 19:40:38,038 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-12-01 19:40:38,038 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) [2018-12-01 19:40:38,038 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-12-01 19:40:38,038 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-12-01 19:40:38,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-12-01 19:40:38,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-12-01 19:40:38,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-12-01 19:40:38,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-12-01 19:40:38,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-12-01 19:40:38,039 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-12-01 19:40:38,040 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) [2018-12-01 19:40:38,040 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) [2018-12-01 19:40:38,086 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_30a92c1b-f9b5-4984-a777-74f0cc776039/bin-2019/uautomizer/witness.graphml [2018-12-01 19:40:38,086 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 19:40:38,087 INFO L168 Benchmark]: Toolchain (without parser) took 7384.34 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 822.1 MB). Free memory was 958.7 MB in the beginning and 1.8 GB in the end (delta: -832.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:40:38,087 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:40:38,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 958.7 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2018-12-01 19:40:38,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-01 19:40:38,087 INFO L168 Benchmark]: Boogie Preprocessor took 23.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-01 19:40:38,087 INFO L168 Benchmark]: RCFGBuilder took 334.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2018-12-01 19:40:38,088 INFO L168 Benchmark]: TraceAbstraction took 6713.92 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 686.8 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -711.4 MB). Peak memory consumption was 825.3 MB. Max. memory is 11.5 GB. [2018-12-01 19:40:38,088 INFO L168 Benchmark]: Witness Printer took 89.30 ms. Allocated memory is still 1.9 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 19:40:38,089 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 206.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 958.7 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 334.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6713.92 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 686.8 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -711.4 MB). Peak memory consumption was 825.3 MB. Max. memory is 11.5 GB. * Witness Printer took 89.30 ms. Allocated memory is still 1.9 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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: 189]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 138 locations, 1 error locations. SAFE Result, 6.6s OverallTime, 24 OverallIterations, 18 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 4880 SDtfs, 1922 SDslu, 3221 SDs, 0 SdLazy, 2713 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1248 GetRequests, 1209 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8460occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 5171 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 236 NumberOfFragments, 656 HoareAnnotationTreeSize, 26 FomulaSimplifications, 16403 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1648 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 6189 NumberOfCodeBlocks, 6189 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6162 ConstructedInterpolants, 0 QuantifiedInterpolants, 2319388 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2159 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 21338/21385 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...