./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4189574b2550552a572f663e591e000dc3f42b46 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 00:24:03,823 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 00:24:03,824 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 00:24:03,831 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 00:24:03,831 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 00:24:03,832 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 00:24:03,833 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 00:24:03,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 00:24:03,835 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 00:24:03,835 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 00:24:03,836 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 00:24:03,836 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 00:24:03,836 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 00:24:03,837 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 00:24:03,837 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 00:24:03,837 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 00:24:03,838 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 00:24:03,839 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 00:24:03,840 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 00:24:03,840 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 00:24:03,841 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 00:24:03,842 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 00:24:03,843 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 00:24:03,843 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 00:24:03,844 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 00:24:03,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 00:24:03,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 00:24:03,845 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 00:24:03,845 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 00:24:03,846 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 00:24:03,846 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 00:24:03,846 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 00:24:03,846 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 00:24:03,846 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 00:24:03,847 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 00:24:03,847 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 00:24:03,847 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 00:24:03,854 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 00:24:03,855 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 00:24:03,855 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 00:24:03,855 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 00:24:03,855 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 00:24:03,855 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 00:24:03,856 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 00:24:03,856 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 00:24:03,856 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 00:24:03,856 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 00:24:03,856 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 00:24:03,856 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 00:24:03,856 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 00:24:03,857 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 00:24:03,857 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 00:24:03,857 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 00:24:03,857 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 00:24:03,858 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 00:24:03,858 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 00:24:03,858 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 00:24:03,858 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 00:24:03,858 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 00:24:03,858 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 00:24:03,859 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 00:24:03,859 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 00:24:03,859 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 00:24:03,859 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 00:24:03,859 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 00:24:03,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 00:24:03,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 00:24:03,859 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 00:24:03,859 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 00:24:03,860 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 00:24:03,860 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 00:24:03,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 00:24:03,860 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 00:24:03,860 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4189574b2550552a572f663e591e000dc3f42b46 [2018-12-03 00:24:03,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 00:24:03,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 00:24:03,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 00:24:03,896 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 00:24:03,896 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 00:24:03,897 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-12-03 00:24:03,933 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/data/36035d027/13497347e40d4c06b6f57e0642354433/FLAG73b38a574 [2018-12-03 00:24:04,265 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 00:24:04,265 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-12-03 00:24:04,270 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/data/36035d027/13497347e40d4c06b6f57e0642354433/FLAG73b38a574 [2018-12-03 00:24:04,664 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/data/36035d027/13497347e40d4c06b6f57e0642354433 [2018-12-03 00:24:04,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 00:24:04,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 00:24:04,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 00:24:04,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 00:24:04,671 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 00:24:04,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:24:04" (1/1) ... [2018-12-03 00:24:04,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1d255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04, skipping insertion in model container [2018-12-03 00:24:04,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:24:04" (1/1) ... [2018-12-03 00:24:04,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 00:24:04,702 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 00:24:04,815 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:24:04,817 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 00:24:04,847 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:24:04,886 INFO L195 MainTranslator]: Completed translation [2018-12-03 00:24:04,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04 WrapperNode [2018-12-03 00:24:04,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 00:24:04,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 00:24:04,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 00:24:04,887 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 00:24:04,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04" (1/1) ... [2018-12-03 00:24:04,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04" (1/1) ... [2018-12-03 00:24:04,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 00:24:04,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 00:24:04,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 00:24:04,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 00:24:04,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04" (1/1) ... [2018-12-03 00:24:04,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04" (1/1) ... [2018-12-03 00:24:04,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04" (1/1) ... [2018-12-03 00:24:04,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04" (1/1) ... [2018-12-03 00:24:04,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04" (1/1) ... [2018-12-03 00:24:04,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04" (1/1) ... [2018-12-03 00:24:04,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04" (1/1) ... [2018-12-03 00:24:04,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 00:24:04,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 00:24:04,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 00:24:04,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 00:24:04,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/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-03 00:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 00:24:04,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 00:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-03 00:24:04,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-03 00:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 00:24:04,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 00:24:04,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 00:24:04,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 00:24:05,032 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 00:24:05,033 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 00:24:05,260 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 00:24:05,260 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 00:24:05,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:24:05 BoogieIcfgContainer [2018-12-03 00:24:05,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 00:24:05,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 00:24:05,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 00:24:05,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 00:24:05,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 12:24:04" (1/3) ... [2018-12-03 00:24:05,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485b69d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:24:05, skipping insertion in model container [2018-12-03 00:24:05,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:24:04" (2/3) ... [2018-12-03 00:24:05,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485b69d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:24:05, skipping insertion in model container [2018-12-03 00:24:05,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:24:05" (3/3) ... [2018-12-03 00:24:05,265 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-12-03 00:24:05,271 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 00:24:05,275 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 00:24:05,288 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 00:24:05,311 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 00:24:05,311 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 00:24:05,312 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 00:24:05,312 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 00:24:05,312 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 00:24:05,312 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 00:24:05,312 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 00:24:05,312 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 00:24:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-12-03 00:24:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 00:24:05,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:05,327 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-03 00:24:05,329 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:05,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:05,332 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2018-12-03 00:24:05,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:05,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:05,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:05,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:05,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:05,446 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-03 00:24:05,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:05,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:05,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:05,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:05,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:05,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:05,459 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-12-03 00:24:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:05,520 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-12-03 00:24:05,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:05,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-03 00:24:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:05,531 INFO L225 Difference]: With dead ends: 377 [2018-12-03 00:24:05,531 INFO L226 Difference]: Without dead ends: 220 [2018-12-03 00:24:05,534 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-03 00:24:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-03 00:24:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-12-03 00:24:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-03 00:24:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-12-03 00:24:05,575 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2018-12-03 00:24:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:05,575 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-12-03 00:24:05,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-12-03 00:24:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 00:24:05,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:05,577 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-03 00:24:05,577 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:05,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2018-12-03 00:24:05,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:05,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:05,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:05,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:05,624 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-03 00:24:05,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:05,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:05,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:05,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:05,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:05,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:05,626 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-12-03 00:24:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:05,704 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2018-12-03 00:24:05,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:05,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-03 00:24:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:05,705 INFO L225 Difference]: With dead ends: 470 [2018-12-03 00:24:05,705 INFO L226 Difference]: Without dead ends: 262 [2018-12-03 00:24:05,706 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-03 00:24:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-03 00:24:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2018-12-03 00:24:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-03 00:24:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2018-12-03 00:24:05,715 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2018-12-03 00:24:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:05,716 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2018-12-03 00:24:05,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2018-12-03 00:24:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 00:24:05,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:05,717 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-03 00:24:05,717 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:05,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:05,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1578262845, now seen corresponding path program 1 times [2018-12-03 00:24:05,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:05,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:05,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:05,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:05,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:05,751 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-03 00:24:05,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:05,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:05,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:05,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:05,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:05,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:05,752 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2018-12-03 00:24:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:05,872 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-12-03 00:24:05,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:05,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-03 00:24:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:05,875 INFO L225 Difference]: With dead ends: 598 [2018-12-03 00:24:05,875 INFO L226 Difference]: Without dead ends: 354 [2018-12-03 00:24:05,876 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-03 00:24:05,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-03 00:24:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2018-12-03 00:24:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-12-03 00:24:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2018-12-03 00:24:05,889 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2018-12-03 00:24:05,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:05,889 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2018-12-03 00:24:05,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2018-12-03 00:24:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 00:24:05,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:05,891 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-03 00:24:05,891 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:05,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash -227175489, now seen corresponding path program 1 times [2018-12-03 00:24:05,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:05,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:05,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:05,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:05,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:05,930 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-03 00:24:05,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:05,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:05,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:05,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:05,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:05,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:05,932 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2018-12-03 00:24:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:06,017 INFO L93 Difference]: Finished difference Result 710 states and 1008 transitions. [2018-12-03 00:24:06,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:06,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-03 00:24:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:06,018 INFO L225 Difference]: With dead ends: 710 [2018-12-03 00:24:06,018 INFO L226 Difference]: Without dead ends: 386 [2018-12-03 00:24:06,019 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-03 00:24:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-03 00:24:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 374. [2018-12-03 00:24:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-12-03 00:24:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-12-03 00:24:06,027 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2018-12-03 00:24:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:06,027 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-12-03 00:24:06,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-12-03 00:24:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 00:24:06,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:06,029 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-03 00:24:06,029 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:06,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:06,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1103228957, now seen corresponding path program 1 times [2018-12-03 00:24:06,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:06,052 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-03 00:24:06,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:06,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:06,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:06,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:06,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:06,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:06,053 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-12-03 00:24:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:06,168 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2018-12-03 00:24:06,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:06,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-03 00:24:06,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:06,169 INFO L225 Difference]: With dead ends: 842 [2018-12-03 00:24:06,170 INFO L226 Difference]: Without dead ends: 478 [2018-12-03 00:24:06,170 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-03 00:24:06,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-12-03 00:24:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2018-12-03 00:24:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-12-03 00:24:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2018-12-03 00:24:06,180 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2018-12-03 00:24:06,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:06,180 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2018-12-03 00:24:06,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2018-12-03 00:24:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 00:24:06,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:06,181 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-03 00:24:06,181 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:06,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:06,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1629529054, now seen corresponding path program 1 times [2018-12-03 00:24:06,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:06,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:06,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:06,211 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-03 00:24:06,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:06,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:06,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:06,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:06,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:06,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:06,212 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2018-12-03 00:24:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:06,294 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2018-12-03 00:24:06,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:06,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-03 00:24:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:06,296 INFO L225 Difference]: With dead ends: 940 [2018-12-03 00:24:06,296 INFO L226 Difference]: Without dead ends: 500 [2018-12-03 00:24:06,297 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-03 00:24:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-12-03 00:24:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2018-12-03 00:24:06,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-12-03 00:24:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2018-12-03 00:24:06,309 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2018-12-03 00:24:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:06,309 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2018-12-03 00:24:06,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2018-12-03 00:24:06,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 00:24:06,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:06,311 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-03 00:24:06,311 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:06,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:06,312 INFO L82 PathProgramCache]: Analyzing trace with hash -233915046, now seen corresponding path program 1 times [2018-12-03 00:24:06,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:06,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:06,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:06,346 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-03 00:24:06,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:06,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:06,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:06,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:06,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:06,347 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2018-12-03 00:24:06,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:06,372 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2018-12-03 00:24:06,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:06,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-12-03 00:24:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:06,374 INFO L225 Difference]: With dead ends: 976 [2018-12-03 00:24:06,374 INFO L226 Difference]: Without dead ends: 734 [2018-12-03 00:24:06,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-03 00:24:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-03 00:24:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-12-03 00:24:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-12-03 00:24:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2018-12-03 00:24:06,384 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2018-12-03 00:24:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:06,385 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2018-12-03 00:24:06,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2018-12-03 00:24:06,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 00:24:06,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:06,386 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-03 00:24:06,386 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:06,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:06,386 INFO L82 PathProgramCache]: Analyzing trace with hash -674483159, now seen corresponding path program 1 times [2018-12-03 00:24:06,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:06,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:06,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:06,410 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-03 00:24:06,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:06,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:06,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:06,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:06,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:06,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:06,410 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2018-12-03 00:24:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:06,435 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2018-12-03 00:24:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:06,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-03 00:24:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:06,439 INFO L225 Difference]: With dead ends: 976 [2018-12-03 00:24:06,440 INFO L226 Difference]: Without dead ends: 974 [2018-12-03 00:24:06,440 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-03 00:24:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-12-03 00:24:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2018-12-03 00:24:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-12-03 00:24:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2018-12-03 00:24:06,461 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2018-12-03 00:24:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:06,462 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2018-12-03 00:24:06,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2018-12-03 00:24:06,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 00:24:06,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:06,464 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:06,464 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:06,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:06,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2095197958, now seen corresponding path program 1 times [2018-12-03 00:24:06,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:06,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:06,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 00:24:06,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:06,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:06,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:06,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:06,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:06,503 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2018-12-03 00:24:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:06,612 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2018-12-03 00:24:06,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:06,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-12-03 00:24:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:06,615 INFO L225 Difference]: With dead ends: 2140 [2018-12-03 00:24:06,615 INFO L226 Difference]: Without dead ends: 1170 [2018-12-03 00:24:06,616 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-03 00:24:06,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-12-03 00:24:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2018-12-03 00:24:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-12-03 00:24:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2018-12-03 00:24:06,632 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 139 [2018-12-03 00:24:06,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:06,632 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2018-12-03 00:24:06,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2018-12-03 00:24:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 00:24:06,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:06,634 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:06,634 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:06,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:06,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2111242741, now seen corresponding path program 1 times [2018-12-03 00:24:06,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:06,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:06,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-03 00:24:06,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:06,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:06,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:06,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:06,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:06,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:06,677 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2018-12-03 00:24:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:06,758 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2018-12-03 00:24:06,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:06,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-12-03 00:24:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:06,762 INFO L225 Difference]: With dead ends: 2354 [2018-12-03 00:24:06,762 INFO L226 Difference]: Without dead ends: 1236 [2018-12-03 00:24:06,764 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-03 00:24:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-12-03 00:24:06,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2018-12-03 00:24:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-12-03 00:24:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2018-12-03 00:24:06,795 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 175 [2018-12-03 00:24:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:06,795 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2018-12-03 00:24:06,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2018-12-03 00:24:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-03 00:24:06,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:06,797 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:06,797 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:06,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:06,797 INFO L82 PathProgramCache]: Analyzing trace with hash 834252520, now seen corresponding path program 1 times [2018-12-03 00:24:06,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-12-03 00:24:06,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:06,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:06,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:06,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:06,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:06,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:06,831 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2018-12-03 00:24:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:06,928 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2018-12-03 00:24:06,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:06,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2018-12-03 00:24:06,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:06,932 INFO L225 Difference]: With dead ends: 2544 [2018-12-03 00:24:06,932 INFO L226 Difference]: Without dead ends: 1334 [2018-12-03 00:24:06,934 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-03 00:24:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-12-03 00:24:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2018-12-03 00:24:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-12-03 00:24:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2018-12-03 00:24:06,962 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 196 [2018-12-03 00:24:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:06,963 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2018-12-03 00:24:06,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2018-12-03 00:24:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-03 00:24:06,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:06,966 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:06,966 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:06,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:06,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1654542421, now seen corresponding path program 1 times [2018-12-03 00:24:06,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:06,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:06,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:06,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-03 00:24:07,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:07,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:07,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:07,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:07,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:07,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:07,027 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2018-12-03 00:24:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:07,122 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2018-12-03 00:24:07,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:07,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-12-03 00:24:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:07,127 INFO L225 Difference]: With dead ends: 2752 [2018-12-03 00:24:07,127 INFO L226 Difference]: Without dead ends: 1442 [2018-12-03 00:24:07,129 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-03 00:24:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-12-03 00:24:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2018-12-03 00:24:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-12-03 00:24:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2018-12-03 00:24:07,159 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 220 [2018-12-03 00:24:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:07,159 INFO L480 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2018-12-03 00:24:07,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2018-12-03 00:24:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-03 00:24:07,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:07,163 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:07,163 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:07,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:07,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1609383977, now seen corresponding path program 1 times [2018-12-03 00:24:07,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:07,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:07,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:07,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:07,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-03 00:24:07,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:07,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:07,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:07,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:07,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:07,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:07,215 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2018-12-03 00:24:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:07,325 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2018-12-03 00:24:07,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:07,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-12-03 00:24:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:07,330 INFO L225 Difference]: With dead ends: 2992 [2018-12-03 00:24:07,330 INFO L226 Difference]: Without dead ends: 1570 [2018-12-03 00:24:07,332 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-03 00:24:07,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-12-03 00:24:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2018-12-03 00:24:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-12-03 00:24:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2018-12-03 00:24:07,356 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 220 [2018-12-03 00:24:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:07,356 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2018-12-03 00:24:07,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2018-12-03 00:24:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-03 00:24:07,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:07,359 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:07,359 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:07,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:07,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1500640469, now seen corresponding path program 1 times [2018-12-03 00:24:07,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:07,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:07,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:07,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:07,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 00:24:07,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:07,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:07,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:07,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:07,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:07,413 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2018-12-03 00:24:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:07,442 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2018-12-03 00:24:07,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:07,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-12-03 00:24:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:07,447 INFO L225 Difference]: With dead ends: 4646 [2018-12-03 00:24:07,448 INFO L226 Difference]: Without dead ends: 3100 [2018-12-03 00:24:07,449 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-03 00:24:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-12-03 00:24:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2018-12-03 00:24:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-12-03 00:24:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2018-12-03 00:24:07,482 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 250 [2018-12-03 00:24:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:07,483 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2018-12-03 00:24:07,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2018-12-03 00:24:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-03 00:24:07,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:07,486 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:07,486 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:07,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:07,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1763285929, now seen corresponding path program 1 times [2018-12-03 00:24:07,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:07,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:07,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:07,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:07,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-03 00:24:07,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:07,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:07,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:07,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:07,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:07,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:07,537 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2018-12-03 00:24:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:07,631 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2018-12-03 00:24:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:07,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-12-03 00:24:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:07,636 INFO L225 Difference]: With dead ends: 6484 [2018-12-03 00:24:07,637 INFO L226 Difference]: Without dead ends: 3398 [2018-12-03 00:24:07,640 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-03 00:24:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-12-03 00:24:07,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2018-12-03 00:24:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2018-12-03 00:24:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2018-12-03 00:24:07,675 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 250 [2018-12-03 00:24:07,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:07,676 INFO L480 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2018-12-03 00:24:07,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:07,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2018-12-03 00:24:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-12-03 00:24:07,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:07,680 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:07,680 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:07,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:07,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1165577599, now seen corresponding path program 1 times [2018-12-03 00:24:07,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:07,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:07,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:07,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2018-12-03 00:24:07,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:07,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:07,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:07,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:07,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:07,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:07,744 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2018-12-03 00:24:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:07,849 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2018-12-03 00:24:07,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:07,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2018-12-03 00:24:07,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:07,855 INFO L225 Difference]: With dead ends: 6900 [2018-12-03 00:24:07,855 INFO L226 Difference]: Without dead ends: 3530 [2018-12-03 00:24:07,859 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-03 00:24:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2018-12-03 00:24:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2018-12-03 00:24:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-12-03 00:24:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2018-12-03 00:24:07,897 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 274 [2018-12-03 00:24:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:07,897 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2018-12-03 00:24:07,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:07,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2018-12-03 00:24:07,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-03 00:24:07,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:07,901 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:07,901 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:07,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:07,902 INFO L82 PathProgramCache]: Analyzing trace with hash -373875199, now seen corresponding path program 1 times [2018-12-03 00:24:07,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:07,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:07,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:07,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:07,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-12-03 00:24:07,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:07,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:07,957 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:07,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:07,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:07,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:07,958 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2018-12-03 00:24:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:08,112 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2018-12-03 00:24:08,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:08,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-12-03 00:24:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:08,119 INFO L225 Difference]: With dead ends: 7416 [2018-12-03 00:24:08,119 INFO L226 Difference]: Without dead ends: 3914 [2018-12-03 00:24:08,122 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-03 00:24:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2018-12-03 00:24:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2018-12-03 00:24:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-12-03 00:24:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2018-12-03 00:24:08,160 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 285 [2018-12-03 00:24:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:08,161 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2018-12-03 00:24:08,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2018-12-03 00:24:08,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-12-03 00:24:08,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:08,165 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:08,165 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:08,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:08,165 INFO L82 PathProgramCache]: Analyzing trace with hash -233584477, now seen corresponding path program 1 times [2018-12-03 00:24:08,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:08,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:08,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:08,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:08,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-12-03 00:24:08,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:08,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:08,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:08,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:08,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:08,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:08,261 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2018-12-03 00:24:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:08,410 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2018-12-03 00:24:08,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:08,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2018-12-03 00:24:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:08,416 INFO L225 Difference]: With dead ends: 8048 [2018-12-03 00:24:08,417 INFO L226 Difference]: Without dead ends: 4234 [2018-12-03 00:24:08,420 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-03 00:24:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2018-12-03 00:24:08,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2018-12-03 00:24:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-12-03 00:24:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2018-12-03 00:24:08,457 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 299 [2018-12-03 00:24:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:08,457 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2018-12-03 00:24:08,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2018-12-03 00:24:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-03 00:24:08,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:08,460 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:08,460 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:08,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:08,461 INFO L82 PathProgramCache]: Analyzing trace with hash -110745964, now seen corresponding path program 1 times [2018-12-03 00:24:08,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:08,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:08,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:08,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:08,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2018-12-03 00:24:08,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:08,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:08,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:08,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:08,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:08,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:08,523 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2018-12-03 00:24:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:08,564 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2018-12-03 00:24:08,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:08,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-12-03 00:24:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:08,572 INFO L225 Difference]: With dead ends: 11310 [2018-12-03 00:24:08,572 INFO L226 Difference]: Without dead ends: 7376 [2018-12-03 00:24:08,576 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-03 00:24:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2018-12-03 00:24:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2018-12-03 00:24:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2018-12-03 00:24:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2018-12-03 00:24:08,638 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 300 [2018-12-03 00:24:08,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:08,639 INFO L480 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2018-12-03 00:24:08,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2018-12-03 00:24:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-12-03 00:24:08,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:08,644 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:08,644 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:08,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash 123119806, now seen corresponding path program 1 times [2018-12-03 00:24:08,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:08,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:08,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:08,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:08,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2018-12-03 00:24:08,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:08,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:08,717 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:08,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:08,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:08,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:08,718 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2018-12-03 00:24:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:08,843 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2018-12-03 00:24:08,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:08,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2018-12-03 00:24:08,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:08,855 INFO L225 Difference]: With dead ends: 14744 [2018-12-03 00:24:08,855 INFO L226 Difference]: Without dead ends: 7382 [2018-12-03 00:24:08,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-03 00:24:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-12-03 00:24:08,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2018-12-03 00:24:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-12-03 00:24:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2018-12-03 00:24:08,941 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 301 [2018-12-03 00:24:08,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:08,941 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2018-12-03 00:24:08,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:08,941 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2018-12-03 00:24:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-12-03 00:24:08,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:08,946 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:08,946 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:08,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:08,946 INFO L82 PathProgramCache]: Analyzing trace with hash -994522767, now seen corresponding path program 1 times [2018-12-03 00:24:08,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:08,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:08,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:08,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 637 proven. 14 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-12-03 00:24:09,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:24:09,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:24:09,010 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 325 with the following transitions: [2018-12-03 00:24:09,011 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [245], [248], [256], [259], [264], [267], [275], [280], [282], [284], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-03 00:24:09,035 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:24:09,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:24:09,324 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:24:09,324 INFO L272 AbstractInterpreter]: Visited 101 different actions 213 times. Merged at 80 different actions 98 times. Widened at 1 different actions 1 times. Performed 1030 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1030 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 21 fixpoints after 12 different actions. Largest state had 103 variables. [2018-12-03 00:24:09,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:09,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:24:09,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:24:09,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/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-03 00:24:09,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:09,338 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:24:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:09,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:24:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2018-12-03 00:24:09,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:24:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2018-12-03 00:24:09,647 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 00:24:09,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2018-12-03 00:24:09,648 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:09,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:24:09,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:24:09,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-03 00:24:09,649 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 5 states. [2018-12-03 00:24:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:09,865 INFO L93 Difference]: Finished difference Result 14866 states and 19371 transitions. [2018-12-03 00:24:09,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 00:24:09,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 324 [2018-12-03 00:24:09,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:09,873 INFO L225 Difference]: With dead ends: 14866 [2018-12-03 00:24:09,873 INFO L226 Difference]: Without dead ends: 7500 [2018-12-03 00:24:09,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-03 00:24:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7500 states. [2018-12-03 00:24:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7500 to 7356. [2018-12-03 00:24:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2018-12-03 00:24:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2018-12-03 00:24:09,985 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 324 [2018-12-03 00:24:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:09,985 INFO L480 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2018-12-03 00:24:09,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:24:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2018-12-03 00:24:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-12-03 00:24:09,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:09,991 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 00:24:09,991 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:09,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:09,991 INFO L82 PathProgramCache]: Analyzing trace with hash -697717157, now seen corresponding path program 1 times [2018-12-03 00:24:09,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:09,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:09,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:09,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:09,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-12-03 00:24:10,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:24:10,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:24:10,071 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-12-03 00:24:10,071 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [275], [280], [282], [284], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-03 00:24:10,075 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:24:10,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:24:10,364 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:24:10,365 INFO L272 AbstractInterpreter]: Visited 110 different actions 320 times. Merged at 90 different actions 182 times. Never widened. Performed 1664 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1664 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 36 fixpoints after 16 different actions. Largest state had 105 variables. [2018-12-03 00:24:10,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:10,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:24:10,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:24:10,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/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-03 00:24:10,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:10,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:24:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:10,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:24:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-12-03 00:24:10,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:24:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-12-03 00:24:10,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:24:10,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 00:24:10,561 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:24:10,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:24:10,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:24:10,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:24:10,562 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 4 states. [2018-12-03 00:24:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:10,797 INFO L93 Difference]: Finished difference Result 14624 states and 19043 transitions. [2018-12-03 00:24:10,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 00:24:10,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2018-12-03 00:24:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:10,808 INFO L225 Difference]: With dead ends: 14624 [2018-12-03 00:24:10,809 INFO L226 Difference]: Without dead ends: 11034 [2018-12-03 00:24:10,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 00:24:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2018-12-03 00:24:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2018-12-03 00:24:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2018-12-03 00:24:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2018-12-03 00:24:10,925 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 337 [2018-12-03 00:24:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:10,926 INFO L480 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2018-12-03 00:24:10,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:24:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2018-12-03 00:24:10,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-12-03 00:24:10,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:10,932 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:10,932 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:10,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:10,932 INFO L82 PathProgramCache]: Analyzing trace with hash 233855425, now seen corresponding path program 2 times [2018-12-03 00:24:10,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:10,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:10,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:10,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:10,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 714 proven. 5 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2018-12-03 00:24:11,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:24:11,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:24:11,023 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 00:24:11,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 00:24:11,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:24:11,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/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-03 00:24:11,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 00:24:11,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 00:24:11,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 00:24:11,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 00:24:11,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:24:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2018-12-03 00:24:11,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:24:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2018-12-03 00:24:11,238 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 00:24:11,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-12-03 00:24:11,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:11,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:11,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:11,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:24:11,239 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 3 states. [2018-12-03 00:24:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:11,386 INFO L93 Difference]: Finished difference Result 17182 states and 22474 transitions. [2018-12-03 00:24:11,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:11,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2018-12-03 00:24:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:11,394 INFO L225 Difference]: With dead ends: 17182 [2018-12-03 00:24:11,394 INFO L226 Difference]: Without dead ends: 8740 [2018-12-03 00:24:11,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:24:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8740 states. [2018-12-03 00:24:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8740 to 7884. [2018-12-03 00:24:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7884 states. [2018-12-03 00:24:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7884 states to 7884 states and 9925 transitions. [2018-12-03 00:24:11,489 INFO L78 Accepts]: Start accepts. Automaton has 7884 states and 9925 transitions. Word has length 350 [2018-12-03 00:24:11,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:11,489 INFO L480 AbstractCegarLoop]: Abstraction has 7884 states and 9925 transitions. [2018-12-03 00:24:11,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:11,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7884 states and 9925 transitions. [2018-12-03 00:24:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-12-03 00:24:11,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:11,494 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:11,494 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:11,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash -382228618, now seen corresponding path program 1 times [2018-12-03 00:24:11,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:11,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:11,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 00:24:11,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:11,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-03 00:24:11,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:24:11,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:24:11,558 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 382 with the following transitions: [2018-12-03 00:24:11,558 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [250], [256], [259], [264], [267], [269], [275], [280], [282], [284], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-03 00:24:11,560 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:24:11,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:24:11,792 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:24:11,792 INFO L272 AbstractInterpreter]: Visited 112 different actions 342 times. Merged at 93 different actions 197 times. Widened at 1 different actions 1 times. Performed 1778 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1778 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 42 fixpoints after 18 different actions. Largest state had 105 variables. [2018-12-03 00:24:11,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:11,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:24:11,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:24:11,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 00:24:11,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:11,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:24:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:11,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:24:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-03 00:24:11,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:24:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-03 00:24:12,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:24:12,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 00:24:12,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:24:12,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:24:12,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:24:12,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:24:12,005 INFO L87 Difference]: Start difference. First operand 7884 states and 9925 transitions. Second operand 4 states. [2018-12-03 00:24:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:12,187 INFO L93 Difference]: Finished difference Result 17918 states and 22458 transitions. [2018-12-03 00:24:12,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:24:12,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2018-12-03 00:24:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:12,197 INFO L225 Difference]: With dead ends: 17918 [2018-12-03 00:24:12,197 INFO L226 Difference]: Without dead ends: 10044 [2018-12-03 00:24:12,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 00:24:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10044 states. [2018-12-03 00:24:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10044 to 8293. [2018-12-03 00:24:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8293 states. [2018-12-03 00:24:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8293 states to 8293 states and 10415 transitions. [2018-12-03 00:24:12,293 INFO L78 Accepts]: Start accepts. Automaton has 8293 states and 10415 transitions. Word has length 381 [2018-12-03 00:24:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:12,294 INFO L480 AbstractCegarLoop]: Abstraction has 8293 states and 10415 transitions. [2018-12-03 00:24:12,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:24:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 8293 states and 10415 transitions. [2018-12-03 00:24:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-12-03 00:24:12,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:12,299 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:12,299 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:12,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:12,299 INFO L82 PathProgramCache]: Analyzing trace with hash 675475598, now seen corresponding path program 1 times [2018-12-03 00:24:12,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:12,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:12,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:12,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:12,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-12-03 00:24:12,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:24:12,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:24:12,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:24:12,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:24:12,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:24:12,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:24:12,368 INFO L87 Difference]: Start difference. First operand 8293 states and 10415 transitions. Second operand 3 states. [2018-12-03 00:24:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:12,485 INFO L93 Difference]: Finished difference Result 15667 states and 19288 transitions. [2018-12-03 00:24:12,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:24:12,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2018-12-03 00:24:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:12,489 INFO L225 Difference]: With dead ends: 15667 [2018-12-03 00:24:12,490 INFO L226 Difference]: Without dead ends: 3877 [2018-12-03 00:24:12,497 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-03 00:24:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2018-12-03 00:24:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 3643. [2018-12-03 00:24:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2018-12-03 00:24:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4533 transitions. [2018-12-03 00:24:12,537 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4533 transitions. Word has length 420 [2018-12-03 00:24:12,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:12,537 INFO L480 AbstractCegarLoop]: Abstraction has 3643 states and 4533 transitions. [2018-12-03 00:24:12,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:24:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4533 transitions. [2018-12-03 00:24:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-12-03 00:24:12,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:24:12,542 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:24:12,542 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 00:24:12,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash 331734252, now seen corresponding path program 1 times [2018-12-03 00:24:12,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:24:12,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:12,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:12,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:24:12,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:24:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-12-03 00:24:12,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:24:12,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:24:12,687 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 488 with the following transitions: [2018-12-03 00:24:12,687 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [275], [278], [282], [284], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [412], [417], [422], [424], [429], [432], [436], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-03 00:24:12,689 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:24:12,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:24:12,902 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 00:24:12,902 INFO L272 AbstractInterpreter]: Visited 116 different actions 340 times. Merged at 95 different actions 194 times. Never widened. Performed 1782 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1782 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 39 fixpoints after 16 different actions. Largest state had 106 variables. [2018-12-03 00:24:12,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:24:12,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 00:24:12,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:24:12,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 00:24:12,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:24:12,913 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 00:24:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:24:12,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 00:24:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-12-03 00:24:13,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 00:24:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-12-03 00:24:13,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 00:24:13,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 00:24:13,132 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 00:24:13,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:24:13,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:24:13,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:24:13,133 INFO L87 Difference]: Start difference. First operand 3643 states and 4533 transitions. Second operand 4 states. [2018-12-03 00:24:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:24:13,230 INFO L93 Difference]: Finished difference Result 4505 states and 5604 transitions. [2018-12-03 00:24:13,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:24:13,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 487 [2018-12-03 00:24:13,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:24:13,230 INFO L225 Difference]: With dead ends: 4505 [2018-12-03 00:24:13,230 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 00:24:13,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 974 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 00:24:13,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 00:24:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 00:24:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 00:24:13,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 00:24:13,234 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 487 [2018-12-03 00:24:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:24:13,234 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 00:24:13,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:24:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 00:24:13,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 00:24:13,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 00:24:13,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,511 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 410 DAG size of output: 100 [2018-12-03 00:24:13,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:13,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 00:24:14,176 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2018-12-03 00:24:14,197 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-03 00:24:14,197 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 00:24:14,197 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-12-03 00:24:14,197 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-12-03 00:24:14,197 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-12-03 00:24:14,197 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-12-03 00:24:14,197 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-12-03 00:24:14,197 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-12-03 00:24:14,198 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-03 00:24:14,198 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-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-12-03 00:24:14,198 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-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-12-03 00:24:14,198 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-12-03 00:24:14,198 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-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-12-03 00:24:14,199 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-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L451 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-12-03 00:24:14,199 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-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-12-03 00:24:14,199 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-12-03 00:24:14,200 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-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2018-12-03 00:24:14,200 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-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-12-03 00:24:14,200 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-12-03 00:24:14,200 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-03 00:24:14,200 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-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L444 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse9 (= ssl3_connect_~s__state~0 4448)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (<= ssl3_connect_~s__state~0 4352)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 3)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1) (and .cse3 .cse9 .cse1) (and .cse5 .cse0 .cse1) (and .cse10 .cse0 .cse1) (and .cse6 .cse5) (and .cse3 .cse11 .cse1) (and .cse3 .cse7 .cse1 .cse8 .cse12) (and .cse13 .cse6 .cse1) (and .cse3 .cse1 .cse2) (and .cse3 .cse14 .cse15 .cse1 .cse12) (and .cse6 .cse11) (and .cse10 .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse6 (= ssl3_connect_~s__state~0 4384)) (and (= ssl3_connect_~s__state~0 4416) .cse0 .cse1) (and .cse11 .cse0 .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse4 .cse0 .cse1) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse14 .cse15) (and .cse13 .cse3) (<= ssl3_connect_~blastFlag~0 0) (and .cse6 (= ssl3_connect_~s__state~0 4400) .cse1))) [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L444 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2018-12-03 00:24:14,201 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L444 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (= ssl3_connect_~s__hit~0 0) .cse1 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2018-12-03 00:24:14,202 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-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-12-03 00:24:14,202 INFO L444 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1))) [2018-12-03 00:24:14,203 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-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-12-03 00:24:14,203 INFO L444 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~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_~blastFlag~0 2) .cse0 (= ssl3_connect_~s__hit~0 0) .cse1))) [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 00:24:14,203 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L444 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-12-03 00:24:14,203 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-12-03 00:24:14,203 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-12-03 00:24:14,204 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-12-03 00:24:14,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 12:24:14 BoogieIcfgContainer [2018-12-03 00:24:14,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 00:24:14,217 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 00:24:14,217 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 00:24:14,217 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 00:24:14,218 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:24:05" (3/4) ... [2018-12-03 00:24:14,220 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 00:24:14,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 00:24:14,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-12-03 00:24:14,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 00:24:14,229 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-03 00:24:14,229 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-03 00:24:14,230 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 00:24:14,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-12-03 00:24:14,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-12-03 00:24:14,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-12-03 00:24:14,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-12-03 00:24:14,248 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-12-03 00:24:14,248 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-03 00:24:14,248 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 2 && s__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__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || blastFlag <= 0) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) [2018-12-03 00:24:14,248 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-03 00:24:14,248 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-03 00:24:14,248 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-12-03 00:24:14,248 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-03 00:24:14,249 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-03 00:24:14,249 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-03 00:24:14,249 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-03 00:24:14,249 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-03 00:24:14,249 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (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) [2018-12-03 00:24:14,249 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) [2018-12-03 00:24:14,277 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_323e0dce-1e1a-4720-a8de-0841fd59504e/bin-2019/utaipan/witness.graphml [2018-12-03 00:24:14,277 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 00:24:14,277 INFO L168 Benchmark]: Toolchain (without parser) took 9610.43 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 949.7 MB in the beginning and 1.6 GB in the end (delta: -602.1 MB). Peak memory consumption was 518.8 MB. Max. memory is 11.5 GB. [2018-12-03 00:24:14,278 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:24:14,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-12-03 00:24:14,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 00:24:14,278 INFO L168 Benchmark]: Boogie Preprocessor took 21.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 00:24:14,278 INFO L168 Benchmark]: RCFGBuilder took 337.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-12-03 00:24:14,279 INFO L168 Benchmark]: TraceAbstraction took 8955.83 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -514.9 MB). Peak memory consumption was 511.6 MB. Max. memory is 11.5 GB. [2018-12-03 00:24:14,279 INFO L168 Benchmark]: Witness Printer took 59.54 ms. Allocated memory is still 2.2 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:24:14,280 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 218.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 337.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8955.83 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -514.9 MB). Peak memory consumption was 511.6 MB. Max. memory is 11.5 GB. * Witness Printer took 59.54 ms. Allocated memory is still 2.2 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (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) - 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 || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560)) || ((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)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 2 && s__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__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || 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)) || (((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, 8.8s OverallTime, 26 OverallIterations, 18 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 5268 SDtfs, 1896 SDslu, 3170 SDs, 0 SdLazy, 2693 SolverSat, 507 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3843 GetRequests, 3794 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8460occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 6159 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 260 NumberOfFragments, 729 HoareAnnotationTreeSize, 26 FomulaSimplifications, 20414 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2125 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 7625 NumberOfCodeBlocks, 7357 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 9468 ConstructedInterpolants, 0 QuantifiedInterpolants, 3839488 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3136 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 36 InterpolantComputations, 25 PerfectInterpolantSequences, 35016/35134 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...