./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_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_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/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 1236ee922960b2737aa65707c3f9d27b28eaa4fc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 10:06:01,323 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 10:06:01,324 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 10:06:01,330 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 10:06:01,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 10:06:01,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 10:06:01,331 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 10:06:01,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 10:06:01,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 10:06:01,333 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 10:06:01,333 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 10:06:01,333 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 10:06:01,334 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 10:06:01,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 10:06:01,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 10:06:01,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 10:06:01,336 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 10:06:01,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 10:06:01,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 10:06:01,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 10:06:01,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 10:06:01,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 10:06:01,340 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 10:06:01,340 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 10:06:01,341 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 10:06:01,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 10:06:01,342 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 10:06:01,342 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 10:06:01,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 10:06:01,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 10:06:01,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 10:06:01,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 10:06:01,344 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 10:06:01,344 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 10:06:01,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 10:06:01,345 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 10:06:01,345 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 10:06:01,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 10:06:01,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 10:06:01,352 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 10:06:01,352 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 10:06:01,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 10:06:01,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 10:06:01,353 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 10:06:01,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 10:06:01,353 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 10:06:01,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 10:06:01,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 10:06:01,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 10:06:01,354 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 10:06:01,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 10:06:01,354 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 10:06:01,354 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 10:06:01,354 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 10:06:01,355 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 10:06:01,355 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 10:06:01,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 10:06:01,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 10:06:01,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 10:06:01,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 10:06:01,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 10:06:01,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 10:06:01,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 10:06:01,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 10:06:01,356 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 10:06:01,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 10:06:01,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 10:06:01,356 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_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/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 -> 1236ee922960b2737aa65707c3f9d27b28eaa4fc [2018-12-08 10:06:01,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 10:06:01,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 10:06:01,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 10:06:01,387 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 10:06:01,387 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 10:06:01,388 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-12-08 10:06:01,425 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/bin-2019/uautomizer/data/fe27654a9/9b9f2a628b62497faa1a5f7889ce590c/FLAGcdd4e9b16 [2018-12-08 10:06:01,851 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 10:06:01,851 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-12-08 10:06:01,857 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/bin-2019/uautomizer/data/fe27654a9/9b9f2a628b62497faa1a5f7889ce590c/FLAGcdd4e9b16 [2018-12-08 10:06:01,865 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/bin-2019/uautomizer/data/fe27654a9/9b9f2a628b62497faa1a5f7889ce590c [2018-12-08 10:06:01,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 10:06:01,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 10:06:01,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 10:06:01,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 10:06:01,870 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 10:06:01,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:06:01" (1/1) ... [2018-12-08 10:06:01,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650b367b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:01, skipping insertion in model container [2018-12-08 10:06:01,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:06:01" (1/1) ... [2018-12-08 10:06:01,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 10:06:01,895 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 10:06:02,009 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:06:02,011 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 10:06:02,042 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:06:02,079 INFO L195 MainTranslator]: Completed translation [2018-12-08 10:06:02,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:02 WrapperNode [2018-12-08 10:06:02,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 10:06:02,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 10:06:02,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 10:06:02,080 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 10:06:02,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:02" (1/1) ... [2018-12-08 10:06:02,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:02" (1/1) ... [2018-12-08 10:06:02,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 10:06:02,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 10:06:02,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 10:06:02,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 10:06:02,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:02" (1/1) ... [2018-12-08 10:06:02,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:02" (1/1) ... [2018-12-08 10:06:02,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:02" (1/1) ... [2018-12-08 10:06:02,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:02" (1/1) ... [2018-12-08 10:06:02,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:02" (1/1) ... [2018-12-08 10:06:02,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:02" (1/1) ... [2018-12-08 10:06:02,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:02" (1/1) ... [2018-12-08 10:06:02,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 10:06:02,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 10:06:02,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 10:06:02,116 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 10:06:02,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/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-08 10:06:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 10:06:02,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 10:06:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-08 10:06:02,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-08 10:06:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 10:06:02,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 10:06:02,148 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 10:06:02,148 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 10:06:02,219 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 10:06:02,219 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 10:06:02,451 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 10:06:02,451 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 10:06:02,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:06:02 BoogieIcfgContainer [2018-12-08 10:06:02,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 10:06:02,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 10:06:02,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 10:06:02,454 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 10:06:02,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:06:01" (1/3) ... [2018-12-08 10:06:02,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152dadd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:06:02, skipping insertion in model container [2018-12-08 10:06:02,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:06:02" (2/3) ... [2018-12-08 10:06:02,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152dadd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:06:02, skipping insertion in model container [2018-12-08 10:06:02,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:06:02" (3/3) ... [2018-12-08 10:06:02,456 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-12-08 10:06:02,461 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 10:06:02,466 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 10:06:02,474 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 10:06:02,491 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 10:06:02,491 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 10:06:02,491 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 10:06:02,492 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 10:06:02,492 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 10:06:02,492 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 10:06:02,492 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 10:06:02,492 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 10:06:02,492 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 10:06:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-12-08 10:06:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 10:06:02,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:02,508 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-08 10:06:02,509 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:02,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:02,512 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2018-12-08 10:06:02,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:02,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:02,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:02,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:02,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:02,634 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-08 10:06:02,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:02,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:02,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:02,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:02,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:02,651 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-12-08 10:06:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:02,701 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-12-08 10:06:02,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:02,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 10:06:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:02,709 INFO L225 Difference]: With dead ends: 377 [2018-12-08 10:06:02,710 INFO L226 Difference]: Without dead ends: 220 [2018-12-08 10:06:02,712 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-08 10:06:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-08 10:06:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-12-08 10:06:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-08 10:06:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-12-08 10:06:02,742 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2018-12-08 10:06:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:02,742 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-12-08 10:06:02,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-12-08 10:06:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 10:06:02,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:02,743 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-08 10:06:02,744 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:02,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:02,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1426924635, now seen corresponding path program 1 times [2018-12-08 10:06:02,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:02,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:02,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:02,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:02,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:02,777 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-08 10:06:02,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:02,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:02,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:02,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:02,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:02,779 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-12-08 10:06:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:02,875 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2018-12-08 10:06:02,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:02,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-08 10:06:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:02,877 INFO L225 Difference]: With dead ends: 470 [2018-12-08 10:06:02,877 INFO L226 Difference]: Without dead ends: 262 [2018-12-08 10:06:02,879 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-08 10:06:02,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-08 10:06:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2018-12-08 10:06:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-08 10:06:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2018-12-08 10:06:02,892 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2018-12-08 10:06:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:02,892 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2018-12-08 10:06:02,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2018-12-08 10:06:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 10:06:02,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:02,894 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-08 10:06:02,895 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:02,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:02,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1669760968, now seen corresponding path program 1 times [2018-12-08 10:06:02,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:02,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:02,942 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-08 10:06:02,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:02,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:02,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:02,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:02,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:02,943 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2018-12-08 10:06:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:03,075 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-12-08 10:06:03,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:03,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-08 10:06:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:03,077 INFO L225 Difference]: With dead ends: 598 [2018-12-08 10:06:03,077 INFO L226 Difference]: Without dead ends: 354 [2018-12-08 10:06:03,078 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-08 10:06:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-08 10:06:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2018-12-08 10:06:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-12-08 10:06:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2018-12-08 10:06:03,087 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2018-12-08 10:06:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:03,087 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2018-12-08 10:06:03,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2018-12-08 10:06:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 10:06:03,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:03,089 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-08 10:06:03,089 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:03,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:03,089 INFO L82 PathProgramCache]: Analyzing trace with hash 819767994, now seen corresponding path program 1 times [2018-12-08 10:06:03,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:03,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:03,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:03,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:03,118 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-08 10:06:03,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:03,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:03,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:03,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:03,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:03,119 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2018-12-08 10:06:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:03,206 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2018-12-08 10:06:03,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:03,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-08 10:06:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:03,208 INFO L225 Difference]: With dead ends: 708 [2018-12-08 10:06:03,208 INFO L226 Difference]: Without dead ends: 384 [2018-12-08 10:06:03,209 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-08 10:06:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-12-08 10:06:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2018-12-08 10:06:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-12-08 10:06:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-12-08 10:06:03,219 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2018-12-08 10:06:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:03,219 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-12-08 10:06:03,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-12-08 10:06:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 10:06:03,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:03,220 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-08 10:06:03,221 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:03,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:03,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1719879938, now seen corresponding path program 1 times [2018-12-08 10:06:03,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:03,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:03,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:03,256 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-08 10:06:03,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:03,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:03,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:03,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:03,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:03,257 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-12-08 10:06:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:03,371 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2018-12-08 10:06:03,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:03,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-08 10:06:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:03,373 INFO L225 Difference]: With dead ends: 842 [2018-12-08 10:06:03,373 INFO L226 Difference]: Without dead ends: 478 [2018-12-08 10:06:03,374 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-08 10:06:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-12-08 10:06:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2018-12-08 10:06:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-12-08 10:06:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2018-12-08 10:06:03,385 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2018-12-08 10:06:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:03,385 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2018-12-08 10:06:03,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2018-12-08 10:06:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 10:06:03,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:03,387 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-08 10:06:03,387 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:03,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1093696729, now seen corresponding path program 1 times [2018-12-08 10:06:03,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:03,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:03,421 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-08 10:06:03,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:03,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:03,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:03,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:03,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:03,422 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2018-12-08 10:06:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:03,506 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2018-12-08 10:06:03,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:03,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-08 10:06:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:03,508 INFO L225 Difference]: With dead ends: 940 [2018-12-08 10:06:03,508 INFO L226 Difference]: Without dead ends: 500 [2018-12-08 10:06:03,508 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-08 10:06:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-12-08 10:06:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2018-12-08 10:06:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-12-08 10:06:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2018-12-08 10:06:03,519 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2018-12-08 10:06:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:03,520 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2018-12-08 10:06:03,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2018-12-08 10:06:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 10:06:03,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:03,521 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-08 10:06:03,521 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:03,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:03,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1180839903, now seen corresponding path program 1 times [2018-12-08 10:06:03,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:03,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:03,563 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-08 10:06:03,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:03,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:03,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:03,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:03,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:03,565 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2018-12-08 10:06:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:03,595 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2018-12-08 10:06:03,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:03,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-12-08 10:06:03,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:03,597 INFO L225 Difference]: With dead ends: 976 [2018-12-08 10:06:03,597 INFO L226 Difference]: Without dead ends: 734 [2018-12-08 10:06:03,597 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-08 10:06:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-08 10:06:03,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-12-08 10:06:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-12-08 10:06:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2018-12-08 10:06:03,610 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2018-12-08 10:06:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:03,610 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2018-12-08 10:06:03,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2018-12-08 10:06:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 10:06:03,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:03,612 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-08 10:06:03,612 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:03,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:03,612 INFO L82 PathProgramCache]: Analyzing trace with hash 866854985, now seen corresponding path program 1 times [2018-12-08 10:06:03,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:03,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:03,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:03,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:03,647 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-08 10:06:03,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:03,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:03,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:03,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:03,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:03,648 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2018-12-08 10:06:03,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:03,680 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2018-12-08 10:06:03,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:03,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-08 10:06:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:03,683 INFO L225 Difference]: With dead ends: 976 [2018-12-08 10:06:03,684 INFO L226 Difference]: Without dead ends: 974 [2018-12-08 10:06:03,684 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-08 10:06:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-12-08 10:06:03,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2018-12-08 10:06:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-12-08 10:06:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2018-12-08 10:06:03,705 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2018-12-08 10:06:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:03,705 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2018-12-08 10:06:03,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2018-12-08 10:06:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 10:06:03,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:03,708 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:06:03,708 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:03,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:03,708 INFO L82 PathProgramCache]: Analyzing trace with hash -394036509, now seen corresponding path program 1 times [2018-12-08 10:06:03,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:03,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:03,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:03,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-12-08 10:06:03,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:03,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:03,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:03,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:03,751 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2018-12-08 10:06:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:03,858 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2018-12-08 10:06:03,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:03,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-12-08 10:06:03,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:03,861 INFO L225 Difference]: With dead ends: 2140 [2018-12-08 10:06:03,861 INFO L226 Difference]: Without dead ends: 1170 [2018-12-08 10:06:03,863 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-08 10:06:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-12-08 10:06:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2018-12-08 10:06:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-12-08 10:06:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2018-12-08 10:06:03,889 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 168 [2018-12-08 10:06:03,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:03,889 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2018-12-08 10:06:03,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2018-12-08 10:06:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-08 10:06:03,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:03,892 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2018-12-08 10:06:03,892 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:03,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash 531653490, now seen corresponding path program 1 times [2018-12-08 10:06:03,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:03,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:03,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:03,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-08 10:06:03,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:03,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:03,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:03,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:03,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:03,932 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2018-12-08 10:06:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:04,012 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2018-12-08 10:06:04,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:04,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-12-08 10:06:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:04,014 INFO L225 Difference]: With dead ends: 2354 [2018-12-08 10:06:04,015 INFO L226 Difference]: Without dead ends: 1236 [2018-12-08 10:06:04,016 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-08 10:06:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-12-08 10:06:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2018-12-08 10:06:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-12-08 10:06:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2018-12-08 10:06:04,033 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 204 [2018-12-08 10:06:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:04,033 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2018-12-08 10:06:04,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2018-12-08 10:06:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-08 10:06:04,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:04,035 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 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, 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] [2018-12-08 10:06:04,035 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:04,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash -354539531, now seen corresponding path program 1 times [2018-12-08 10:06:04,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:04,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:04,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:04,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:04,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-12-08 10:06:04,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:04,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:04,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:04,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:04,068 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2018-12-08 10:06:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:04,144 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2018-12-08 10:06:04,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:04,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-12-08 10:06:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:04,148 INFO L225 Difference]: With dead ends: 2544 [2018-12-08 10:06:04,148 INFO L226 Difference]: Without dead ends: 1334 [2018-12-08 10:06:04,150 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-08 10:06:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-12-08 10:06:04,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2018-12-08 10:06:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-12-08 10:06:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2018-12-08 10:06:04,178 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 225 [2018-12-08 10:06:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:04,178 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2018-12-08 10:06:04,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2018-12-08 10:06:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-08 10:06:04,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:04,181 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:04,181 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:04,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1874601560, now seen corresponding path program 1 times [2018-12-08 10:06:04,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:04,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:04,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-08 10:06:04,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:04,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:04,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:04,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:04,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:04,238 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2018-12-08 10:06:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:04,343 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2018-12-08 10:06:04,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:04,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-12-08 10:06:04,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:04,346 INFO L225 Difference]: With dead ends: 2752 [2018-12-08 10:06:04,346 INFO L226 Difference]: Without dead ends: 1442 [2018-12-08 10:06:04,348 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-08 10:06:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-12-08 10:06:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2018-12-08 10:06:04,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-12-08 10:06:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2018-12-08 10:06:04,364 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 249 [2018-12-08 10:06:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:04,365 INFO L480 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2018-12-08 10:06:04,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2018-12-08 10:06:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-08 10:06:04,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:04,367 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:04,367 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:04,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:04,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1835594086, now seen corresponding path program 1 times [2018-12-08 10:06:04,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:04,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:04,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:04,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:04,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-08 10:06:04,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:04,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:04,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:04,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:04,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:04,405 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2018-12-08 10:06:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:04,489 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2018-12-08 10:06:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:04,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-12-08 10:06:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:04,492 INFO L225 Difference]: With dead ends: 2992 [2018-12-08 10:06:04,492 INFO L226 Difference]: Without dead ends: 1570 [2018-12-08 10:06:04,494 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-08 10:06:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-12-08 10:06:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2018-12-08 10:06:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-12-08 10:06:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2018-12-08 10:06:04,511 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 249 [2018-12-08 10:06:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:04,511 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2018-12-08 10:06:04,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2018-12-08 10:06:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-08 10:06:04,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:04,514 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:04,514 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:04,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:04,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1915187928, now seen corresponding path program 1 times [2018-12-08 10:06:04,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:04,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:04,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:04,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:04,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-12-08 10:06:04,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:04,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:04,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:04,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:04,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:04,558 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2018-12-08 10:06:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:04,589 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2018-12-08 10:06:04,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:04,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-12-08 10:06:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:04,597 INFO L225 Difference]: With dead ends: 4646 [2018-12-08 10:06:04,597 INFO L226 Difference]: Without dead ends: 3100 [2018-12-08 10:06:04,600 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-08 10:06:04,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-12-08 10:06:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2018-12-08 10:06:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-12-08 10:06:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2018-12-08 10:06:04,632 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 279 [2018-12-08 10:06:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:04,632 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2018-12-08 10:06:04,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2018-12-08 10:06:04,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-08 10:06:04,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:04,636 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:04,637 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:04,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:04,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1795007718, now seen corresponding path program 1 times [2018-12-08 10:06:04,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:04,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:04,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:04,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:04,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-12-08 10:06:04,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:04,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:04,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:04,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:04,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:04,679 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2018-12-08 10:06:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:04,797 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2018-12-08 10:06:04,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:04,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-12-08 10:06:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:04,806 INFO L225 Difference]: With dead ends: 6484 [2018-12-08 10:06:04,806 INFO L226 Difference]: Without dead ends: 3398 [2018-12-08 10:06:04,811 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-08 10:06:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-12-08 10:06:04,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2018-12-08 10:06:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2018-12-08 10:06:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2018-12-08 10:06:04,859 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 279 [2018-12-08 10:06:04,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:04,860 INFO L480 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2018-12-08 10:06:04,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2018-12-08 10:06:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-08 10:06:04,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:04,864 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 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, 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-08 10:06:04,864 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:04,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1052232894, now seen corresponding path program 1 times [2018-12-08 10:06:04,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:04,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:04,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:04,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:04,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2018-12-08 10:06:04,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:04,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:04,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:04,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:04,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:04,922 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2018-12-08 10:06:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:05,027 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2018-12-08 10:06:05,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:05,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-12-08 10:06:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:05,032 INFO L225 Difference]: With dead ends: 6900 [2018-12-08 10:06:05,032 INFO L226 Difference]: Without dead ends: 3530 [2018-12-08 10:06:05,035 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-08 10:06:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2018-12-08 10:06:05,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2018-12-08 10:06:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-12-08 10:06:05,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2018-12-08 10:06:05,069 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 303 [2018-12-08 10:06:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:05,069 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2018-12-08 10:06:05,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:05,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2018-12-08 10:06:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-12-08 10:06:05,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:05,072 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-08 10:06:05,072 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:05,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1022376132, now seen corresponding path program 1 times [2018-12-08 10:06:05,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:05,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:05,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2018-12-08 10:06:05,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:05,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:05,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:05,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:05,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:05,120 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2018-12-08 10:06:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:05,247 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2018-12-08 10:06:05,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:05,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-12-08 10:06:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:05,255 INFO L225 Difference]: With dead ends: 7416 [2018-12-08 10:06:05,255 INFO L226 Difference]: Without dead ends: 3914 [2018-12-08 10:06:05,258 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-08 10:06:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2018-12-08 10:06:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2018-12-08 10:06:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-12-08 10:06:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2018-12-08 10:06:05,292 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 314 [2018-12-08 10:06:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:05,293 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2018-12-08 10:06:05,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2018-12-08 10:06:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-12-08 10:06:05,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:05,296 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:05,296 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:05,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:05,296 INFO L82 PathProgramCache]: Analyzing trace with hash -773017638, now seen corresponding path program 1 times [2018-12-08 10:06:05,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:05,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:05,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:05,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:05,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2018-12-08 10:06:05,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:05,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:05,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:05,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:05,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:05,367 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2018-12-08 10:06:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:05,478 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2018-12-08 10:06:05,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:05,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-12-08 10:06:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:05,485 INFO L225 Difference]: With dead ends: 8048 [2018-12-08 10:06:05,485 INFO L226 Difference]: Without dead ends: 4234 [2018-12-08 10:06:05,488 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-08 10:06:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2018-12-08 10:06:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2018-12-08 10:06:05,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-12-08 10:06:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2018-12-08 10:06:05,524 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 328 [2018-12-08 10:06:05,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:05,524 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2018-12-08 10:06:05,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2018-12-08 10:06:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-12-08 10:06:05,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:05,528 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:05,528 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:05,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash -815480887, now seen corresponding path program 1 times [2018-12-08 10:06:05,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:05,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:05,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:05,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:05,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2018-12-08 10:06:05,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:05,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:05,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:05,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:05,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:05,590 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2018-12-08 10:06:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:05,649 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2018-12-08 10:06:05,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:05,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2018-12-08 10:06:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:05,661 INFO L225 Difference]: With dead ends: 11310 [2018-12-08 10:06:05,661 INFO L226 Difference]: Without dead ends: 7376 [2018-12-08 10:06:05,666 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-08 10:06:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2018-12-08 10:06:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2018-12-08 10:06:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2018-12-08 10:06:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2018-12-08 10:06:05,735 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 329 [2018-12-08 10:06:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:05,735 INFO L480 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2018-12-08 10:06:05,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2018-12-08 10:06:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-12-08 10:06:05,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:05,740 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:05,740 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:05,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:05,740 INFO L82 PathProgramCache]: Analyzing trace with hash 415461791, now seen corresponding path program 1 times [2018-12-08 10:06:05,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:05,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:05,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:05,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:05,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2018-12-08 10:06:05,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:05,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:05,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:05,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:05,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:05,816 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2018-12-08 10:06:05,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:05,957 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2018-12-08 10:06:05,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:05,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-12-08 10:06:05,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:05,966 INFO L225 Difference]: With dead ends: 14744 [2018-12-08 10:06:05,967 INFO L226 Difference]: Without dead ends: 7382 [2018-12-08 10:06:05,973 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-08 10:06:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-12-08 10:06:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2018-12-08 10:06:06,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-12-08 10:06:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2018-12-08 10:06:06,080 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 330 [2018-12-08 10:06:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:06,080 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2018-12-08 10:06:06,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2018-12-08 10:06:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-12-08 10:06:06,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:06,085 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 10:06:06,085 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:06,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:06,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1238161908, now seen corresponding path program 1 times [2018-12-08 10:06:06,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:06,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:06,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:06,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:06,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 874 proven. 10 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2018-12-08 10:06:06,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:06:06,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/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-08 10:06:06,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:06,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:06:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-08 10:06:06,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 10:06:06,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-12-08 10:06:06,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:06:06,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:06:06,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:06:06,314 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 7 states. [2018-12-08 10:06:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:06,683 INFO L93 Difference]: Finished difference Result 18408 states and 23982 transitions. [2018-12-08 10:06:06,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 10:06:06,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 353 [2018-12-08 10:06:06,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:06,699 INFO L225 Difference]: With dead ends: 18408 [2018-12-08 10:06:06,699 INFO L226 Difference]: Without dead ends: 11034 [2018-12-08 10:06:06,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 355 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-08 10:06:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2018-12-08 10:06:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2018-12-08 10:06:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2018-12-08 10:06:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2018-12-08 10:06:06,842 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 353 [2018-12-08 10:06:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:06,843 INFO L480 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2018-12-08 10:06:06,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:06:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2018-12-08 10:06:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-12-08 10:06:06,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:06,849 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:06:06,850 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:06,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1345653892, now seen corresponding path program 1 times [2018-12-08 10:06:06,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:06,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:06,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:06,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:06,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-08 10:06:06,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:06:06,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/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-08 10:06:06,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:07,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:06:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-08 10:06:07,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:06:07,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-08 10:06:07,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:06:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:06:07,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:06:07,082 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 4 states. [2018-12-08 10:06:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:07,325 INFO L93 Difference]: Finished difference Result 19118 states and 24882 transitions. [2018-12-08 10:06:07,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:06:07,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2018-12-08 10:06:07,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:07,335 INFO L225 Difference]: With dead ends: 19118 [2018-12-08 10:06:07,335 INFO L226 Difference]: Without dead ends: 10668 [2018-12-08 10:06:07,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 381 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-08 10:06:07,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2018-12-08 10:06:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 8518. [2018-12-08 10:06:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2018-12-08 10:06:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 10888 transitions. [2018-12-08 10:06:07,465 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 10888 transitions. Word has length 379 [2018-12-08 10:06:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:07,465 INFO L480 AbstractCegarLoop]: Abstraction has 8518 states and 10888 transitions. [2018-12-08 10:06:07,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:06:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 10888 transitions. [2018-12-08 10:06:07,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-12-08 10:06:07,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:07,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:07,470 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:07,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:07,471 INFO L82 PathProgramCache]: Analyzing trace with hash -391768364, now seen corresponding path program 1 times [2018-12-08 10:06:07,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:07,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:07,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:07,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:07,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-12-08 10:06:07,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:06:07,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:06:07,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:06:07,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:06:07,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:06:07,576 INFO L87 Difference]: Start difference. First operand 8518 states and 10888 transitions. Second operand 3 states. [2018-12-08 10:06:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:07,723 INFO L93 Difference]: Finished difference Result 15876 states and 19733 transitions. [2018-12-08 10:06:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:06:07,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2018-12-08 10:06:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:07,728 INFO L225 Difference]: With dead ends: 15876 [2018-12-08 10:06:07,728 INFO L226 Difference]: Without dead ends: 3820 [2018-12-08 10:06:07,736 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-08 10:06:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2018-12-08 10:06:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3610. [2018-12-08 10:06:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3610 states. [2018-12-08 10:06:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4508 transitions. [2018-12-08 10:06:07,778 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 4508 transitions. Word has length 418 [2018-12-08 10:06:07,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:07,778 INFO L480 AbstractCegarLoop]: Abstraction has 3610 states and 4508 transitions. [2018-12-08 10:06:07,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:06:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 4508 transitions. [2018-12-08 10:06:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-12-08 10:06:07,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:06:07,782 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 10:06:07,783 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:06:07,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:06:07,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1077932443, now seen corresponding path program 1 times [2018-12-08 10:06:07,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:06:07,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:06:07,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:07,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:07,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:06:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2018-12-08 10:06:07,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:06:07,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/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-08 10:06:07,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:06:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:06:07,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:06:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2018-12-08 10:06:08,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 10:06:08,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-08 10:06:08,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:06:08,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:06:08,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:06:08,100 INFO L87 Difference]: Start difference. First operand 3610 states and 4508 transitions. Second operand 5 states. [2018-12-08 10:06:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:06:08,232 INFO L93 Difference]: Finished difference Result 4555 states and 5673 transitions. [2018-12-08 10:06:08,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:06:08,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 516 [2018-12-08 10:06:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:06:08,233 INFO L225 Difference]: With dead ends: 4555 [2018-12-08 10:06:08,233 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 10:06:08,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:06:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 10:06:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 10:06:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 10:06:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 10:06:08,236 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 516 [2018-12-08 10:06:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:06:08,237 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:06:08,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:06:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 10:06:08,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 10:06:08,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 10:06:08,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,620 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 429 DAG size of output: 102 [2018-12-08 10:06:08,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:08,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 10:06:09,313 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2018-12-08 10:06:09,344 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-08 10:06:09,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 10:06:09,344 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-12-08 10:06:09,344 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-12-08 10:06:09,344 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-12-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-12-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-12-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-12-08 10:06:09,345 INFO L444 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~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) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2018-12-08 10:06:09,345 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-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-12-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-12-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-12-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-12-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-12-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-12-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-12-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2018-12-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-12-08 10:06:09,345 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-12-08 10:06:09,346 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-12-08 10:06:09,346 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2018-12-08 10:06:09,346 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-12-08 10:06:09,346 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-12-08 10:06:09,346 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-12-08 10:06:09,346 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-12-08 10:06:09,346 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-12-08 10:06:09,346 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-08 10:06:09,346 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-12-08 10:06:09,346 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-12-08 10:06:09,346 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L444 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~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) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L451 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-12-08 10:06:09,347 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-12-08 10:06:09,348 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-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= 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) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-12-08 10:06:09,348 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-12-08 10:06:09,349 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-08 10:06:09,349 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L444 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse6 (= ssl3_connect_~s__state~0 4448)) (.cse10 (not .cse1)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse13 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse14 (= ssl3_connect_~s__state~0 4464)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse7 (<= ssl3_connect_~blastFlag~0 2)) (.cse15 (= ssl3_connect_~s__state~0 4400))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse0 .cse1) (and .cse3 .cse6 .cse1) (and .cse7 .cse8 .cse9 .cse10) (and .cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11 .cse12 .cse10) (and .cse5 .cse0 .cse1) (and .cse13 .cse7 .cse1) (and .cse14 .cse0 .cse1) (and .cse3 .cse15 .cse0 .cse1) (and .cse7 .cse5) (and .cse3 .cse16 .cse1) (and .cse3 .cse8 .cse1 .cse9 .cse17) (and .cse13 .cse3) (and .cse3 .cse1 .cse2) (and .cse7 .cse16) (and .cse14 .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse7 (= ssl3_connect_~s__state~0 4384)) (and (= ssl3_connect_~s__state~0 4416) .cse0 .cse1) (and .cse16 .cse0 .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse3 .cse11 .cse12 .cse1 .cse17) (and .cse4 .cse0 .cse1) (<= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse15 .cse1)))) [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-12-08 10:06:09,349 INFO L444 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-12-08 10:06:09,350 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-12-08 10:06:09,351 INFO L448 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-12-08 10:06:09,351 INFO L444 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 (not .cse1)))) [2018-12-08 10:06:09,351 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-08 10:06:09,351 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-12-08 10:06:09,351 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-12-08 10:06:09,351 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-12-08 10:06:09,351 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-12-08 10:06:09,351 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-12-08 10:06:09,351 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-12-08 10:06:09,351 INFO L448 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-12-08 10:06:09,351 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-12-08 10:06:09,351 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)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2018-12-08 10:06:09,351 INFO L444 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~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) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-12-08 10:06:09,352 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-12-08 10:06:09,352 INFO L444 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse0 (<= 4352 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 (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1))) [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 10:06:09,352 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 10:06:09,352 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 10:06:09,352 INFO L444 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2018-12-08 10:06:09,352 INFO L448 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-12-08 10:06:09,353 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-12-08 10:06:09,353 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-12-08 10:06:09,353 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-12-08 10:06:09,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 10:06:09 BoogieIcfgContainer [2018-12-08 10:06:09,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 10:06:09,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 10:06:09,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 10:06:09,371 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 10:06:09,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:06:02" (3/4) ... [2018-12-08 10:06:09,375 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 10:06:09,380 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 10:06:09,381 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-12-08 10:06:09,381 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 10:06:09,388 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-08 10:06:09,388 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-08 10:06:09,389 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 10:06:09,408 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-12-08 10:06:09,408 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-12-08 10:06:09,409 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-12-08 10:06:09,409 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-12-08 10:06:09,409 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-12-08 10:06:09,409 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) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-12-08 10:06:09,409 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)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(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)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && 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)) || (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)) || ((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 <= 0) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) [2018-12-08 10:06:09,410 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-12-08 10:06:09,410 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-12-08 10:06:09,410 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-12-08 10:06:09,410 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-12-08 10:06:09,410 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-12-08 10:06:09,411 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-12-08 10:06:09,411 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-08 10:06:09,411 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-08 10:06:09,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (blastFlag <= 0 && 4560 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) [2018-12-08 10:06:09,411 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 <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) [2018-12-08 10:06:09,455 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3a2d9ab1-cd4a-45af-b223-5bcffd80351a/bin-2019/uautomizer/witness.graphml [2018-12-08 10:06:09,455 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 10:06:09,456 INFO L168 Benchmark]: Toolchain (without parser) took 7588.52 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 963.6 MB). Free memory was 954.4 MB in the beginning and 1.5 GB in the end (delta: -588.3 MB). Peak memory consumption was 375.4 MB. Max. memory is 11.5 GB. [2018-12-08 10:06:09,456 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:06:09,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-12-08 10:06:09,457 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.03 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-08 10:06:09,457 INFO L168 Benchmark]: Boogie Preprocessor took 21.57 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-08 10:06:09,457 INFO L168 Benchmark]: RCFGBuilder took 335.94 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: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. [2018-12-08 10:06:09,458 INFO L168 Benchmark]: TraceAbstraction took 6918.91 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 834.1 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -494.7 MB). Peak memory consumption was 889.3 MB. Max. memory is 11.5 GB. [2018-12-08 10:06:09,458 INFO L168 Benchmark]: Witness Printer took 83.89 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-12-08 10:06:09,460 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 211.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.03 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 21.57 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 335.94 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: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6918.91 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 834.1 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -494.7 MB). Peak memory consumption was 889.3 MB. Max. memory is 11.5 GB. * Witness Printer took 83.89 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. 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 <= 0 && 4560 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - 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) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((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 <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - 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)) || ((4432 <= s__state && blastFlag <= 0) && 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)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(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)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && 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)) || (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)) || ((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 <= 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)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - 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 <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((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)) || ((4432 <= s__state && blastFlag <= 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.8s OverallTime, 24 OverallIterations, 20 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4971 SDtfs, 1932 SDslu, 3379 SDs, 0 SdLazy, 2650 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1335 GetRequests, 1296 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8518occurred in iteration=22, 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, 5532 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 269 NumberOfFragments, 774 HoareAnnotationTreeSize, 26 FomulaSimplifications, 17828 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1764 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 6709 NumberOfCodeBlocks, 6709 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6682 ConstructedInterpolants, 0 QuantifiedInterpolants, 3264518 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2303 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 26313/26347 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...