./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4189574b2550552a572f663e591e000dc3f42b46 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:49:59,730 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:49:59,736 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:49:59,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:49:59,746 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:49:59,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:49:59,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:49:59,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:49:59,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:49:59,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:49:59,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:49:59,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:49:59,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:49:59,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:49:59,758 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:49:59,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:49:59,760 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:49:59,761 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:49:59,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:49:59,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:49:59,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:49:59,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:49:59,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:49:59,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:49:59,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:49:59,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:49:59,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:49:59,774 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:49:59,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:49:59,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:49:59,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:49:59,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:49:59,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:49:59,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:49:59,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:49:59,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:49:59,780 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 21:49:59,801 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:49:59,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:49:59,802 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:49:59,802 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:49:59,803 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:49:59,804 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:49:59,804 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:49:59,804 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:49:59,804 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:49:59,804 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:49:59,805 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:49:59,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:49:59,805 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:49:59,805 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:49:59,805 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:49:59,805 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:49:59,806 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:49:59,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:49:59,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:49:59,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:49:59,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:49:59,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:49:59,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:49:59,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:49:59,810 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:49:59,810 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:49:59,810 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:49:59,811 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:49:59,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:49:59,811 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4189574b2550552a572f663e591e000dc3f42b46 [2018-10-26 21:49:59,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:49:59,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:49:59,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:49:59,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:49:59,868 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:49:59,869 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-10-26 21:49:59,927 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/data/727c5ad7f/3f3428029c2c43c3a7dd2e13ba1d41d2/FLAG27784ecff [2018-10-26 21:50:00,318 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:50:00,318 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-10-26 21:50:00,342 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/data/727c5ad7f/3f3428029c2c43c3a7dd2e13ba1d41d2/FLAG27784ecff [2018-10-26 21:50:00,367 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/data/727c5ad7f/3f3428029c2c43c3a7dd2e13ba1d41d2 [2018-10-26 21:50:00,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:50:00,373 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:50:00,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:50:00,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:50:00,381 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:50:00,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:50:00" (1/1) ... [2018-10-26 21:50:00,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@893e0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:00, skipping insertion in model container [2018-10-26 21:50:00,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:50:00" (1/1) ... [2018-10-26 21:50:00,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:50:00,447 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:50:00,652 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:50:00,656 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:50:00,713 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:50:00,727 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:50:00,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:00 WrapperNode [2018-10-26 21:50:00,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:50:00,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:50:00,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:50:00,728 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:50:00,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:00" (1/1) ... [2018-10-26 21:50:00,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:00" (1/1) ... [2018-10-26 21:50:00,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:00" (1/1) ... [2018-10-26 21:50:00,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:00" (1/1) ... [2018-10-26 21:50:00,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:00" (1/1) ... [2018-10-26 21:50:00,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:00" (1/1) ... [2018-10-26 21:50:00,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:00" (1/1) ... [2018-10-26 21:50:00,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:50:00,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:50:00,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:50:00,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:50:00,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:50:00,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:50:00,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:50:00,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-10-26 21:50:00,914 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:50:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 21:50:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-10-26 21:50:00,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 21:50:00,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-10-26 21:50:00,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-10-26 21:50:00,916 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-10-26 21:50:00,916 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:50:00,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:50:00,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:50:01,107 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 21:50:01,119 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 21:50:02,056 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:50:02,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:50:02 BoogieIcfgContainer [2018-10-26 21:50:02,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:50:02,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:50:02,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:50:02,062 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:50:02,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:50:00" (1/3) ... [2018-10-26 21:50:02,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd6c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:50:02, skipping insertion in model container [2018-10-26 21:50:02,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:00" (2/3) ... [2018-10-26 21:50:02,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd6c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:50:02, skipping insertion in model container [2018-10-26 21:50:02,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:50:02" (3/3) ... [2018-10-26 21:50:02,071 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-10-26 21:50:02,084 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:50:02,095 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:50:02,118 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:50:02,162 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:50:02,163 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:50:02,163 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:50:02,163 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:50:02,163 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:50:02,164 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:50:02,164 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:50:02,164 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:50:02,165 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:50:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-10-26 21:50:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:50:02,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:02,207 INFO L375 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, 1] [2018-10-26 21:50:02,209 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:02,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash 171574540, now seen corresponding path program 1 times [2018-10-26 21:50:02,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:02,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:02,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:02,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:02,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:50:02,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:02,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:02,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:02,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:02,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:02,532 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-10-26 21:50:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:02,790 INFO L93 Difference]: Finished difference Result 380 states and 637 transitions. [2018-10-26 21:50:02,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:02,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 21:50:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:02,805 INFO L225 Difference]: With dead ends: 380 [2018-10-26 21:50:02,805 INFO L226 Difference]: Without dead ends: 222 [2018-10-26 21:50:02,809 INFO L605 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-10-26 21:50:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-26 21:50:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-10-26 21:50:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-26 21:50:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2018-10-26 21:50:02,872 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 328 transitions. Word has length 30 [2018-10-26 21:50:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:02,872 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 328 transitions. [2018-10-26 21:50:02,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 328 transitions. [2018-10-26 21:50:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:50:02,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:02,875 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-26 21:50:02,875 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:02,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1775768565, now seen corresponding path program 1 times [2018-10-26 21:50:02,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:02,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:02,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:02,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:02,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:50:02,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:02,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:02,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:02,977 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. Second operand 3 states. [2018-10-26 21:50:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:03,428 INFO L93 Difference]: Finished difference Result 476 states and 713 transitions. [2018-10-26 21:50:03,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:03,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-26 21:50:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:03,431 INFO L225 Difference]: With dead ends: 476 [2018-10-26 21:50:03,431 INFO L226 Difference]: Without dead ends: 266 [2018-10-26 21:50:03,433 INFO L605 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-10-26 21:50:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-26 21:50:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2018-10-26 21:50:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-26 21:50:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-10-26 21:50:03,451 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 45 [2018-10-26 21:50:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:03,451 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-10-26 21:50:03,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-10-26 21:50:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 21:50:03,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:03,454 INFO L375 BasicCegarLoop]: trace histogram [3, 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-10-26 21:50:03,454 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:03,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:03,455 INFO L82 PathProgramCache]: Analyzing trace with hash 6279890, now seen corresponding path program 1 times [2018-10-26 21:50:03,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:03,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:03,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:03,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:03,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 21:50:03,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:03,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:03,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:03,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:03,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:03,588 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 3 states. [2018-10-26 21:50:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:04,164 INFO L93 Difference]: Finished difference Result 608 states and 912 transitions. [2018-10-26 21:50:04,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:04,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 21:50:04,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:04,170 INFO L225 Difference]: With dead ends: 608 [2018-10-26 21:50:04,170 INFO L226 Difference]: Without dead ends: 360 [2018-10-26 21:50:04,171 INFO L605 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-10-26 21:50:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-26 21:50:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 342. [2018-10-26 21:50:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-10-26 21:50:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 476 transitions. [2018-10-26 21:50:04,190 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 476 transitions. Word has length 63 [2018-10-26 21:50:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:04,190 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 476 transitions. [2018-10-26 21:50:04,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 476 transitions. [2018-10-26 21:50:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 21:50:04,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:04,193 INFO L375 BasicCegarLoop]: trace histogram [3, 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-10-26 21:50:04,194 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:04,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:04,194 INFO L82 PathProgramCache]: Analyzing trace with hash -127733616, now seen corresponding path program 1 times [2018-10-26 21:50:04,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:04,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:04,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:04,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 21:50:04,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:04,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:04,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:04,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:04,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:04,327 INFO L87 Difference]: Start difference. First operand 342 states and 476 transitions. Second operand 3 states. [2018-10-26 21:50:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:04,580 INFO L93 Difference]: Finished difference Result 724 states and 1022 transitions. [2018-10-26 21:50:04,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:04,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 21:50:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:04,583 INFO L225 Difference]: With dead ends: 724 [2018-10-26 21:50:04,583 INFO L226 Difference]: Without dead ends: 394 [2018-10-26 21:50:04,584 INFO L605 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-10-26 21:50:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-26 21:50:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 382. [2018-10-26 21:50:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-26 21:50:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2018-10-26 21:50:04,617 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 63 [2018-10-26 21:50:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:04,617 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2018-10-26 21:50:04,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2018-10-26 21:50:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 21:50:04,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:04,621 INFO L375 BasicCegarLoop]: trace histogram [4, 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-10-26 21:50:04,622 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:04,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:04,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1202772343, now seen corresponding path program 1 times [2018-10-26 21:50:04,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:04,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:04,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:04,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:04,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 21:50:04,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:04,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:04,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:04,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:04,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:04,733 INFO L87 Difference]: Start difference. First operand 382 states and 526 transitions. Second operand 3 states. [2018-10-26 21:50:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:05,010 INFO L93 Difference]: Finished difference Result 860 states and 1222 transitions. [2018-10-26 21:50:05,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:05,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-26 21:50:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:05,016 INFO L225 Difference]: With dead ends: 860 [2018-10-26 21:50:05,017 INFO L226 Difference]: Without dead ends: 488 [2018-10-26 21:50:05,017 INFO L605 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-10-26 21:50:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-26 21:50:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 462. [2018-10-26 21:50:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-10-26 21:50:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 662 transitions. [2018-10-26 21:50:05,035 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 662 transitions. Word has length 77 [2018-10-26 21:50:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:05,036 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 662 transitions. [2018-10-26 21:50:05,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 662 transitions. [2018-10-26 21:50:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 21:50:05,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:05,040 INFO L375 BasicCegarLoop]: trace histogram [4, 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-10-26 21:50:05,041 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:05,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:05,042 INFO L82 PathProgramCache]: Analyzing trace with hash 145332238, now seen corresponding path program 1 times [2018-10-26 21:50:05,042 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:05,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:05,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:05,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:05,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 21:50:05,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:05,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:05,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:05,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:05,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:05,165 INFO L87 Difference]: Start difference. First operand 462 states and 662 transitions. Second operand 3 states. [2018-10-26 21:50:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:05,406 INFO L93 Difference]: Finished difference Result 962 states and 1387 transitions. [2018-10-26 21:50:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:05,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-10-26 21:50:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:05,415 INFO L225 Difference]: With dead ends: 962 [2018-10-26 21:50:05,416 INFO L226 Difference]: Without dead ends: 512 [2018-10-26 21:50:05,417 INFO L605 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-10-26 21:50:05,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-10-26 21:50:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2018-10-26 21:50:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-10-26 21:50:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 716 transitions. [2018-10-26 21:50:05,441 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 716 transitions. Word has length 81 [2018-10-26 21:50:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:05,441 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 716 transitions. [2018-10-26 21:50:05,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 716 transitions. [2018-10-26 21:50:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 21:50:05,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:05,450 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:50:05,450 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:05,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:05,452 INFO L82 PathProgramCache]: Analyzing trace with hash -718630428, now seen corresponding path program 1 times [2018-10-26 21:50:05,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:05,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:05,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:05,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 21:50:05,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:05,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:05,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:05,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:05,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:05,590 INFO L87 Difference]: Start difference. First operand 506 states and 716 transitions. Second operand 3 states. [2018-10-26 21:50:07,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:07,523 INFO L93 Difference]: Finished difference Result 1106 states and 1590 transitions. [2018-10-26 21:50:07,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:07,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-10-26 21:50:07,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:07,527 INFO L225 Difference]: With dead ends: 1106 [2018-10-26 21:50:07,527 INFO L226 Difference]: Without dead ends: 608 [2018-10-26 21:50:07,529 INFO L605 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-10-26 21:50:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-26 21:50:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 588. [2018-10-26 21:50:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-10-26 21:50:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 816 transitions. [2018-10-26 21:50:07,545 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 816 transitions. Word has length 102 [2018-10-26 21:50:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:07,546 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 816 transitions. [2018-10-26 21:50:07,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2018-10-26 21:50:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 21:50:07,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:07,550 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:50:07,550 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:07,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:07,550 INFO L82 PathProgramCache]: Analyzing trace with hash -852643934, now seen corresponding path program 1 times [2018-10-26 21:50:07,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:07,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:07,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:07,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:07,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 21:50:07,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:07,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:07,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:07,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:07,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:07,648 INFO L87 Difference]: Start difference. First operand 588 states and 816 transitions. Second operand 3 states. [2018-10-26 21:50:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:07,806 INFO L93 Difference]: Finished difference Result 1612 states and 2266 transitions. [2018-10-26 21:50:07,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:07,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-10-26 21:50:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:07,812 INFO L225 Difference]: With dead ends: 1612 [2018-10-26 21:50:07,812 INFO L226 Difference]: Without dead ends: 1036 [2018-10-26 21:50:07,814 INFO L605 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-10-26 21:50:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-10-26 21:50:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2018-10-26 21:50:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-10-26 21:50:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1459 transitions. [2018-10-26 21:50:07,843 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1459 transitions. Word has length 102 [2018-10-26 21:50:07,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:07,844 INFO L481 AbstractCegarLoop]: Abstraction has 1034 states and 1459 transitions. [2018-10-26 21:50:07,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:07,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1459 transitions. [2018-10-26 21:50:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 21:50:07,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:07,846 INFO L375 BasicCegarLoop]: trace histogram [5, 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-10-26 21:50:07,846 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:07,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:07,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1021046662, now seen corresponding path program 1 times [2018-10-26 21:50:07,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:07,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:07,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:07,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 21:50:07,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:07,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:07,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:07,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:07,942 INFO L87 Difference]: Start difference. First operand 1034 states and 1459 transitions. Second operand 3 states. [2018-10-26 21:50:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:08,173 INFO L93 Difference]: Finished difference Result 2056 states and 2912 transitions. [2018-10-26 21:50:08,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:08,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-10-26 21:50:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:08,180 INFO L225 Difference]: With dead ends: 2056 [2018-10-26 21:50:08,181 INFO L226 Difference]: Without dead ends: 1544 [2018-10-26 21:50:08,183 INFO L605 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-10-26 21:50:08,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2018-10-26 21:50:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2018-10-26 21:50:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-10-26 21:50:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2179 transitions. [2018-10-26 21:50:08,224 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2179 transitions. Word has length 102 [2018-10-26 21:50:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:08,225 INFO L481 AbstractCegarLoop]: Abstraction has 1544 states and 2179 transitions. [2018-10-26 21:50:08,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2179 transitions. [2018-10-26 21:50:08,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-26 21:50:08,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:08,229 INFO L375 BasicCegarLoop]: trace histogram [5, 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-10-26 21:50:08,229 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:08,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:08,230 INFO L82 PathProgramCache]: Analyzing trace with hash 152232873, now seen corresponding path program 1 times [2018-10-26 21:50:08,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:08,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:08,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:08,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:08,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 21:50:08,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:08,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:08,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:08,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:08,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:08,342 INFO L87 Difference]: Start difference. First operand 1544 states and 2179 transitions. Second operand 3 states. [2018-10-26 21:50:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:08,645 INFO L93 Difference]: Finished difference Result 2056 states and 2906 transitions. [2018-10-26 21:50:08,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:08,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-10-26 21:50:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:08,652 INFO L225 Difference]: With dead ends: 2056 [2018-10-26 21:50:08,652 INFO L226 Difference]: Without dead ends: 2054 [2018-10-26 21:50:08,653 INFO L605 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-10-26 21:50:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2018-10-26 21:50:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2018-10-26 21:50:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2054 states. [2018-10-26 21:50:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2903 transitions. [2018-10-26 21:50:08,702 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2903 transitions. Word has length 104 [2018-10-26 21:50:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:08,702 INFO L481 AbstractCegarLoop]: Abstraction has 2054 states and 2903 transitions. [2018-10-26 21:50:08,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2903 transitions. [2018-10-26 21:50:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-26 21:50:08,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:08,706 INFO L375 BasicCegarLoop]: trace histogram [7, 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-10-26 21:50:08,706 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:08,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:08,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1773369778, now seen corresponding path program 1 times [2018-10-26 21:50:08,710 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:08,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:08,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:08,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:08,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-26 21:50:08,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:08,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:08,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:08,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:08,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:08,847 INFO L87 Difference]: Start difference. First operand 2054 states and 2903 transitions. Second operand 3 states. [2018-10-26 21:50:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:09,880 INFO L93 Difference]: Finished difference Result 4504 states and 6470 transitions. [2018-10-26 21:50:09,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:09,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-10-26 21:50:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:09,890 INFO L225 Difference]: With dead ends: 4504 [2018-10-26 21:50:09,891 INFO L226 Difference]: Without dead ends: 2446 [2018-10-26 21:50:09,895 INFO L605 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-10-26 21:50:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2018-10-26 21:50:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2334. [2018-10-26 21:50:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2334 states. [2018-10-26 21:50:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3319 transitions. [2018-10-26 21:50:09,957 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3319 transitions. Word has length 146 [2018-10-26 21:50:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:09,957 INFO L481 AbstractCegarLoop]: Abstraction has 2334 states and 3319 transitions. [2018-10-26 21:50:09,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3319 transitions. [2018-10-26 21:50:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-26 21:50:09,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:09,963 INFO L375 BasicCegarLoop]: trace histogram [8, 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-10-26 21:50:09,964 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:09,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:09,964 INFO L82 PathProgramCache]: Analyzing trace with hash -529878549, now seen corresponding path program 1 times [2018-10-26 21:50:09,964 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:09,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:09,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:09,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:09,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-10-26 21:50:10,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:10,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:10,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:10,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:10,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:10,078 INFO L87 Difference]: Start difference. First operand 2334 states and 3319 transitions. Second operand 3 states. [2018-10-26 21:50:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:10,636 INFO L93 Difference]: Finished difference Result 4874 states and 6889 transitions. [2018-10-26 21:50:10,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:10,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-26 21:50:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:10,649 INFO L225 Difference]: With dead ends: 4874 [2018-10-26 21:50:10,650 INFO L226 Difference]: Without dead ends: 2552 [2018-10-26 21:50:10,654 INFO L605 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-10-26 21:50:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-10-26 21:50:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2526. [2018-10-26 21:50:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2526 states. [2018-10-26 21:50:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3551 transitions. [2018-10-26 21:50:10,732 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3551 transitions. Word has length 183 [2018-10-26 21:50:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:10,732 INFO L481 AbstractCegarLoop]: Abstraction has 2526 states and 3551 transitions. [2018-10-26 21:50:10,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:10,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3551 transitions. [2018-10-26 21:50:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-26 21:50:10,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:10,741 INFO L375 BasicCegarLoop]: trace histogram [9, 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-10-26 21:50:10,741 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:10,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:10,741 INFO L82 PathProgramCache]: Analyzing trace with hash -757521861, now seen corresponding path program 1 times [2018-10-26 21:50:10,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:10,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:10,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:10,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:10,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-10-26 21:50:10,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:10,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:10,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:10,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:10,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:10,926 INFO L87 Difference]: Start difference. First operand 2526 states and 3551 transitions. Second operand 3 states. [2018-10-26 21:50:11,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:11,096 INFO L93 Difference]: Finished difference Result 5272 states and 7390 transitions. [2018-10-26 21:50:11,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:11,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-10-26 21:50:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:11,110 INFO L225 Difference]: With dead ends: 5272 [2018-10-26 21:50:11,110 INFO L226 Difference]: Without dead ends: 2758 [2018-10-26 21:50:11,114 INFO L605 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-10-26 21:50:11,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2018-10-26 21:50:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2734. [2018-10-26 21:50:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2018-10-26 21:50:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 3799 transitions. [2018-10-26 21:50:11,182 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 3799 transitions. Word has length 205 [2018-10-26 21:50:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:11,183 INFO L481 AbstractCegarLoop]: Abstraction has 2734 states and 3799 transitions. [2018-10-26 21:50:11,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3799 transitions. [2018-10-26 21:50:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-26 21:50:11,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:11,190 INFO L375 BasicCegarLoop]: trace histogram [10, 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-10-26 21:50:11,190 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:11,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1415964870, now seen corresponding path program 1 times [2018-10-26 21:50:11,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:11,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:11,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:11,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:11,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-10-26 21:50:11,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:11,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:11,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:11,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:11,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:11,323 INFO L87 Difference]: Start difference. First operand 2734 states and 3799 transitions. Second operand 3 states. [2018-10-26 21:50:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:12,101 INFO L93 Difference]: Finished difference Result 5704 states and 7910 transitions. [2018-10-26 21:50:12,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:12,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-26 21:50:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:12,115 INFO L225 Difference]: With dead ends: 5704 [2018-10-26 21:50:12,115 INFO L226 Difference]: Without dead ends: 2982 [2018-10-26 21:50:12,120 INFO L605 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-10-26 21:50:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2018-10-26 21:50:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2966. [2018-10-26 21:50:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2966 states. [2018-10-26 21:50:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 4071 transitions. [2018-10-26 21:50:12,187 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 4071 transitions. Word has length 230 [2018-10-26 21:50:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:12,188 INFO L481 AbstractCegarLoop]: Abstraction has 2966 states and 4071 transitions. [2018-10-26 21:50:12,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 4071 transitions. [2018-10-26 21:50:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-26 21:50:12,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:12,196 INFO L375 BasicCegarLoop]: trace histogram [10, 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-10-26 21:50:12,196 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:12,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash 845608380, now seen corresponding path program 1 times [2018-10-26 21:50:12,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:12,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:12,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:12,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:12,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-10-26 21:50:12,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:12,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:12,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:12,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:12,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:12,344 INFO L87 Difference]: Start difference. First operand 2966 states and 4071 transitions. Second operand 3 states. [2018-10-26 21:50:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:13,055 INFO L93 Difference]: Finished difference Result 6200 states and 8526 transitions. [2018-10-26 21:50:13,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:13,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-26 21:50:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:13,071 INFO L225 Difference]: With dead ends: 6200 [2018-10-26 21:50:13,071 INFO L226 Difference]: Without dead ends: 3246 [2018-10-26 21:50:13,076 INFO L605 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-10-26 21:50:13,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2018-10-26 21:50:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3222. [2018-10-26 21:50:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3222 states. [2018-10-26 21:50:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 4367 transitions. [2018-10-26 21:50:13,158 INFO L78 Accepts]: Start accepts. Automaton has 3222 states and 4367 transitions. Word has length 230 [2018-10-26 21:50:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:13,158 INFO L481 AbstractCegarLoop]: Abstraction has 3222 states and 4367 transitions. [2018-10-26 21:50:13,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3222 states and 4367 transitions. [2018-10-26 21:50:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 21:50:13,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:13,167 INFO L375 BasicCegarLoop]: trace histogram [11, 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-10-26 21:50:13,168 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:13,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:13,168 INFO L82 PathProgramCache]: Analyzing trace with hash 97714442, now seen corresponding path program 1 times [2018-10-26 21:50:13,169 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:13,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:13,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:13,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:13,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-10-26 21:50:13,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:13,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:13,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:13,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:13,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:13,340 INFO L87 Difference]: Start difference. First operand 3222 states and 4367 transitions. Second operand 3 states. [2018-10-26 21:50:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:13,456 INFO L93 Difference]: Finished difference Result 9346 states and 12637 transitions. [2018-10-26 21:50:13,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:13,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-10-26 21:50:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:13,479 INFO L225 Difference]: With dead ends: 9346 [2018-10-26 21:50:13,479 INFO L226 Difference]: Without dead ends: 6136 [2018-10-26 21:50:13,486 INFO L605 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-10-26 21:50:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2018-10-26 21:50:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 6134. [2018-10-26 21:50:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6134 states. [2018-10-26 21:50:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 8277 transitions. [2018-10-26 21:50:13,610 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 8277 transitions. Word has length 261 [2018-10-26 21:50:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:13,610 INFO L481 AbstractCegarLoop]: Abstraction has 6134 states and 8277 transitions. [2018-10-26 21:50:13,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 8277 transitions. [2018-10-26 21:50:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 21:50:13,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:13,623 INFO L375 BasicCegarLoop]: trace histogram [11, 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-10-26 21:50:13,624 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:13,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1935679604, now seen corresponding path program 1 times [2018-10-26 21:50:13,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:13,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:13,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 496 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-10-26 21:50:13,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:13,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:13,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:13,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:13,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:13,754 INFO L87 Difference]: Start difference. First operand 6134 states and 8277 transitions. Second operand 3 states. [2018-10-26 21:50:14,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:14,333 INFO L93 Difference]: Finished difference Result 12864 states and 17242 transitions. [2018-10-26 21:50:14,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:14,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-10-26 21:50:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:14,363 INFO L225 Difference]: With dead ends: 12864 [2018-10-26 21:50:14,363 INFO L226 Difference]: Without dead ends: 6742 [2018-10-26 21:50:14,373 INFO L605 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-10-26 21:50:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2018-10-26 21:50:14,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 6710. [2018-10-26 21:50:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6710 states. [2018-10-26 21:50:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 8933 transitions. [2018-10-26 21:50:14,479 INFO L78 Accepts]: Start accepts. Automaton has 6710 states and 8933 transitions. Word has length 261 [2018-10-26 21:50:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:14,480 INFO L481 AbstractCegarLoop]: Abstraction has 6710 states and 8933 transitions. [2018-10-26 21:50:14,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6710 states and 8933 transitions. [2018-10-26 21:50:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-26 21:50:14,493 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:14,493 INFO L375 BasicCegarLoop]: trace histogram [12, 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-10-26 21:50:14,493 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:14,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:14,494 INFO L82 PathProgramCache]: Analyzing trace with hash 258218028, now seen corresponding path program 1 times [2018-10-26 21:50:14,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:14,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:14,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:14,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:14,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1023 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-10-26 21:50:14,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:14,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:14,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:14,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:14,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:14,631 INFO L87 Difference]: Start difference. First operand 6710 states and 8933 transitions. Second operand 3 states. [2018-10-26 21:50:14,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:14,927 INFO L93 Difference]: Finished difference Result 13432 states and 17866 transitions. [2018-10-26 21:50:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:14,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-10-26 21:50:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:14,946 INFO L225 Difference]: With dead ends: 13432 [2018-10-26 21:50:14,946 INFO L226 Difference]: Without dead ends: 6734 [2018-10-26 21:50:14,953 INFO L605 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-10-26 21:50:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6734 states. [2018-10-26 21:50:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6734 to 6702. [2018-10-26 21:50:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6702 states. [2018-10-26 21:50:15,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 8829 transitions. [2018-10-26 21:50:15,072 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 8829 transitions. Word has length 286 [2018-10-26 21:50:15,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:15,072 INFO L481 AbstractCegarLoop]: Abstraction has 6702 states and 8829 transitions. [2018-10-26 21:50:15,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:15,072 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 8829 transitions. [2018-10-26 21:50:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-26 21:50:15,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:15,086 INFO L375 BasicCegarLoop]: trace histogram [12, 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-10-26 21:50:15,086 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:15,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1080231137, now seen corresponding path program 1 times [2018-10-26 21:50:15,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:15,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:15,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:15,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:15,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-10-26 21:50:15,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:15,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:15,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:15,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:15,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:15,227 INFO L87 Difference]: Start difference. First operand 6702 states and 8829 transitions. Second operand 3 states. [2018-10-26 21:50:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:15,888 INFO L93 Difference]: Finished difference Result 14208 states and 19002 transitions. [2018-10-26 21:50:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:15,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2018-10-26 21:50:15,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:15,903 INFO L225 Difference]: With dead ends: 14208 [2018-10-26 21:50:15,904 INFO L226 Difference]: Without dead ends: 7518 [2018-10-26 21:50:15,913 INFO L605 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-10-26 21:50:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7518 states. [2018-10-26 21:50:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7518 to 7342. [2018-10-26 21:50:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7342 states. [2018-10-26 21:50:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 9581 transitions. [2018-10-26 21:50:16,027 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 9581 transitions. Word has length 297 [2018-10-26 21:50:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:16,028 INFO L481 AbstractCegarLoop]: Abstraction has 7342 states and 9581 transitions. [2018-10-26 21:50:16,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 9581 transitions. [2018-10-26 21:50:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-26 21:50:16,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:16,042 INFO L375 BasicCegarLoop]: trace histogram [13, 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-10-26 21:50:16,043 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:16,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash -836254489, now seen corresponding path program 1 times [2018-10-26 21:50:16,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:16,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:16,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:16,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-10-26 21:50:16,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:16,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:16,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:16,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:16,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:16,182 INFO L87 Difference]: Start difference. First operand 7342 states and 9581 transitions. Second operand 3 states. [2018-10-26 21:50:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:16,615 INFO L93 Difference]: Finished difference Result 15496 states and 20114 transitions. [2018-10-26 21:50:16,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:16,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2018-10-26 21:50:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:16,629 INFO L225 Difference]: With dead ends: 15496 [2018-10-26 21:50:16,629 INFO L226 Difference]: Without dead ends: 8166 [2018-10-26 21:50:16,641 INFO L605 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-10-26 21:50:16,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8166 states. [2018-10-26 21:50:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8166 to 7590. [2018-10-26 21:50:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7590 states. [2018-10-26 21:50:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7590 states to 7590 states and 9877 transitions. [2018-10-26 21:50:16,788 INFO L78 Accepts]: Start accepts. Automaton has 7590 states and 9877 transitions. Word has length 312 [2018-10-26 21:50:16,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:16,788 INFO L481 AbstractCegarLoop]: Abstraction has 7590 states and 9877 transitions. [2018-10-26 21:50:16,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 7590 states and 9877 transitions. [2018-10-26 21:50:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-26 21:50:16,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:16,804 INFO L375 BasicCegarLoop]: trace histogram [13, 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-10-26 21:50:16,804 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:16,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:16,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1454941809, now seen corresponding path program 1 times [2018-10-26 21:50:16,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:16,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:16,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:16,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:16,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2018-10-26 21:50:16,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:16,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:16,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:16,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:16,973 INFO L87 Difference]: Start difference. First operand 7590 states and 9877 transitions. Second operand 3 states. [2018-10-26 21:50:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:17,067 INFO L93 Difference]: Finished difference Result 12016 states and 15592 transitions. [2018-10-26 21:50:17,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:17,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-10-26 21:50:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:17,084 INFO L225 Difference]: With dead ends: 12016 [2018-10-26 21:50:17,084 INFO L226 Difference]: Without dead ends: 8142 [2018-10-26 21:50:17,092 INFO L605 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-10-26 21:50:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8142 states. [2018-10-26 21:50:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8142 to 8140. [2018-10-26 21:50:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8140 states. [2018-10-26 21:50:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8140 states to 8140 states and 10560 transitions. [2018-10-26 21:50:17,226 INFO L78 Accepts]: Start accepts. Automaton has 8140 states and 10560 transitions. Word has length 313 [2018-10-26 21:50:17,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:17,227 INFO L481 AbstractCegarLoop]: Abstraction has 8140 states and 10560 transitions. [2018-10-26 21:50:17,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 8140 states and 10560 transitions. [2018-10-26 21:50:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-26 21:50:17,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:17,242 INFO L375 BasicCegarLoop]: trace histogram [13, 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-10-26 21:50:17,242 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:17,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1768709470, now seen corresponding path program 1 times [2018-10-26 21:50:17,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:17,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:17,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:17,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:17,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2018-10-26 21:50:17,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:17,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:17,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:17,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:17,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:17,389 INFO L87 Difference]: Start difference. First operand 8140 states and 10560 transitions. Second operand 3 states. [2018-10-26 21:50:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:17,746 INFO L93 Difference]: Finished difference Result 15823 states and 20507 transitions. [2018-10-26 21:50:17,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:17,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-10-26 21:50:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:17,756 INFO L225 Difference]: With dead ends: 15823 [2018-10-26 21:50:17,757 INFO L226 Difference]: Without dead ends: 8143 [2018-10-26 21:50:17,767 INFO L605 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-10-26 21:50:17,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8143 states. [2018-10-26 21:50:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8143 to 8109. [2018-10-26 21:50:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8109 states. [2018-10-26 21:50:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8109 states to 8109 states and 10456 transitions. [2018-10-26 21:50:17,950 INFO L78 Accepts]: Start accepts. Automaton has 8109 states and 10456 transitions. Word has length 314 [2018-10-26 21:50:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:17,951 INFO L481 AbstractCegarLoop]: Abstraction has 8109 states and 10456 transitions. [2018-10-26 21:50:17,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:17,951 INFO L276 IsEmpty]: Start isEmpty. Operand 8109 states and 10456 transitions. [2018-10-26 21:50:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-26 21:50:17,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:17,962 INFO L375 BasicCegarLoop]: trace histogram [13, 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-10-26 21:50:17,962 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:17,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1928129264, now seen corresponding path program 1 times [2018-10-26 21:50:17,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:17,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:17,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:17,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:17,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 677 proven. 15 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-10-26 21:50:18,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:50:18,210 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:50:18,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:18,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:50:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2018-10-26 21:50:18,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:50:18,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-10-26 21:50:18,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:50:18,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:50:18,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:50:18,845 INFO L87 Difference]: Start difference. First operand 8109 states and 10456 transitions. Second operand 7 states. [2018-10-26 21:50:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:23,173 INFO L93 Difference]: Finished difference Result 17821 states and 22858 transitions. [2018-10-26 21:50:23,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:50:23,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 337 [2018-10-26 21:50:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:23,205 INFO L225 Difference]: With dead ends: 17821 [2018-10-26 21:50:23,206 INFO L226 Difference]: Without dead ends: 9688 [2018-10-26 21:50:23,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:50:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9688 states. [2018-10-26 21:50:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9688 to 8257. [2018-10-26 21:50:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8257 states. [2018-10-26 21:50:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8257 states to 8257 states and 10466 transitions. [2018-10-26 21:50:23,442 INFO L78 Accepts]: Start accepts. Automaton has 8257 states and 10466 transitions. Word has length 337 [2018-10-26 21:50:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:23,443 INFO L481 AbstractCegarLoop]: Abstraction has 8257 states and 10466 transitions. [2018-10-26 21:50:23,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:50:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 8257 states and 10466 transitions. [2018-10-26 21:50:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-26 21:50:23,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:23,460 INFO L375 BasicCegarLoop]: trace histogram [15, 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-10-26 21:50:23,461 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:23,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:23,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1051762384, now seen corresponding path program 1 times [2018-10-26 21:50:23,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:23,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:23,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:23,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:23,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 770 proven. 6 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2018-10-26 21:50:23,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:50:23,854 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 21:50:23,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:50:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:23,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:50:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2018-10-26 21:50:24,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:50:24,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-26 21:50:24,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:50:24,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:50:24,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:50:24,171 INFO L87 Difference]: Start difference. First operand 8257 states and 10466 transitions. Second operand 5 states. [2018-10-26 21:50:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:26,007 INFO L93 Difference]: Finished difference Result 16983 states and 21044 transitions. [2018-10-26 21:50:26,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:50:26,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 365 [2018-10-26 21:50:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:26,023 INFO L225 Difference]: With dead ends: 16983 [2018-10-26 21:50:26,024 INFO L226 Difference]: Without dead ends: 8737 [2018-10-26 21:50:26,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:50:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2018-10-26 21:50:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 7225. [2018-10-26 21:50:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7225 states. [2018-10-26 21:50:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7225 states to 7225 states and 8769 transitions. [2018-10-26 21:50:26,186 INFO L78 Accepts]: Start accepts. Automaton has 7225 states and 8769 transitions. Word has length 365 [2018-10-26 21:50:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:26,186 INFO L481 AbstractCegarLoop]: Abstraction has 7225 states and 8769 transitions. [2018-10-26 21:50:26,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:50:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 7225 states and 8769 transitions. [2018-10-26 21:50:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-26 21:50:26,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:26,196 INFO L375 BasicCegarLoop]: trace histogram [18, 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-10-26 21:50:26,196 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:26,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:26,197 INFO L82 PathProgramCache]: Analyzing trace with hash -68147695, now seen corresponding path program 1 times [2018-10-26 21:50:26,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:26,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:26,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:26,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-10-26 21:50:26,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:26,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:26,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:26,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:26,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:26,477 INFO L87 Difference]: Start difference. First operand 7225 states and 8769 transitions. Second operand 3 states. [2018-10-26 21:50:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:27,224 INFO L93 Difference]: Finished difference Result 13114 states and 15826 transitions. [2018-10-26 21:50:27,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:27,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2018-10-26 21:50:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:27,230 INFO L225 Difference]: With dead ends: 13114 [2018-10-26 21:50:27,230 INFO L226 Difference]: Without dead ends: 3625 [2018-10-26 21:50:27,238 INFO L605 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-10-26 21:50:27,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3625 states. [2018-10-26 21:50:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3625 to 3550. [2018-10-26 21:50:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2018-10-26 21:50:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 4361 transitions. [2018-10-26 21:50:27,301 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 4361 transitions. Word has length 438 [2018-10-26 21:50:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:27,302 INFO L481 AbstractCegarLoop]: Abstraction has 3550 states and 4361 transitions. [2018-10-26 21:50:27,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:27,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4361 transitions. [2018-10-26 21:50:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-10-26 21:50:27,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:27,309 INFO L375 BasicCegarLoop]: trace histogram [18, 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-10-26 21:50:27,309 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:27,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:27,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2081473004, now seen corresponding path program 1 times [2018-10-26 21:50:27,310 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:50:27,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:50:27,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:27,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:27,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1573 proven. 15 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2018-10-26 21:50:27,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:50:27,598 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 21:50:27,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:50:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:27,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:50:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1573 proven. 15 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2018-10-26 21:50:28,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:50:28,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-26 21:50:28,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:50:28,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:50:28,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:50:28,037 INFO L87 Difference]: Start difference. First operand 3550 states and 4361 transitions. Second operand 4 states. [2018-10-26 21:50:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:28,201 INFO L93 Difference]: Finished difference Result 4059 states and 4999 transitions. [2018-10-26 21:50:28,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:50:28,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2018-10-26 21:50:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:28,202 INFO L225 Difference]: With dead ends: 4059 [2018-10-26 21:50:28,202 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:50:28,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:50:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:50:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:50:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:50:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:50:28,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 505 [2018-10-26 21:50:28,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:28,210 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:50:28,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:50:28,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:50:28,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:50:28,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:50:28,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:50:28,656 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 87 [2018-10-26 21:50:29,138 WARN L179 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-10-26 21:50:30,406 WARN L179 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2018-10-26 21:50:30,426 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 21:50:30,426 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:50:30,426 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-10-26 21:50:30,426 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-10-26 21:50:30,426 INFO L428 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-10-26 21:50:30,426 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-10-26 21:50:30,426 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-10-26 21:50:30,426 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-10-26 21:50:30,426 INFO L421 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-10-26 21:50:30,426 INFO L421 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-10-26 21:50:30,426 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-10-26 21:50:30,427 INFO L425 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-10-26 21:50:30,427 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-10-26 21:50:30,427 INFO L425 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-10-26 21:50:30,427 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-10-26 21:50:30,427 INFO L425 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-10-26 21:50:30,427 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-10-26 21:50:30,427 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-10-26 21:50:30,427 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-10-26 21:50:30,427 INFO L421 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-10-26 21:50:30,427 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-10-26 21:50:30,427 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-10-26 21:50:30,427 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-10-26 21:50:30,427 INFO L425 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 21:50:30,428 INFO L425 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-10-26 21:50:30,428 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-10-26 21:50:30,428 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-10-26 21:50:30,428 INFO L421 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-10-26 21:50:30,428 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-10-26 21:50:30,428 INFO L425 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-10-26 21:50:30,428 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-10-26 21:50:30,428 INFO L421 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-10-26 21:50:30,428 INFO L425 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-10-26 21:50:30,428 INFO L425 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-10-26 21:50:30,428 INFO L428 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-10-26 21:50:30,428 INFO L425 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L421 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-10-26 21:50:30,429 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-10-26 21:50:30,430 INFO L421 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4512 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 .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1))) [2018-10-26 21:50:30,430 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-10-26 21:50:30,430 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-10-26 21:50:30,430 INFO L425 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-10-26 21:50:30,430 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-10-26 21:50:30,430 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-10-26 21:50:30,430 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-10-26 21:50:30,430 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-10-26 21:50:30,430 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-10-26 21:50:30,430 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2018-10-26 21:50:30,430 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-10-26 21:50:30,430 INFO L425 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2018-10-26 21:50:30,431 INFO L421 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2018-10-26 21:50:30,431 INFO L425 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-10-26 21:50:30,431 INFO L425 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-10-26 21:50:30,431 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2018-10-26 21:50:30,431 INFO L425 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 21:50:30,431 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-10-26 21:50:30,431 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-10-26 21:50:30,431 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-10-26 21:50:30,431 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-10-26 21:50:30,431 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-10-26 21:50:30,431 INFO L421 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4512 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 .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1))) [2018-10-26 21:50:30,432 INFO L421 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= 4352 ssl3_connect_~s__state~0) (not (= ssl3_connect_~s__hit~0 0)) (<= ssl3_connect_~s__state~0 4560)))) [2018-10-26 21:50:30,432 INFO L425 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-10-26 21:50:30,432 INFO L425 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-10-26 21:50:30,432 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-10-26 21:50:30,432 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-10-26 21:50:30,432 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2018-10-26 21:50:30,432 INFO L421 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse3 (<= 4560 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (<= ssl3_connect_~s__state~0 3)) (.cse9 (not .cse1)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse8 (<= 4352 ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse11 (= ssl3_connect_~s__state~0 4512)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse0 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 (= ssl3_connect_~s__state~0 4480)) (and .cse2 .cse3 .cse0 .cse1 .cse4 .cse5) (and (= ssl3_connect_~s__state~0 4448) .cse0 .cse1) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse7 .cse8 .cse9) (and .cse6 .cse3 .cse9 .cse4) (and (= ssl3_connect_~s__state~0 4464) .cse0 .cse1) (and .cse10 .cse2 .cse0 .cse5) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse10 .cse2 .cse9) (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) (and .cse6 .cse12) (< |ssl3_connect_#in~initial_state| 12292) (and .cse2 .cse7 .cse8 .cse0 .cse1 .cse5) (and (= ssl3_connect_~s__state~0 4496) .cse0 .cse1) (and .cse6 .cse11) (and .cse6 (= ssl3_connect_~s__state~0 4400) .cse1) (and .cse12 .cse0 .cse1)))) [2018-10-26 21:50:30,432 INFO L425 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-10-26 21:50:30,433 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-10-26 21:50:30,433 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-10-26 21:50:30,433 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-10-26 21:50:30,433 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-10-26 21:50:30,433 INFO L421 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-10-26 21:50:30,433 INFO L425 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 21:50:30,433 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-10-26 21:50:30,433 INFO L425 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 21:50:30,433 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-10-26 21:50:30,433 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-10-26 21:50:30,433 INFO L425 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2018-10-26 21:50:30,434 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-10-26 21:50:30,434 INFO L425 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-10-26 21:50:30,434 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-10-26 21:50:30,434 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-10-26 21:50:30,434 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-10-26 21:50:30,434 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-10-26 21:50:30,434 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-10-26 21:50:30,434 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-10-26 21:50:30,434 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-10-26 21:50:30,434 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-10-26 21:50:30,434 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-10-26 21:50:30,434 INFO L425 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-10-26 21:50:30,435 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-10-26 21:50:30,435 INFO L421 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 (not .cse1) .cse2))) [2018-10-26 21:50:30,435 INFO L421 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-10-26 21:50:30,435 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-10-26 21:50:30,435 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-10-26 21:50:30,435 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-10-26 21:50:30,435 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-10-26 21:50:30,435 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-10-26 21:50:30,435 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-10-26 21:50:30,435 INFO L425 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-10-26 21:50:30,435 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-10-26 21:50:30,436 INFO L421 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2 (<= 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 (not .cse2)))) [2018-10-26 21:50:30,436 INFO L421 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (and (<= 4432 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (<= ssl3_connect_~s__state~0 4560))) [2018-10-26 21:50:30,436 INFO L425 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-10-26 21:50:30,436 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-10-26 21:50:30,436 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-10-26 21:50:30,436 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-10-26 21:50:30,436 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 539) no Hoare annotation was computed. [2018-10-26 21:50:30,436 INFO L425 ceAbstractionStarter]: For program point L99-2(lines 76 551) no Hoare annotation was computed. [2018-10-26 21:50:30,436 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-10-26 21:50:30,437 INFO L428 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-10-26 21:50:30,437 INFO L421 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-10-26 21:50:30,437 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-26 21:50:30,437 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-10-26 21:50:30,437 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-10-26 21:50:30,437 INFO L425 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 21:50:30,437 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:50:30,437 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 21:50:30,437 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 21:50:30,437 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:50:30,437 INFO L421 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2018-10-26 21:50:30,438 INFO L425 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-10-26 21:50:30,438 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-10-26 21:50:30,438 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-10-26 21:50:30,438 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-10-26 21:50:30,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:50:30 BoogieIcfgContainer [2018-10-26 21:50:30,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:50:30,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:50:30,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:50:30,494 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:50:30,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:50:02" (3/4) ... [2018-10-26 21:50:30,509 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 21:50:30,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 21:50:30,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-10-26 21:50:30,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 21:50:30,528 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-10-26 21:50:30,529 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-26 21:50:30,529 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 21:50:30,563 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-10-26 21:50:30,563 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-10-26 21:50:30,564 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (blastFlag <= 0 && s__state == 4368)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && !(s__hit == 0)) && s__state <= 4560) [2018-10-26 21:50:30,564 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-10-26 21:50:30,564 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-10-26 21:50:30,564 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-10-26 21:50:30,564 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((s__state <= 3 && 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 == 4512 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || \old(initial_state) < 12292) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0) [2018-10-26 21:50:30,565 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 21:50:30,565 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-10-26 21:50:30,565 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-10-26 21:50:30,565 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-10-26 21:50:30,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 21:50:30,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 21:50:30,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 21:50:30,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 21:50:30,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560) [2018-10-26 21:50:30,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && 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) && !(s__hit == 0)) [2018-10-26 21:50:30,655 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5f80fdeb-05d3-42cf-9c54-7e98871a5bae/bin-2019/uautomizer/witness.graphml [2018-10-26 21:50:30,656 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:50:30,656 INFO L168 Benchmark]: Toolchain (without parser) took 30285.41 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 684.2 MB). Free memory was 960.7 MB in the beginning and 1.2 GB in the end (delta: -194.9 MB). Peak memory consumption was 489.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:50:30,657 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:50:30,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.03 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 944.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 21:50:30,658 INFO L168 Benchmark]: Boogie Preprocessor took 51.86 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:50:30,658 INFO L168 Benchmark]: RCFGBuilder took 1276.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:50:30,658 INFO L168 Benchmark]: TraceAbstraction took 28436.10 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 511.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -51.5 MB). Peak memory consumption was 460.2 MB. Max. memory is 11.5 GB. [2018-10-26 21:50:30,659 INFO L168 Benchmark]: Witness Printer took 161.80 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-10-26 21:50:30,663 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.03 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 944.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.86 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1276.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28436.10 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 511.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -51.5 MB). Peak memory consumption was 460.2 MB. Max. memory is 11.5 GB. * Witness Printer took 161.80 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (blastFlag <= 0 && s__state == 4368)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && !(s__hit == 0)) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && 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) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((s__state <= 3 && 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 == 4512 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || \old(initial_state) < 12292) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && 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__hit == 0) && s__state <= 4560) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 139 locations, 1 error locations. SAFE Result, 28.2s OverallTime, 26 OverallIterations, 18 TraceHistogramMax, 18.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 5428 SDtfs, 2089 SDslu, 3480 SDs, 0 SdLazy, 2776 SolverSat, 464 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1300 GetRequests, 1259 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8257occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 4166 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 166 NumberOfFragments, 557 HoareAnnotationTreeSize, 26 FomulaSimplifications, 15055 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1305 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 6659 NumberOfCodeBlocks, 6659 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6630 ConstructedInterpolants, 0 QuantifiedInterpolants, 2554625 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2205 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 29 InterpolantComputations, 25 PerfectInterpolantSequences, 22993/23044 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...