./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.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_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b2fdeede7b1203b845c20c562beaee69c29ce3b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b2fdeede7b1203b845c20c562beaee69c29ce3b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:46:28,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:46:28,659 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:46:28,668 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:46:28,668 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:46:28,669 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:46:28,669 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:46:28,671 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:46:28,672 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:46:28,672 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:46:28,673 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:46:28,673 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:46:28,674 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:46:28,675 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:46:28,675 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:46:28,676 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:46:28,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:46:28,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:46:28,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:46:28,681 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:46:28,682 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:46:28,683 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:46:28,684 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:46:28,684 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:46:28,684 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:46:28,686 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:46:28,686 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:46:28,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:46:28,688 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:46:28,688 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:46:28,688 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:46:28,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:46:28,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:46:28,690 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:46:28,691 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:46:28,691 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:46:28,691 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 11:46:28,702 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:46:28,702 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:46:28,702 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:46:28,703 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:46:28,703 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:46:28,703 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:46:28,703 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:46:28,703 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:46:28,703 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:46:28,703 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:46:28,704 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:46:28,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:46:28,704 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:46:28,704 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:46:28,705 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:46:28,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:46:28,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:46:28,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:46:28,706 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:46:28,706 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:46:28,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:46:28,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:46:28,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:46:28,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:46:28,707 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:46:28,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:46:28,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:46:28,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:46:28,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:46:28,707 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:46:28,708 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:46:28,708 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:46:28,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:46:28,708 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:46:28,708 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9b2fdeede7b1203b845c20c562beaee69c29ce3b [2018-11-10 11:46:28,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:46:28,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:46:28,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:46:28,746 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:46:28,746 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:46:28,747 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-10 11:46:28,789 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/data/70c07ccce/78217628b6e5440db8ee75bbd8b90802/FLAG990c15ba3 [2018-11-10 11:46:29,169 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:46:29,170 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-10 11:46:29,183 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/data/70c07ccce/78217628b6e5440db8ee75bbd8b90802/FLAG990c15ba3 [2018-11-10 11:46:29,193 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/data/70c07ccce/78217628b6e5440db8ee75bbd8b90802 [2018-11-10 11:46:29,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:46:29,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:46:29,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:46:29,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:46:29,199 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:46:29,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:46:29" (1/1) ... [2018-11-10 11:46:29,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6b6041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29, skipping insertion in model container [2018-11-10 11:46:29,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:46:29" (1/1) ... [2018-11-10 11:46:29,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:46:29,252 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:46:29,687 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:46:29,695 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:46:29,868 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:46:29,946 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:46:29,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29 WrapperNode [2018-11-10 11:46:29,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:46:29,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:46:29,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:46:29,947 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:46:29,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29" (1/1) ... [2018-11-10 11:46:29,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29" (1/1) ... [2018-11-10 11:46:30,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:46:30,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:46:30,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:46:30,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:46:30,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29" (1/1) ... [2018-11-10 11:46:30,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29" (1/1) ... [2018-11-10 11:46:30,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29" (1/1) ... [2018-11-10 11:46:30,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29" (1/1) ... [2018-11-10 11:46:30,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29" (1/1) ... [2018-11-10 11:46:30,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29" (1/1) ... [2018-11-10 11:46:30,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29" (1/1) ... [2018-11-10 11:46:30,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:46:30,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:46:30,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:46:30,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:46:30,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:46:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:46:30,143 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:46:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:46:30,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:46:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:46:30,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:46:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 11:46:30,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 11:46:30,558 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 11:46:30,558 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 11:46:31,115 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:46:31,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:31 BoogieIcfgContainer [2018-11-10 11:46:31,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:46:31,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:46:31,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:46:31,119 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:46:31,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:46:29" (1/3) ... [2018-11-10 11:46:31,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433af0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:46:31, skipping insertion in model container [2018-11-10 11:46:31,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:29" (2/3) ... [2018-11-10 11:46:31,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433af0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:46:31, skipping insertion in model container [2018-11-10 11:46:31,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:31" (3/3) ... [2018-11-10 11:46:31,123 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-10 11:46:31,130 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:46:31,137 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:46:31,148 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:46:31,173 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:46:31,173 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:46:31,173 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:46:31,174 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:46:31,174 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:46:31,174 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:46:31,174 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:46:31,174 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:46:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-11-10 11:46:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 11:46:31,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:31,196 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, 1] [2018-11-10 11:46:31,198 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:31,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1265738566, now seen corresponding path program 1 times [2018-11-10 11:46:31,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:31,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:31,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:31,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:31,237 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:31,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:31,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:31,419 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:31,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:31,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:31,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:31,437 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2018-11-10 11:46:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:31,524 INFO L93 Difference]: Finished difference Result 388 states and 640 transitions. [2018-11-10 11:46:31,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:31,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 11:46:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:31,535 INFO L225 Difference]: With dead ends: 388 [2018-11-10 11:46:31,535 INFO L226 Difference]: Without dead ends: 225 [2018-11-10 11:46:31,538 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-11-10 11:46:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-10 11:46:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-11-10 11:46:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-10 11:46:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 329 transitions. [2018-11-10 11:46:31,574 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 329 transitions. Word has length 31 [2018-11-10 11:46:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:31,574 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 329 transitions. [2018-11-10 11:46:31,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 329 transitions. [2018-11-10 11:46:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 11:46:31,576 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:31,577 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, 1, 1] [2018-11-10 11:46:31,577 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:31,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:31,577 INFO L82 PathProgramCache]: Analyzing trace with hash -186957446, now seen corresponding path program 1 times [2018-11-10 11:46:31,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:31,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:31,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:31,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:31,580 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:31,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:31,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:31,681 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:31,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:31,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:31,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:31,683 INFO L87 Difference]: Start difference. First operand 225 states and 329 transitions. Second operand 3 states. [2018-11-10 11:46:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:31,738 INFO L93 Difference]: Finished difference Result 436 states and 646 transitions. [2018-11-10 11:46:31,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:31,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-10 11:46:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:31,741 INFO L225 Difference]: With dead ends: 436 [2018-11-10 11:46:31,741 INFO L226 Difference]: Without dead ends: 328 [2018-11-10 11:46:31,742 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-11-10 11:46:31,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-10 11:46:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-10 11:46:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-10 11:46:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 479 transitions. [2018-11-10 11:46:31,761 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 479 transitions. Word has length 47 [2018-11-10 11:46:31,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:31,761 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 479 transitions. [2018-11-10 11:46:31,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 479 transitions. [2018-11-10 11:46:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 11:46:31,764 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:31,764 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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-11-10 11:46:31,764 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:31,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash 435222576, now seen corresponding path program 1 times [2018-11-10 11:46:31,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:31,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:31,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:31,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:31,767 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 11:46:31,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:31,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:31,849 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:31,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:31,850 INFO L87 Difference]: Start difference. First operand 328 states and 479 transitions. Second operand 3 states. [2018-11-10 11:46:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:31,908 INFO L93 Difference]: Finished difference Result 645 states and 950 transitions. [2018-11-10 11:46:31,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:31,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-10 11:46:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:31,911 INFO L225 Difference]: With dead ends: 645 [2018-11-10 11:46:31,911 INFO L226 Difference]: Without dead ends: 434 [2018-11-10 11:46:31,912 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-11-10 11:46:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-10 11:46:31,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-10 11:46:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-10 11:46:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 636 transitions. [2018-11-10 11:46:31,928 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 636 transitions. Word has length 66 [2018-11-10 11:46:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:31,928 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 636 transitions. [2018-11-10 11:46:31,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 636 transitions. [2018-11-10 11:46:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 11:46:31,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:31,932 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 11:46:31,932 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:31,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash -244885070, now seen corresponding path program 1 times [2018-11-10 11:46:31,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:31,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:31,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:31,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:31,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 11:46:32,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:32,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:32,054 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:32,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:32,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:32,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:32,055 INFO L87 Difference]: Start difference. First operand 434 states and 636 transitions. Second operand 3 states. [2018-11-10 11:46:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:32,098 INFO L93 Difference]: Finished difference Result 542 states and 797 transitions. [2018-11-10 11:46:32,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:32,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-11-10 11:46:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:32,103 INFO L225 Difference]: With dead ends: 542 [2018-11-10 11:46:32,104 INFO L226 Difference]: Without dead ends: 540 [2018-11-10 11:46:32,104 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-11-10 11:46:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-11-10 11:46:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2018-11-10 11:46:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-11-10 11:46:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 794 transitions. [2018-11-10 11:46:32,122 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 794 transitions. Word has length 87 [2018-11-10 11:46:32,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:32,122 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 794 transitions. [2018-11-10 11:46:32,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 794 transitions. [2018-11-10 11:46:32,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 11:46:32,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:32,125 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:32,126 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:32,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:32,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1961911637, now seen corresponding path program 1 times [2018-11-10 11:46:32,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:32,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:32,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:32,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:32,128 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 11:46:32,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:32,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:32,277 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:32,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:32,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:32,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:32,281 INFO L87 Difference]: Start difference. First operand 540 states and 794 transitions. Second operand 3 states. [2018-11-10 11:46:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:32,301 INFO L93 Difference]: Finished difference Result 542 states and 795 transitions. [2018-11-10 11:46:32,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:32,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-11-10 11:46:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:32,305 INFO L225 Difference]: With dead ends: 542 [2018-11-10 11:46:32,306 INFO L226 Difference]: Without dead ends: 540 [2018-11-10 11:46:32,306 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-11-10 11:46:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-11-10 11:46:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2018-11-10 11:46:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-11-10 11:46:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 793 transitions. [2018-11-10 11:46:32,322 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 793 transitions. Word has length 109 [2018-11-10 11:46:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:32,323 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 793 transitions. [2018-11-10 11:46:32,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 793 transitions. [2018-11-10 11:46:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 11:46:32,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:32,325 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:32,325 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:32,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:32,325 INFO L82 PathProgramCache]: Analyzing trace with hash -234771568, now seen corresponding path program 1 times [2018-11-10 11:46:32,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:32,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:32,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 11:46:32,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:32,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:46:32,451 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:32,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:46:32,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:46:32,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:32,452 INFO L87 Difference]: Start difference. First operand 540 states and 793 transitions. Second operand 4 states. [2018-11-10 11:46:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:32,730 INFO L93 Difference]: Finished difference Result 1329 states and 1956 transitions. [2018-11-10 11:46:32,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:46:32,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-11-10 11:46:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:32,733 INFO L225 Difference]: With dead ends: 1329 [2018-11-10 11:46:32,733 INFO L226 Difference]: Without dead ends: 802 [2018-11-10 11:46:32,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-11-10 11:46:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 665. [2018-11-10 11:46:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-11-10 11:46:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1008 transitions. [2018-11-10 11:46:32,755 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1008 transitions. Word has length 111 [2018-11-10 11:46:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:32,755 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 1008 transitions. [2018-11-10 11:46:32,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:46:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1008 transitions. [2018-11-10 11:46:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 11:46:32,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:32,758 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:32,758 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:32,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash 608334435, now seen corresponding path program 1 times [2018-11-10 11:46:32,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:32,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:32,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:32,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:32,760 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 11:46:32,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:32,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:46:32,885 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:32,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:46:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:46:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:32,886 INFO L87 Difference]: Start difference. First operand 665 states and 1008 transitions. Second operand 4 states. [2018-11-10 11:46:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:33,139 INFO L93 Difference]: Finished difference Result 1449 states and 2161 transitions. [2018-11-10 11:46:33,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:46:33,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-10 11:46:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:33,142 INFO L225 Difference]: With dead ends: 1449 [2018-11-10 11:46:33,142 INFO L226 Difference]: Without dead ends: 797 [2018-11-10 11:46:33,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:46:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-11-10 11:46:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 665. [2018-11-10 11:46:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-11-10 11:46:33,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1003 transitions. [2018-11-10 11:46:33,156 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1003 transitions. Word has length 127 [2018-11-10 11:46:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:33,156 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 1003 transitions. [2018-11-10 11:46:33,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:46:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1003 transitions. [2018-11-10 11:46:33,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 11:46:33,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:33,158 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:33,158 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:33,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:33,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1105633659, now seen corresponding path program 1 times [2018-11-10 11:46:33,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:33,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:33,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:33,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:33,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 11:46:33,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:33,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:46:33,271 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:33,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:46:33,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:46:33,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:46:33,271 INFO L87 Difference]: Start difference. First operand 665 states and 1003 transitions. Second operand 6 states. [2018-11-10 11:46:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:33,646 INFO L93 Difference]: Finished difference Result 1275 states and 1922 transitions. [2018-11-10 11:46:33,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:46:33,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-10 11:46:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:33,649 INFO L225 Difference]: With dead ends: 1275 [2018-11-10 11:46:33,649 INFO L226 Difference]: Without dead ends: 750 [2018-11-10 11:46:33,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:46:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-11-10 11:46:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 674. [2018-11-10 11:46:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-11-10 11:46:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1017 transitions. [2018-11-10 11:46:33,670 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1017 transitions. Word has length 127 [2018-11-10 11:46:33,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:33,670 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 1017 transitions. [2018-11-10 11:46:33,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:46:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1017 transitions. [2018-11-10 11:46:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 11:46:33,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:33,672 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:33,673 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:33,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:33,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1154145746, now seen corresponding path program 1 times [2018-11-10 11:46:33,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:33,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:33,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:33,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:33,674 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 11:46:33,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:33,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:46:33,805 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:33,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:46:33,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:46:33,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:33,806 INFO L87 Difference]: Start difference. First operand 674 states and 1017 transitions. Second operand 4 states. [2018-11-10 11:46:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:34,119 INFO L93 Difference]: Finished difference Result 1809 states and 2716 transitions. [2018-11-10 11:46:34,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:46:34,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-11-10 11:46:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:34,122 INFO L225 Difference]: With dead ends: 1809 [2018-11-10 11:46:34,122 INFO L226 Difference]: Without dead ends: 1157 [2018-11-10 11:46:34,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:46:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2018-11-10 11:46:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 798. [2018-11-10 11:46:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2018-11-10 11:46:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1206 transitions. [2018-11-10 11:46:34,141 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1206 transitions. Word has length 128 [2018-11-10 11:46:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:34,141 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 1206 transitions. [2018-11-10 11:46:34,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:46:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1206 transitions. [2018-11-10 11:46:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 11:46:34,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:34,143 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:34,143 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:34,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:34,143 INFO L82 PathProgramCache]: Analyzing trace with hash -804429040, now seen corresponding path program 1 times [2018-11-10 11:46:34,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:34,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:34,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:34,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:34,144 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 11:46:34,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:34,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:46:34,222 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:34,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:46:34,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:46:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:34,223 INFO L87 Difference]: Start difference. First operand 798 states and 1206 transitions. Second operand 4 states. [2018-11-10 11:46:34,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:34,445 INFO L93 Difference]: Finished difference Result 1706 states and 2543 transitions. [2018-11-10 11:46:34,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:46:34,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-11-10 11:46:34,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:34,448 INFO L225 Difference]: With dead ends: 1706 [2018-11-10 11:46:34,448 INFO L226 Difference]: Without dead ends: 930 [2018-11-10 11:46:34,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:46:34,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-11-10 11:46:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 798. [2018-11-10 11:46:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2018-11-10 11:46:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1201 transitions. [2018-11-10 11:46:34,466 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1201 transitions. Word has length 128 [2018-11-10 11:46:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:34,466 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 1201 transitions. [2018-11-10 11:46:34,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:46:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1201 transitions. [2018-11-10 11:46:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 11:46:34,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:34,467 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 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] [2018-11-10 11:46:34,468 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:34,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1196040717, now seen corresponding path program 1 times [2018-11-10 11:46:34,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:34,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:34,469 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-10 11:46:34,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:34,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:46:34,544 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:34,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:46:34,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:46:34,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:34,544 INFO L87 Difference]: Start difference. First operand 798 states and 1201 transitions. Second operand 4 states. [2018-11-10 11:46:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:34,719 INFO L93 Difference]: Finished difference Result 1562 states and 2352 transitions. [2018-11-10 11:46:34,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:46:34,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-11-10 11:46:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:34,722 INFO L225 Difference]: With dead ends: 1562 [2018-11-10 11:46:34,722 INFO L226 Difference]: Without dead ends: 940 [2018-11-10 11:46:34,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-11-10 11:46:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 874. [2018-11-10 11:46:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-10 11:46:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1325 transitions. [2018-11-10 11:46:34,741 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1325 transitions. Word has length 128 [2018-11-10 11:46:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:34,741 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1325 transitions. [2018-11-10 11:46:34,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:46:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1325 transitions. [2018-11-10 11:46:34,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 11:46:34,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:34,743 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:34,743 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:34,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:34,743 INFO L82 PathProgramCache]: Analyzing trace with hash 380620777, now seen corresponding path program 1 times [2018-11-10 11:46:34,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:34,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:34,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:34,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:34,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 11:46:34,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:34,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:46:34,804 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:34,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:46:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:46:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:34,805 INFO L87 Difference]: Start difference. First operand 874 states and 1325 transitions. Second operand 4 states. [2018-11-10 11:46:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:34,981 INFO L93 Difference]: Finished difference Result 1858 states and 2781 transitions. [2018-11-10 11:46:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:46:34,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-11-10 11:46:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:34,983 INFO L225 Difference]: With dead ends: 1858 [2018-11-10 11:46:34,983 INFO L226 Difference]: Without dead ends: 1006 [2018-11-10 11:46:34,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:46:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-11-10 11:46:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 874. [2018-11-10 11:46:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-10 11:46:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1320 transitions. [2018-11-10 11:46:35,002 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1320 transitions. Word has length 129 [2018-11-10 11:46:35,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:35,002 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1320 transitions. [2018-11-10 11:46:35,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:46:35,003 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1320 transitions. [2018-11-10 11:46:35,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 11:46:35,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:35,004 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:35,004 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:35,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash -705047861, now seen corresponding path program 1 times [2018-11-10 11:46:35,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:35,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:35,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:35,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:35,005 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 11:46:35,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:35,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:46:35,064 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:35,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:46:35,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:46:35,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:35,065 INFO L87 Difference]: Start difference. First operand 874 states and 1320 transitions. Second operand 4 states. [2018-11-10 11:46:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:35,268 INFO L93 Difference]: Finished difference Result 1858 states and 2771 transitions. [2018-11-10 11:46:35,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:46:35,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-11-10 11:46:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:35,271 INFO L225 Difference]: With dead ends: 1858 [2018-11-10 11:46:35,271 INFO L226 Difference]: Without dead ends: 1006 [2018-11-10 11:46:35,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:46:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-11-10 11:46:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 874. [2018-11-10 11:46:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-10 11:46:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1315 transitions. [2018-11-10 11:46:35,295 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1315 transitions. Word has length 130 [2018-11-10 11:46:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:35,295 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1315 transitions. [2018-11-10 11:46:35,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:46:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1315 transitions. [2018-11-10 11:46:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 11:46:35,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:35,297 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2018-11-10 11:46:35,297 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:35,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash 324717383, now seen corresponding path program 1 times [2018-11-10 11:46:35,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:35,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:35,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:35,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:35,299 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 11:46:35,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:35,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:46:35,377 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:35,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:46:35,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:46:35,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:35,378 INFO L87 Difference]: Start difference. First operand 874 states and 1315 transitions. Second operand 4 states. [2018-11-10 11:46:35,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:35,631 INFO L93 Difference]: Finished difference Result 1858 states and 2761 transitions. [2018-11-10 11:46:35,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:46:35,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-11-10 11:46:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:35,634 INFO L225 Difference]: With dead ends: 1858 [2018-11-10 11:46:35,634 INFO L226 Difference]: Without dead ends: 1006 [2018-11-10 11:46:35,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:46:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-11-10 11:46:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 874. [2018-11-10 11:46:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-10 11:46:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1310 transitions. [2018-11-10 11:46:35,655 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1310 transitions. Word has length 131 [2018-11-10 11:46:35,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:35,655 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1310 transitions. [2018-11-10 11:46:35,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:46:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1310 transitions. [2018-11-10 11:46:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 11:46:35,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:35,657 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:35,657 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:35,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:35,657 INFO L82 PathProgramCache]: Analyzing trace with hash 831455428, now seen corresponding path program 1 times [2018-11-10 11:46:35,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:35,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:35,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:35,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:35,658 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 11:46:35,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:35,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:46:35,721 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:35,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:46:35,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:46:35,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:35,721 INFO L87 Difference]: Start difference. First operand 874 states and 1310 transitions. Second operand 4 states. [2018-11-10 11:46:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:36,087 INFO L93 Difference]: Finished difference Result 1813 states and 2696 transitions. [2018-11-10 11:46:36,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:46:36,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-11-10 11:46:36,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:36,091 INFO L225 Difference]: With dead ends: 1813 [2018-11-10 11:46:36,091 INFO L226 Difference]: Without dead ends: 961 [2018-11-10 11:46:36,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:46:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-11-10 11:46:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 874. [2018-11-10 11:46:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-10 11:46:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1305 transitions. [2018-11-10 11:46:36,126 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1305 transitions. Word has length 131 [2018-11-10 11:46:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:36,126 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1305 transitions. [2018-11-10 11:46:36,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:46:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1305 transitions. [2018-11-10 11:46:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 11:46:36,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:36,128 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 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] [2018-11-10 11:46:36,128 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:36,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:36,129 INFO L82 PathProgramCache]: Analyzing trace with hash -490863186, now seen corresponding path program 1 times [2018-11-10 11:46:36,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:36,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:36,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:36,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:36,130 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 11:46:36,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:36,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:46:36,222 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:36,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:46:36,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:46:36,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:36,223 INFO L87 Difference]: Start difference. First operand 874 states and 1305 transitions. Second operand 4 states. [2018-11-10 11:46:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:36,486 INFO L93 Difference]: Finished difference Result 1795 states and 2661 transitions. [2018-11-10 11:46:36,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:46:36,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-11-10 11:46:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:36,490 INFO L225 Difference]: With dead ends: 1795 [2018-11-10 11:46:36,490 INFO L226 Difference]: Without dead ends: 943 [2018-11-10 11:46:36,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:46:36,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-11-10 11:46:36,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 874. [2018-11-10 11:46:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-10 11:46:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1300 transitions. [2018-11-10 11:46:36,509 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1300 transitions. Word has length 132 [2018-11-10 11:46:36,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:36,509 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1300 transitions. [2018-11-10 11:46:36,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:46:36,509 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1300 transitions. [2018-11-10 11:46:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 11:46:36,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:36,511 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 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] [2018-11-10 11:46:36,511 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:36,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:36,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1502175526, now seen corresponding path program 1 times [2018-11-10 11:46:36,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:36,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:36,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:36,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:36,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-11-10 11:46:36,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:36,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:46:36,583 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:36,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:46:36,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:46:36,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:36,583 INFO L87 Difference]: Start difference. First operand 874 states and 1300 transitions. Second operand 4 states. [2018-11-10 11:46:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:36,906 INFO L93 Difference]: Finished difference Result 1963 states and 2916 transitions. [2018-11-10 11:46:36,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:46:36,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-11-10 11:46:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:36,908 INFO L225 Difference]: With dead ends: 1963 [2018-11-10 11:46:36,909 INFO L226 Difference]: Without dead ends: 1111 [2018-11-10 11:46:36,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:46:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2018-11-10 11:46:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 989. [2018-11-10 11:46:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2018-11-10 11:46:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1490 transitions. [2018-11-10 11:46:36,929 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1490 transitions. Word has length 132 [2018-11-10 11:46:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:36,929 INFO L481 AbstractCegarLoop]: Abstraction has 989 states and 1490 transitions. [2018-11-10 11:46:36,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:46:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1490 transitions. [2018-11-10 11:46:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 11:46:36,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:36,931 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:36,931 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:36,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:36,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1795878271, now seen corresponding path program 1 times [2018-11-10 11:46:36,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:36,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:36,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:36,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:36,932 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-10 11:46:37,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:37,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:46:37,013 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:46:37,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:46:37,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:46:37,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:46:37,013 INFO L87 Difference]: Start difference. First operand 989 states and 1490 transitions. Second operand 6 states. [2018-11-10 11:46:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:37,233 INFO L93 Difference]: Finished difference Result 1854 states and 2793 transitions. [2018-11-10 11:46:37,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:46:37,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-11-10 11:46:37,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:37,236 INFO L225 Difference]: With dead ends: 1854 [2018-11-10 11:46:37,236 INFO L226 Difference]: Without dead ends: 1062 [2018-11-10 11:46:37,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:46:37,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-11-10 11:46:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 990. [2018-11-10 11:46:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2018-11-10 11:46:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1491 transitions. [2018-11-10 11:46:37,256 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1491 transitions. Word has length 135 [2018-11-10 11:46:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:37,256 INFO L481 AbstractCegarLoop]: Abstraction has 990 states and 1491 transitions. [2018-11-10 11:46:37,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:46:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1491 transitions. [2018-11-10 11:46:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 11:46:37,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:37,258 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:37,258 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:37,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:37,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1269980539, now seen corresponding path program 1 times [2018-11-10 11:46:37,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:46:37,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:37,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:37,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:37,260 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:46:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:37,521 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 11:46:37,534 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:46:37,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:46:37,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:46:37,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:46:37,536 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:46:37,536 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:46:37,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:46:37 BoogieIcfgContainer [2018-11-10 11:46:37,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:46:37,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:46:37,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:46:37,583 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:46:37,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:31" (3/4) ... [2018-11-10 11:46:37,587 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:46:37,587 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:46:37,588 INFO L168 Benchmark]: Toolchain (without parser) took 8392.32 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 459.8 MB). Free memory was 955.4 MB in the beginning and 1.3 GB in the end (delta: -389.2 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:37,589 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:46:37,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -209.6 MB). Peak memory consumption was 202.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:37,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:37,591 INFO L168 Benchmark]: Boogie Preprocessor took 74.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:37,591 INFO L168 Benchmark]: RCFGBuilder took 1024.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.8 MB in the end (delta: 156.5 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:37,591 INFO L168 Benchmark]: TraceAbstraction took 6466.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 290.5 MB). Free memory was 989.8 MB in the beginning and 1.3 GB in the end (delta: -354.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:46:37,592 INFO L168 Benchmark]: Witness Printer took 4.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:46:37,595 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 750.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -209.6 MB). Peak memory consumption was 202.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1024.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.8 MB in the end (delta: 156.5 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6466.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 290.5 MB). Free memory was 989.8 MB in the beginning and 1.3 GB in the end (delta: -354.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1646]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1331. Possible FailurePath: [L1042] static int init = 1; [L1043] CALL static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1065] EXPR, FCALL malloc(sizeof(SSL)) [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1069] CALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1069] RET s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1070] CALL s->ctx = malloc(sizeof(SSL_CTX)) [L1070] RET s->ctx = malloc(sizeof(SSL_CTX)) [L1071] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1071] CALL s->session = malloc(sizeof(SSL_SESSION)) [L1071] RET s->session = malloc(sizeof(SSL_SESSION)) [L1072] CALL s->state = 12292 [L1072] RET s->state = 12292 [L1073] CALL s->version = __VERIFIER_nondet_int() [L1073] RET s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, SSLv3_client_data={20489:0}] [L1080] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 ; [L1093] int tmp___4 ; [L1094] int tmp___5 ; [L1095] int tmp___6 ; [L1096] int tmp___7 ; [L1097] int tmp___8 ; [L1098] long tmp___9 ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] CALL s->hit=__VERIFIER_nondet_int () [L1104] RET s->hit=__VERIFIER_nondet_int () [L1105] CALL s->state = 12292 [L1105] RET s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] CALL *tmp___0 = 0 [L1110] RET *tmp___0 = 0 [L1111] CALL, EXPR s->info_callback [L1111] RET, EXPR s->info_callback [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] CALL, EXPR s->info_callback [L1112] RET, EXPR s->info_callback [L1112] cb = s->info_callback [L1120] CALL, EXPR s->in_handshake [L1120] RET, EXPR s->in_handshake [L1120] CALL s->in_handshake += 1 [L1120] RET s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND TRUE s->state == 12292 [L1237] CALL s->new_session = 1 [L1237] RET s->new_session = 1 [L1238] CALL s->state = 4096 [L1238] RET s->state = 4096 [L1239] CALL, EXPR s->ctx [L1239] RET, EXPR s->ctx [L1239] CALL, EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] RET, EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] CALL (s->ctx)->stats.sess_connect_renegotiate += 1 [L1239] RET (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] CALL s->server = 0 [L1244] RET s->server = 0 [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={20489:0}] [L1250] CALL, EXPR s->version [L1250] RET, EXPR s->version [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] CALL s->type = 4096 [L1256] RET s->type = 4096 [L1257] CALL, EXPR s->init_buf [L1257] RET, EXPR s->init_buf [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] CALL s->state = 4368 [L1283] RET s->state = 4368 [L1284] CALL, EXPR s->ctx [L1284] RET, EXPR s->ctx [L1284] CALL, EXPR (s->ctx)->stats.sess_connect [L1284] RET, EXPR (s->ctx)->stats.sess_connect [L1284] CALL (s->ctx)->stats.sess_connect += 1 [L1284] RET (s->ctx)->stats.sess_connect += 1 [L1285] CALL s->init_num = 0 [L1285] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND TRUE s->state == 4368 [L1289] CALL s->shutdown = 0 [L1289] RET s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1296] COND FALSE !(ret <= 0) [L1301] CALL s->state = 4384 [L1301] RET s->state = 4384 [L1302] CALL s->init_num = 0 [L1302] RET s->init_num = 0 [L1303] CALL, EXPR s->bbio [L1303] RET, EXPR s->bbio [L1303] CALL, EXPR s->wbio [L1303] RET, EXPR s->wbio [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [init=1, SSLv3_client_data={20489:0}] [L1317] COND FALSE !(ret <= 0) [L1322] CALL s->hit [L1322] RET s->hit [L1322] COND FALSE !(s->hit) [L1325] CALL s->state = 4400 [L1325] RET s->state = 4400 [L1327] CALL s->init_num = 0 [L1327] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND TRUE s->state == 4400 [L1331] CALL, EXPR s->s3 [L1331] RET, EXPR s->s3 [L1331] CALL, EXPR (s->s3)->tmp.new_cipher [L1331] RET, EXPR (s->s3)->tmp.new_cipher [L1331] CALL, EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1331] RET, EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [init=1, SSLv3_client_data={20489:0}] [L1340] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={20489:0}] [L1346] CALL s->state = 4416 [L1346] RET s->state = 4416 [L1347] CALL s->init_num = 0 [L1347] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND FALSE !(s->state == 4400) [L1164] CALL, EXPR s->state [L1164] RET, EXPR s->state [L1164] COND FALSE !(s->state == 4401) [L1167] CALL, EXPR s->state [L1167] RET, EXPR s->state [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [init=1, SSLv3_client_data={20489:0}] [L1357] COND FALSE !(ret <= 0) [L1362] CALL s->state = 4432 [L1362] RET s->state = 4432 [L1363] CALL s->init_num = 0 [L1363] RET s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={20489:0}] [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND FALSE !(s->state == 4400) [L1164] CALL, EXPR s->state [L1164] RET, EXPR s->state [L1164] COND FALSE !(s->state == 4401) [L1167] CALL, EXPR s->state [L1167] RET, EXPR s->state [L1167] COND FALSE !(s->state == 4416) [L1170] CALL, EXPR s->state [L1170] RET, EXPR s->state [L1170] COND FALSE !(s->state == 4417) [L1173] CALL, EXPR s->state [L1173] RET, EXPR s->state [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={20489:0}] [L1380] COND FALSE !(ret <= 0) [L1385] CALL s->state = 4448 [L1385] RET s->state = 4448 [L1386] CALL s->init_num = 0 [L1386] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={20489:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={20489:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND FALSE !(s->state == 4400) [L1164] CALL, EXPR s->state [L1164] RET, EXPR s->state [L1164] COND FALSE !(s->state == 4401) [L1167] CALL, EXPR s->state [L1167] RET, EXPR s->state [L1167] COND FALSE !(s->state == 4416) [L1170] CALL, EXPR s->state [L1170] RET, EXPR s->state [L1170] COND FALSE !(s->state == 4417) [L1173] CALL, EXPR s->state [L1173] RET, EXPR s->state [L1173] COND FALSE !(s->state == 4432) [L1176] CALL, EXPR s->state [L1176] RET, EXPR s->state [L1176] COND FALSE !(s->state == 4433) [L1179] CALL, EXPR s->state [L1179] RET, EXPR s->state [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={20489:0}] [L1646] __VERIFIER_error() VAL [init=1, SSLv3_client_data={20489:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 143 locations, 1 error locations. UNSAFE Result, 6.4s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3536 SDtfs, 1776 SDslu, 3915 SDs, 0 SdLazy, 2305 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=990occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 1648 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2159 NumberOfCodeBlocks, 2159 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1991 ConstructedInterpolants, 0 QuantifiedInterpolants, 452180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 2589/2589 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:46:39,010 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:46:39,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:46:39,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:46:39,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:46:39,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:46:39,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:46:39,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:46:39,024 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:46:39,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:46:39,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:46:39,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:46:39,026 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:46:39,027 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:46:39,027 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:46:39,028 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:46:39,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:46:39,030 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:46:39,032 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:46:39,033 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:46:39,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:46:39,034 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:46:39,036 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:46:39,037 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:46:39,037 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:46:39,037 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:46:39,039 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:46:39,039 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:46:39,040 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:46:39,040 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:46:39,040 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:46:39,041 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:46:39,041 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:46:39,041 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:46:39,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:46:39,042 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:46:39,042 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 11:46:39,054 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:46:39,054 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:46:39,054 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:46:39,055 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:46:39,055 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:46:39,055 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:46:39,055 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:46:39,055 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:46:39,056 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:46:39,056 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:46:39,056 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:46:39,056 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:46:39,056 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:46:39,056 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:46:39,057 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:46:39,058 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 11:46:39,058 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 11:46:39,058 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:46:39,058 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:46:39,059 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:46:39,059 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:46:39,059 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:46:39,059 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:46:39,059 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:46:39,059 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:46:39,059 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:46:39,060 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:46:39,060 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:46:39,060 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 11:46:39,060 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:46:39,060 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 11:46:39,060 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 11:46:39,060 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_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9b2fdeede7b1203b845c20c562beaee69c29ce3b [2018-11-10 11:46:39,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:46:39,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:46:39,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:46:39,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:46:39,105 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:46:39,105 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-10 11:46:39,148 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/data/31016585e/0fa4d6329e2f4a8bbdace8343c0a95e3/FLAG873505237 [2018-11-10 11:46:39,530 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:46:39,531 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-10 11:46:39,542 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/data/31016585e/0fa4d6329e2f4a8bbdace8343c0a95e3/FLAG873505237 [2018-11-10 11:46:39,553 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/data/31016585e/0fa4d6329e2f4a8bbdace8343c0a95e3 [2018-11-10 11:46:39,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:46:39,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:46:39,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:46:39,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:46:39,558 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:46:39,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:46:39" (1/1) ... [2018-11-10 11:46:39,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed28e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:39, skipping insertion in model container [2018-11-10 11:46:39,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:46:39" (1/1) ... [2018-11-10 11:46:39,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:46:39,604 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:46:40,029 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:46:40,039 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:46:40,282 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:46:40,295 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:46:40,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:40 WrapperNode [2018-11-10 11:46:40,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:46:40,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:46:40,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:46:40,296 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:46:40,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:40" (1/1) ... [2018-11-10 11:46:40,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:40" (1/1) ... [2018-11-10 11:46:40,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:46:40,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:46:40,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:46:40,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:46:40,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:40" (1/1) ... [2018-11-10 11:46:40,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:40" (1/1) ... [2018-11-10 11:46:40,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:40" (1/1) ... [2018-11-10 11:46:40,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:40" (1/1) ... [2018-11-10 11:46:40,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:40" (1/1) ... [2018-11-10 11:46:40,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:40" (1/1) ... [2018-11-10 11:46:40,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:40" (1/1) ... [2018-11-10 11:46:40,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:46:40,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:46:40,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:46:40,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:46:40,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:46:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:46:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:46:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:46:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:46:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:46:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:46:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 11:46:40,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 11:46:42,908 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 11:46:42,908 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 11:46:43,730 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:46:43,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:43 BoogieIcfgContainer [2018-11-10 11:46:43,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:46:43,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:46:43,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:46:43,732 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:46:43,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:46:39" (1/3) ... [2018-11-10 11:46:43,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ce8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:46:43, skipping insertion in model container [2018-11-10 11:46:43,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:40" (2/3) ... [2018-11-10 11:46:43,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ce8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:46:43, skipping insertion in model container [2018-11-10 11:46:43,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:43" (3/3) ... [2018-11-10 11:46:43,735 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-11-10 11:46:43,740 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:46:43,744 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:46:43,755 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:46:43,777 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:46:43,777 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:46:43,778 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:46:43,778 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:46:43,778 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:46:43,778 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:46:43,778 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:46:43,778 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:46:43,778 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:46:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-11-10 11:46:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 11:46:43,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:43,795 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, 1] [2018-11-10 11:46:43,796 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:43,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:43,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1265738566, now seen corresponding path program 1 times [2018-11-10 11:46:43,803 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:46:43,803 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:46:43,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:43,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:43,960 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 11:46:43,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:43,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:43,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:43,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:43,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:43,974 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2018-11-10 11:46:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:44,042 INFO L93 Difference]: Finished difference Result 388 states and 640 transitions. [2018-11-10 11:46:44,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:44,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 11:46:44,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:44,053 INFO L225 Difference]: With dead ends: 388 [2018-11-10 11:46:44,054 INFO L226 Difference]: Without dead ends: 225 [2018-11-10 11:46:44,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-11-10 11:46:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-10 11:46:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-11-10 11:46:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-10 11:46:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 329 transitions. [2018-11-10 11:46:44,097 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 329 transitions. Word has length 31 [2018-11-10 11:46:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:44,097 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 329 transitions. [2018-11-10 11:46:44,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 329 transitions. [2018-11-10 11:46:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 11:46:44,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:44,099 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, 1, 1] [2018-11-10 11:46:44,100 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:44,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:44,100 INFO L82 PathProgramCache]: Analyzing trace with hash -186957446, now seen corresponding path program 1 times [2018-11-10 11:46:44,101 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:46:44,101 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:46:44,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:44,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:44,221 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 11:46:44,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:44,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:44,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:44,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:44,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:44,227 INFO L87 Difference]: Start difference. First operand 225 states and 329 transitions. Second operand 3 states. [2018-11-10 11:46:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:44,286 INFO L93 Difference]: Finished difference Result 436 states and 646 transitions. [2018-11-10 11:46:44,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:44,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-10 11:46:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:44,288 INFO L225 Difference]: With dead ends: 436 [2018-11-10 11:46:44,289 INFO L226 Difference]: Without dead ends: 328 [2018-11-10 11:46:44,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-11-10 11:46:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-10 11:46:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-10 11:46:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-10 11:46:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 479 transitions. [2018-11-10 11:46:44,309 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 479 transitions. Word has length 47 [2018-11-10 11:46:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:44,310 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 479 transitions. [2018-11-10 11:46:44,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 479 transitions. [2018-11-10 11:46:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 11:46:44,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:44,313 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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-11-10 11:46:44,314 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:44,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:44,314 INFO L82 PathProgramCache]: Analyzing trace with hash 435222576, now seen corresponding path program 1 times [2018-11-10 11:46:44,315 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:46:44,315 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:46:44,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:44,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 11:46:44,461 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 11:46:44,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:44,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:44,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:44,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:44,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:44,464 INFO L87 Difference]: Start difference. First operand 328 states and 479 transitions. Second operand 3 states. [2018-11-10 11:46:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:44,505 INFO L93 Difference]: Finished difference Result 644 states and 949 transitions. [2018-11-10 11:46:44,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:44,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-10 11:46:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:44,508 INFO L225 Difference]: With dead ends: 644 [2018-11-10 11:46:44,508 INFO L226 Difference]: Without dead ends: 433 [2018-11-10 11:46:44,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-11-10 11:46:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-11-10 11:46:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-11-10 11:46:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-11-10 11:46:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 632 transitions. [2018-11-10 11:46:44,544 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 632 transitions. Word has length 66 [2018-11-10 11:46:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:44,545 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 632 transitions. [2018-11-10 11:46:44,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 632 transitions. [2018-11-10 11:46:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 11:46:44,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:44,547 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 11:46:44,548 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:44,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:44,549 INFO L82 PathProgramCache]: Analyzing trace with hash -244885070, now seen corresponding path program 1 times [2018-11-10 11:46:44,551 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:46:44,551 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:46:44,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:44,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 11:46:44,725 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 11:46:44,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:44,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:44,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:44,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:44,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:44,732 INFO L87 Difference]: Start difference. First operand 433 states and 632 transitions. Second operand 3 states. [2018-11-10 11:46:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:44,800 INFO L93 Difference]: Finished difference Result 853 states and 1254 transitions. [2018-11-10 11:46:44,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:44,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-11-10 11:46:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:44,802 INFO L225 Difference]: With dead ends: 853 [2018-11-10 11:46:44,802 INFO L226 Difference]: Without dead ends: 537 [2018-11-10 11:46:44,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 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-11-10 11:46:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-11-10 11:46:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2018-11-10 11:46:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-11-10 11:46:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 784 transitions. [2018-11-10 11:46:44,817 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 784 transitions. Word has length 87 [2018-11-10 11:46:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:44,818 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 784 transitions. [2018-11-10 11:46:44,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 784 transitions. [2018-11-10 11:46:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 11:46:44,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:44,820 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:44,821 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:44,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1961911637, now seen corresponding path program 1 times [2018-11-10 11:46:44,823 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:46:44,823 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:46:44,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:45,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 11:46:45,064 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 11:46:45,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:45,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:45,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:46:45,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:45,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:45,068 INFO L87 Difference]: Start difference. First operand 537 states and 784 transitions. Second operand 3 states. [2018-11-10 11:46:45,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:45,114 INFO L93 Difference]: Finished difference Result 954 states and 1396 transitions. [2018-11-10 11:46:45,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:45,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-11-10 11:46:45,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:45,116 INFO L225 Difference]: With dead ends: 954 [2018-11-10 11:46:45,117 INFO L226 Difference]: Without dead ends: 534 [2018-11-10 11:46:45,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 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-11-10 11:46:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-11-10 11:46:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2018-11-10 11:46:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-11-10 11:46:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 774 transitions. [2018-11-10 11:46:45,130 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 774 transitions. Word has length 109 [2018-11-10 11:46:45,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:45,130 INFO L481 AbstractCegarLoop]: Abstraction has 534 states and 774 transitions. [2018-11-10 11:46:45,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:46:45,130 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 774 transitions. [2018-11-10 11:46:45,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 11:46:45,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:45,132 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:45,132 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:45,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:45,133 INFO L82 PathProgramCache]: Analyzing trace with hash -234771568, now seen corresponding path program 1 times [2018-11-10 11:46:45,133 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:46:45,134 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:46:45,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:46,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:46,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 11:46:46,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 11:46:46,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:46:46,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:46,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:46,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 11:46:46,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 11:46:46,146 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:46:46,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:46:46,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:46:46,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:46,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:46,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 11:46:46,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:46:46,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 11:46:46,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:46:46,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:46,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:46,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 11:46:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 11:46:46,196 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 11:46:46,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:46,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 11:46:46,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:46:46,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:46:46,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:46:46,201 INFO L87 Difference]: Start difference. First operand 534 states and 774 transitions. Second operand 7 states. [2018-11-10 11:46:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:47,524 INFO L93 Difference]: Finished difference Result 1429 states and 2079 transitions. [2018-11-10 11:46:47,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:46:47,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-10 11:46:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:47,528 INFO L225 Difference]: With dead ends: 1429 [2018-11-10 11:46:47,528 INFO L226 Difference]: Without dead ends: 908 [2018-11-10 11:46:47,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:46:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-11-10 11:46:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 622. [2018-11-10 11:46:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 11:46:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 918 transitions. [2018-11-10 11:46:47,551 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 918 transitions. Word has length 111 [2018-11-10 11:46:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:47,551 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 918 transitions. [2018-11-10 11:46:47,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:46:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 918 transitions. [2018-11-10 11:46:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 11:46:47,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:47,554 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:47,554 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:47,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1673686222, now seen corresponding path program 1 times [2018-11-10 11:46:47,555 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:46:47,555 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:46:47,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:48,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:48,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 11:46:48,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 11:46:48,646 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:46:48,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:46:48,649 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:46:48,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:48,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:48,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:48,669 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 11:46:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 11:46:48,709 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 11:46:48,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:48,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 11:46:48,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:46:48,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:46:48,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:46:48,713 INFO L87 Difference]: Start difference. First operand 622 states and 918 transitions. Second operand 7 states. [2018-11-10 11:46:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:51,762 INFO L93 Difference]: Finished difference Result 1441 states and 2120 transitions. [2018-11-10 11:46:51,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:46:51,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-10 11:46:51,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:51,764 INFO L225 Difference]: With dead ends: 1441 [2018-11-10 11:46:51,765 INFO L226 Difference]: Without dead ends: 832 [2018-11-10 11:46:51,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:46:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2018-11-10 11:46:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 722. [2018-11-10 11:46:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-11-10 11:46:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1090 transitions. [2018-11-10 11:46:51,781 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1090 transitions. Word has length 111 [2018-11-10 11:46:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:51,782 INFO L481 AbstractCegarLoop]: Abstraction has 722 states and 1090 transitions. [2018-11-10 11:46:51,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:46:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1090 transitions. [2018-11-10 11:46:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 11:46:51,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:51,783 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:51,783 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:51,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:51,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1350240351, now seen corresponding path program 1 times [2018-11-10 11:46:51,784 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:46:51,784 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:46:51,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:52,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:52,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 11:46:52,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 11:46:52,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:46:52,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:46:52,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:46:52,994 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:52,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:53,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:53,007 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 11:46:53,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:46:53,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 11:46:53,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:46:53,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:53,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:53,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 11:46:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 11:46:53,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:46:53,061 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 11:46:53,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:46:53,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:53,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 11:46:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 11:46:53,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:46:53,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 11:46:53,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:46:53,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:46:53,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:46:53,076 INFO L87 Difference]: Start difference. First operand 722 states and 1090 transitions. Second operand 9 states. [2018-11-10 11:46:56,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:56,527 INFO L93 Difference]: Finished difference Result 2007 states and 2971 transitions. [2018-11-10 11:46:56,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:46:56,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-11-10 11:46:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:46:56,532 INFO L225 Difference]: With dead ends: 2007 [2018-11-10 11:46:56,532 INFO L226 Difference]: Without dead ends: 1298 [2018-11-10 11:46:56,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:46:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-11-10 11:46:56,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 797. [2018-11-10 11:46:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-11-10 11:46:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1182 transitions. [2018-11-10 11:46:56,568 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1182 transitions. Word has length 127 [2018-11-10 11:46:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:46:56,568 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 1182 transitions. [2018-11-10 11:46:56,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:46:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1182 transitions. [2018-11-10 11:46:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 11:46:56,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:46:56,570 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:56,571 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:46:56,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:56,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1230758851, now seen corresponding path program 1 times [2018-11-10 11:46:56,571 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:46:56,571 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:46:56,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:57,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:57,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 11:46:57,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 11:46:57,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:46:57,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:46:57,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:46:57,773 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:57,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:57,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:57,785 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 11:46:57,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:46:57,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 11:46:57,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:46:57,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:57,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:57,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 11:46:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 11:46:57,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:46:57,845 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 11:46:57,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:46:57,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:46:57,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 11:46:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 11:46:57,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:46:57,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 11:46:57,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:46:57,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:46:57,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:46:57,888 INFO L87 Difference]: Start difference. First operand 797 states and 1182 transitions. Second operand 9 states. [2018-11-10 11:47:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:47:03,088 INFO L93 Difference]: Finished difference Result 2087 states and 3056 transitions. [2018-11-10 11:47:03,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:47:03,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-11-10 11:47:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:47:03,092 INFO L225 Difference]: With dead ends: 2087 [2018-11-10 11:47:03,092 INFO L226 Difference]: Without dead ends: 1303 [2018-11-10 11:47:03,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:47:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2018-11-10 11:47:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 806. [2018-11-10 11:47:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-11-10 11:47:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1184 transitions. [2018-11-10 11:47:03,131 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1184 transitions. Word has length 127 [2018-11-10 11:47:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:47:03,131 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1184 transitions. [2018-11-10 11:47:03,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:47:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1184 transitions. [2018-11-10 11:47:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 11:47:03,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:47:03,134 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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] [2018-11-10 11:47:03,134 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:47:03,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:47:03,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1063738688, now seen corresponding path program 1 times [2018-11-10 11:47:03,134 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:47:03,135 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:47:03,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:47:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:47:04,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:47:04,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 11:47:04,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 11:47:04,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:04,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:47:04,260 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:04,265 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:04,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:04,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:04,276 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 11:47:04,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:47:04,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 11:47:04,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:04,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:04,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:04,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 11:47:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 114 proven. 4 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 11:47:04,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:47:04,334 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 11:47:04,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:04,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:04,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 11:47:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 11:47:04,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:47:04,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 11:47:04,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:47:04,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:47:04,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:47:04,346 INFO L87 Difference]: Start difference. First operand 806 states and 1184 transitions. Second operand 9 states. [2018-11-10 11:47:09,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:47:09,764 INFO L93 Difference]: Finished difference Result 1992 states and 2885 transitions. [2018-11-10 11:47:09,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:47:09,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-11-10 11:47:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:47:09,767 INFO L225 Difference]: With dead ends: 1992 [2018-11-10 11:47:09,768 INFO L226 Difference]: Without dead ends: 1368 [2018-11-10 11:47:09,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:47:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2018-11-10 11:47:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 891. [2018-11-10 11:47:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-11-10 11:47:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1301 transitions. [2018-11-10 11:47:09,809 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1301 transitions. Word has length 127 [2018-11-10 11:47:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:47:09,809 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1301 transitions. [2018-11-10 11:47:09,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:47:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1301 transitions. [2018-11-10 11:47:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 11:47:09,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:47:09,812 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:47:09,812 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:47:09,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:47:09,812 INFO L82 PathProgramCache]: Analyzing trace with hash 380620777, now seen corresponding path program 1 times [2018-11-10 11:47:09,813 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:47:09,813 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:47:09,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:47:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:47:10,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:47:11,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 11:47:11,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 11:47:11,026 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:11,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:47:11,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:11,033 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:11,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:11,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:11,054 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 11:47:11,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:47:11,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 11:47:11,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:11,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:11,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:11,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 11:47:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 11:47:11,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:47:11,129 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 11:47:11,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:11,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:11,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 11:47:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 11:47:11,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:47:11,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 11:47:11,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:47:11,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:47:11,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:47:11,141 INFO L87 Difference]: Start difference. First operand 891 states and 1301 transitions. Second operand 9 states. [2018-11-10 11:47:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:47:16,343 INFO L93 Difference]: Finished difference Result 2262 states and 3274 transitions. [2018-11-10 11:47:16,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:47:16,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2018-11-10 11:47:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:47:16,346 INFO L225 Difference]: With dead ends: 2262 [2018-11-10 11:47:16,347 INFO L226 Difference]: Without dead ends: 1388 [2018-11-10 11:47:16,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:47:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2018-11-10 11:47:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 896. [2018-11-10 11:47:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-11-10 11:47:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1293 transitions. [2018-11-10 11:47:16,373 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1293 transitions. Word has length 129 [2018-11-10 11:47:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:47:16,373 INFO L481 AbstractCegarLoop]: Abstraction has 896 states and 1293 transitions. [2018-11-10 11:47:16,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:47:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1293 transitions. [2018-11-10 11:47:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 11:47:16,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:47:16,375 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 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] [2018-11-10 11:47:16,375 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:47:16,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:47:16,375 INFO L82 PathProgramCache]: Analyzing trace with hash 402636198, now seen corresponding path program 1 times [2018-11-10 11:47:16,376 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:47:16,376 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:47:16,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:47:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:47:17,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:47:17,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 11:47:17,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 11:47:17,573 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:17,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:47:17,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:17,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:17,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:17,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:17,597 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 11:47:17,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:47:17,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 11:47:17,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:17,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:17,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:17,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 11:47:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 120 proven. 4 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 11:47:17,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:47:17,700 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 11:47:17,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:17,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:17,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 11:47:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 11:47:17,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:47:17,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 11:47:17,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:47:17,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:47:17,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:47:17,723 INFO L87 Difference]: Start difference. First operand 896 states and 1293 transitions. Second operand 9 states. [2018-11-10 11:47:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:47:20,874 INFO L93 Difference]: Finished difference Result 2044 states and 2927 transitions. [2018-11-10 11:47:20,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:47:20,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2018-11-10 11:47:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:47:20,877 INFO L225 Difference]: With dead ends: 2044 [2018-11-10 11:47:20,877 INFO L226 Difference]: Without dead ends: 1348 [2018-11-10 11:47:20,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:47:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2018-11-10 11:47:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 901. [2018-11-10 11:47:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-11-10 11:47:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1290 transitions. [2018-11-10 11:47:20,904 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1290 transitions. Word has length 129 [2018-11-10 11:47:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:47:20,905 INFO L481 AbstractCegarLoop]: Abstraction has 901 states and 1290 transitions. [2018-11-10 11:47:20,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:47:20,905 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1290 transitions. [2018-11-10 11:47:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 11:47:20,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:47:20,906 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:47:20,906 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:47:20,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:47:20,907 INFO L82 PathProgramCache]: Analyzing trace with hash -846982255, now seen corresponding path program 1 times [2018-11-10 11:47:20,907 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:47:20,907 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:47:20,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:47:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:47:22,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:47:22,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 11:47:22,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 11:47:22,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:22,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:47:22,315 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:22,323 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:22,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:22,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:22,337 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 11:47:22,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:47:22,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 11:47:22,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:22,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:22,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:22,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 11:47:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 122 proven. 4 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 11:47:22,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:47:22,404 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 11:47:22,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:22,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:22,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 11:47:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 11:47:22,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:47:22,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 11:47:22,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:47:22,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:47:22,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:47:22,420 INFO L87 Difference]: Start difference. First operand 901 states and 1290 transitions. Second operand 9 states. [2018-11-10 11:47:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:47:25,613 INFO L93 Difference]: Finished difference Result 2266 states and 3231 transitions. [2018-11-10 11:47:25,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:47:25,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 145 [2018-11-10 11:47:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:47:25,616 INFO L225 Difference]: With dead ends: 2266 [2018-11-10 11:47:25,616 INFO L226 Difference]: Without dead ends: 1382 [2018-11-10 11:47:25,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:47:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2018-11-10 11:47:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 906. [2018-11-10 11:47:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-11-10 11:47:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1282 transitions. [2018-11-10 11:47:25,665 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1282 transitions. Word has length 145 [2018-11-10 11:47:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:47:25,666 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1282 transitions. [2018-11-10 11:47:25,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:47:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1282 transitions. [2018-11-10 11:47:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 11:47:25,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:47:25,668 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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-11-10 11:47:25,668 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:47:25,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:47:25,668 INFO L82 PathProgramCache]: Analyzing trace with hash -18715699, now seen corresponding path program 1 times [2018-11-10 11:47:25,669 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:47:25,669 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:47:25,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:47:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:47:26,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:47:26,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 11:47:27,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 11:47:27,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:27,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:47:27,005 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:27,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:27,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:27,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:27,021 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 11:47:27,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:47:27,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 11:47:27,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:27,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:27,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:27,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 11:47:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 143 proven. 2 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 11:47:27,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:47:27,080 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 11:47:27,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:27,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:27,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 11:47:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 11:47:27,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:47:27,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 11:47:27,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:47:27,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:47:27,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:47:27,096 INFO L87 Difference]: Start difference. First operand 906 states and 1282 transitions. Second operand 9 states. [2018-11-10 11:47:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:47:30,463 INFO L93 Difference]: Finished difference Result 2343 states and 3301 transitions. [2018-11-10 11:47:30,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:47:30,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 146 [2018-11-10 11:47:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:47:30,466 INFO L225 Difference]: With dead ends: 2343 [2018-11-10 11:47:30,466 INFO L226 Difference]: Without dead ends: 1454 [2018-11-10 11:47:30,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:47:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2018-11-10 11:47:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 924. [2018-11-10 11:47:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-11-10 11:47:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1313 transitions. [2018-11-10 11:47:30,518 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1313 transitions. Word has length 146 [2018-11-10 11:47:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:47:30,518 INFO L481 AbstractCegarLoop]: Abstraction has 924 states and 1313 transitions. [2018-11-10 11:47:30,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:47:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1313 transitions. [2018-11-10 11:47:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 11:47:30,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:47:30,520 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1] [2018-11-10 11:47:30,521 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:47:30,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:47:30,523 INFO L82 PathProgramCache]: Analyzing trace with hash 219718465, now seen corresponding path program 1 times [2018-11-10 11:47:30,524 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:47:30,524 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:47:30,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:47:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:47:31,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:47:31,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 11:47:31,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 11:47:31,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:31,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:31,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:31,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 11:47:31,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 11:47:32,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:47:32,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 11:47:32,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 11:47:32,034 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:47:32,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 11:47:32,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-10 11:47:32,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 41 [2018-11-10 11:47:32,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 62 [2018-11-10 11:47:32,064 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,074 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,088 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:22 [2018-11-10 11:47:32,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-10 11:47:32,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,126 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,160 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 87 [2018-11-10 11:47:32,405 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2018-11-10 11:47:32,408 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,409 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,410 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 95 [2018-11-10 11:47:32,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,495 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,496 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 70 [2018-11-10 11:47:32,505 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:24 [2018-11-10 11:47:32,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 11:47:32,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 11:47:32,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 11:47:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 202 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 11:47:32,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:47:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 172 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 11:47:32,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:47:32,689 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:47:32,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:47:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:47:32,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:47:32,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 11:47:32,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 11:47:32,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:32,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:47:32,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,934 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:9 [2018-11-10 11:47:32,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 11:47:32,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 11:47:32,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:32,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-10 11:47:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 11:47:32,992 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 11:47:33,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:47:33,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 5] total 14 [2018-11-10 11:47:33,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 11:47:33,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 11:47:33,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:47:33,011 INFO L87 Difference]: Start difference. First operand 924 states and 1313 transitions. Second operand 14 states. [2018-11-10 11:47:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:47:42,724 INFO L93 Difference]: Finished difference Result 3174 states and 4474 transitions. [2018-11-10 11:47:42,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 11:47:42,725 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 146 [2018-11-10 11:47:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:47:42,729 INFO L225 Difference]: With dead ends: 3174 [2018-11-10 11:47:42,729 INFO L226 Difference]: Without dead ends: 2267 [2018-11-10 11:47:42,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 425 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-11-10 11:47:42,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2018-11-10 11:47:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1567. [2018-11-10 11:47:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2018-11-10 11:47:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2245 transitions. [2018-11-10 11:47:42,800 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2245 transitions. Word has length 146 [2018-11-10 11:47:42,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:47:42,801 INFO L481 AbstractCegarLoop]: Abstraction has 1567 states and 2245 transitions. [2018-11-10 11:47:42,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 11:47:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2245 transitions. [2018-11-10 11:47:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 11:47:42,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:47:42,804 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:47:42,804 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:47:42,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:47:42,804 INFO L82 PathProgramCache]: Analyzing trace with hash 726456510, now seen corresponding path program 1 times [2018-11-10 11:47:42,805 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:47:42,805 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:47:42,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:47:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:47:44,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:47:44,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 11:47:44,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 11:47:44,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:44,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:47:44,254 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:44,259 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:44,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:44,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:44,272 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 11:47:44,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:47:44,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 11:47:44,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:44,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:44,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:44,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 11:47:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 127 proven. 4 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 11:47:44,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:47:44,325 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 11:47:44,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:44,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:44,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 11:47:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 11:47:44,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:47:44,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 11:47:44,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:47:44,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:47:44,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:47:44,341 INFO L87 Difference]: Start difference. First operand 1567 states and 2245 transitions. Second operand 9 states. [2018-11-10 11:47:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:47:47,368 INFO L93 Difference]: Finished difference Result 3875 states and 5520 transitions. [2018-11-10 11:47:47,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:47:47,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 146 [2018-11-10 11:47:47,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:47:47,372 INFO L225 Difference]: With dead ends: 3875 [2018-11-10 11:47:47,372 INFO L226 Difference]: Without dead ends: 2325 [2018-11-10 11:47:47,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:47:47,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2018-11-10 11:47:47,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 1567. [2018-11-10 11:47:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2018-11-10 11:47:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2218 transitions. [2018-11-10 11:47:47,427 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2218 transitions. Word has length 146 [2018-11-10 11:47:47,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:47:47,427 INFO L481 AbstractCegarLoop]: Abstraction has 1567 states and 2218 transitions. [2018-11-10 11:47:47,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:47:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2218 transitions. [2018-11-10 11:47:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 11:47:47,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:47:47,430 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1] [2018-11-10 11:47:47,430 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:47:47,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:47:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1822601610, now seen corresponding path program 1 times [2018-11-10 11:47:47,431 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:47:47,431 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:47:47,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:47:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:47:48,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:47:48,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 11:47:48,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 11:47:48,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:48,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:47:48,928 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:48,933 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:48,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:48,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:48,960 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 11:47:48,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:47:48,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 11:47:48,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:48,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:48,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:48,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 11:47:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 142 proven. 2 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 11:47:48,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:47:49,010 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 11:47:49,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:49,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:49,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 11:47:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 11:47:49,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:47:49,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 11:47:49,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:47:49,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:47:49,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:47:49,025 INFO L87 Difference]: Start difference. First operand 1567 states and 2218 transitions. Second operand 9 states. [2018-11-10 11:47:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:47:52,090 INFO L93 Difference]: Finished difference Result 3847 states and 5435 transitions. [2018-11-10 11:47:52,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:47:52,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2018-11-10 11:47:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:47:52,094 INFO L225 Difference]: With dead ends: 3847 [2018-11-10 11:47:52,094 INFO L226 Difference]: Without dead ends: 2297 [2018-11-10 11:47:52,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:47:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2018-11-10 11:47:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1575. [2018-11-10 11:47:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-11-10 11:47:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2212 transitions. [2018-11-10 11:47:52,153 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2212 transitions. Word has length 147 [2018-11-10 11:47:52,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:47:52,153 INFO L481 AbstractCegarLoop]: Abstraction has 1575 states and 2212 transitions. [2018-11-10 11:47:52,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:47:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2212 transitions. [2018-11-10 11:47:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 11:47:52,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:47:52,154 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 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-11-10 11:47:52,154 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:47:52,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:47:52,154 INFO L82 PathProgramCache]: Analyzing trace with hash -462174688, now seen corresponding path program 1 times [2018-11-10 11:47:52,155 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:47:52,155 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:47:52,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:47:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:47:53,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:47:53,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 11:47:53,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 11:47:53,582 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:47:53,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 11:47:53,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:53,589 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:53,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:53,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:53,600 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 11:47:53,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:47:53,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 11:47:53,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:53,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:53,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:53,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 11:47:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 146 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 11:47:53,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:47:53,648 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 11:47:53,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 11:47:53,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:47:53,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 11:47:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 11:47:53,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:47:53,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 11:47:53,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 11:47:53,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:47:53,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:47:53,663 INFO L87 Difference]: Start difference. First operand 1575 states and 2212 transitions. Second operand 9 states. [2018-11-10 11:47:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:47:56,804 INFO L93 Difference]: Finished difference Result 3784 states and 5322 transitions. [2018-11-10 11:47:56,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:47:56,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2018-11-10 11:47:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:47:56,808 INFO L225 Difference]: With dead ends: 3784 [2018-11-10 11:47:56,808 INFO L226 Difference]: Without dead ends: 2226 [2018-11-10 11:47:56,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:47:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2018-11-10 11:47:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 1589. [2018-11-10 11:47:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2018-11-10 11:47:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2222 transitions. [2018-11-10 11:47:56,869 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2222 transitions. Word has length 147 [2018-11-10 11:47:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:47:56,869 INFO L481 AbstractCegarLoop]: Abstraction has 1589 states and 2222 transitions. [2018-11-10 11:47:56,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 11:47:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2222 transitions. [2018-11-10 11:47:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 11:47:56,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:47:56,870 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:47:56,870 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:47:56,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:47:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1269980539, now seen corresponding path program 1 times [2018-11-10 11:47:56,871 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 11:47:56,871 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 11:47:56,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:47:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:03,021 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 11:48:03,037 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:03,038 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:03,038 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:03,038 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:03,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:03,039 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:03,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:48:03 BoogieIcfgContainer [2018-11-10 11:48:03,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:48:03,093 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:48:03,093 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:48:03,093 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:48:03,094 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:43" (3/4) ... [2018-11-10 11:48:03,096 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 11:48:03,100 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:03,100 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:03,100 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:03,100 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:03,100 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:03,100 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:03,157 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_65484e92-be84-4fd7-a282-c8b3e757f91e/bin-2019/utaipan/witness.graphml [2018-11-10 11:48:03,157 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:48:03,158 INFO L168 Benchmark]: Toolchain (without parser) took 83602.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 399.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 215.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:03,158 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:48:03,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.70 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 762.9 MB in the end (delta: 182.5 MB). Peak memory consumption was 182.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:03,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 762.9 MB in the beginning and 1.2 GB in the end (delta: -421.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:03,159 INFO L168 Benchmark]: Boogie Preprocessor took 69.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:03,159 INFO L168 Benchmark]: RCFGBuilder took 3242.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 158.3 MB). Peak memory consumption was 158.3 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:03,159 INFO L168 Benchmark]: TraceAbstraction took 79361.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -124.5 MB). Peak memory consumption was 78.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:03,160 INFO L168 Benchmark]: Witness Printer took 64.96 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:03,161 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 739.70 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 762.9 MB in the end (delta: 182.5 MB). Peak memory consumption was 182.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 122.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 762.9 MB in the beginning and 1.2 GB in the end (delta: -421.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3242.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 158.3 MB). Peak memory consumption was 158.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79361.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -124.5 MB). Peak memory consumption was 78.9 MB. Max. memory is 11.5 GB. * Witness Printer took 64.96 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1646]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] CALL static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1043] RET static SSL_METHOD SSLv3_client_data ; [L1065] EXPR, FCALL malloc(sizeof(SSL)) [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1069] CALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1069] RET s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1070] CALL s->ctx = malloc(sizeof(SSL_CTX)) [L1070] RET s->ctx = malloc(sizeof(SSL_CTX)) [L1071] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1071] CALL s->session = malloc(sizeof(SSL_SESSION)) [L1071] RET s->session = malloc(sizeof(SSL_SESSION)) [L1072] CALL s->state = 12292 [L1072] RET s->state = 12292 [L1073] CALL s->version = __VERIFIER_nondet_int() [L1073] RET s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1080] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 ; [L1093] int tmp___4 ; [L1094] int tmp___5 ; [L1095] int tmp___6 ; [L1096] int tmp___7 ; [L1097] int tmp___8 ; [L1098] long tmp___9 ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] CALL s->hit=__VERIFIER_nondet_int () [L1104] RET s->hit=__VERIFIER_nondet_int () [L1105] CALL s->state = 12292 [L1105] RET s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] CALL *tmp___0 = 0 [L1110] RET *tmp___0 = 0 [L1111] CALL, EXPR s->info_callback [L1111] RET, EXPR s->info_callback [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] CALL, EXPR s->info_callback [L1112] RET, EXPR s->info_callback [L1112] cb = s->info_callback [L1120] CALL, EXPR s->in_handshake [L1120] RET, EXPR s->in_handshake [L1120] CALL s->in_handshake += 1 [L1120] RET s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND TRUE s->state == 12292 [L1237] CALL s->new_session = 1 [L1237] RET s->new_session = 1 [L1238] CALL s->state = 4096 [L1238] RET s->state = 4096 [L1239] CALL, EXPR s->ctx [L1239] RET, EXPR s->ctx [L1239] CALL, EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] RET, EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] CALL (s->ctx)->stats.sess_connect_renegotiate += 1 [L1239] RET (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] CALL s->server = 0 [L1244] RET s->server = 0 [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1250] CALL, EXPR s->version [L1250] RET, EXPR s->version [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] CALL s->type = 4096 [L1256] RET s->type = 4096 [L1257] CALL, EXPR s->init_buf [L1257] RET, EXPR s->init_buf [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] CALL s->state = 4368 [L1283] RET s->state = 4368 [L1284] CALL, EXPR s->ctx [L1284] RET, EXPR s->ctx [L1284] CALL, EXPR (s->ctx)->stats.sess_connect [L1284] RET, EXPR (s->ctx)->stats.sess_connect [L1284] CALL (s->ctx)->stats.sess_connect += 1 [L1284] RET (s->ctx)->stats.sess_connect += 1 [L1285] CALL s->init_num = 0 [L1285] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND TRUE s->state == 4368 [L1289] CALL s->shutdown = 0 [L1289] RET s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1296] COND FALSE !(ret <= 0) [L1301] CALL s->state = 4384 [L1301] RET s->state = 4384 [L1302] CALL s->init_num = 0 [L1302] RET s->init_num = 0 [L1303] CALL, EXPR s->bbio [L1303] RET, EXPR s->bbio [L1303] CALL, EXPR s->wbio [L1303] RET, EXPR s->wbio [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1317] COND FALSE !(ret <= 0) [L1322] CALL s->hit [L1322] RET s->hit [L1322] COND FALSE !(s->hit) [L1325] CALL s->state = 4400 [L1325] RET s->state = 4400 [L1327] CALL s->init_num = 0 [L1327] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND TRUE s->state == 4400 [L1331] CALL, EXPR s->s3 [L1331] RET, EXPR s->s3 [L1331] CALL, EXPR (s->s3)->tmp.new_cipher [L1331] RET, EXPR (s->s3)->tmp.new_cipher [L1331] CALL, EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1331] RET, EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1340] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1346] CALL s->state = 4416 [L1346] RET s->state = 4416 [L1347] CALL s->init_num = 0 [L1347] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND FALSE !(s->state == 4400) [L1164] CALL, EXPR s->state [L1164] RET, EXPR s->state [L1164] COND FALSE !(s->state == 4401) [L1167] CALL, EXPR s->state [L1167] RET, EXPR s->state [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1357] COND FALSE !(ret <= 0) [L1362] CALL s->state = 4432 [L1362] RET s->state = 4432 [L1363] CALL s->init_num = 0 [L1363] RET s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND FALSE !(s->state == 4400) [L1164] CALL, EXPR s->state [L1164] RET, EXPR s->state [L1164] COND FALSE !(s->state == 4401) [L1167] CALL, EXPR s->state [L1167] RET, EXPR s->state [L1167] COND FALSE !(s->state == 4416) [L1170] CALL, EXPR s->state [L1170] RET, EXPR s->state [L1170] COND FALSE !(s->state == 4417) [L1173] CALL, EXPR s->state [L1173] RET, EXPR s->state [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1380] COND FALSE !(ret <= 0) [L1385] CALL s->state = 4448 [L1385] RET s->state = 4448 [L1386] CALL s->init_num = 0 [L1386] RET s->init_num = 0 [L1605] CALL, EXPR s->s3 [L1605] RET, EXPR s->s3 [L1605] CALL, EXPR (s->s3)->tmp.reuse_message [L1605] RET, EXPR (s->s3)->tmp.reuse_message [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1133] CALL, EXPR s->state [L1133] RET, EXPR s->state [L1133] state = s->state [L1134] CALL, EXPR s->state [L1134] RET, EXPR s->state [L1134] COND FALSE !(s->state == 12292) [L1137] CALL, EXPR s->state [L1137] RET, EXPR s->state [L1137] COND FALSE !(s->state == 16384) [L1140] CALL, EXPR s->state [L1140] RET, EXPR s->state [L1140] COND FALSE !(s->state == 4096) [L1143] CALL, EXPR s->state [L1143] RET, EXPR s->state [L1143] COND FALSE !(s->state == 20480) [L1146] CALL, EXPR s->state [L1146] RET, EXPR s->state [L1146] COND FALSE !(s->state == 4099) [L1149] CALL, EXPR s->state [L1149] RET, EXPR s->state [L1149] COND FALSE !(s->state == 4368) [L1152] CALL, EXPR s->state [L1152] RET, EXPR s->state [L1152] COND FALSE !(s->state == 4369) [L1155] CALL, EXPR s->state [L1155] RET, EXPR s->state [L1155] COND FALSE !(s->state == 4384) [L1158] CALL, EXPR s->state [L1158] RET, EXPR s->state [L1158] COND FALSE !(s->state == 4385) [L1161] CALL, EXPR s->state [L1161] RET, EXPR s->state [L1161] COND FALSE !(s->state == 4400) [L1164] CALL, EXPR s->state [L1164] RET, EXPR s->state [L1164] COND FALSE !(s->state == 4401) [L1167] CALL, EXPR s->state [L1167] RET, EXPR s->state [L1167] COND FALSE !(s->state == 4416) [L1170] CALL, EXPR s->state [L1170] RET, EXPR s->state [L1170] COND FALSE !(s->state == 4417) [L1173] CALL, EXPR s->state [L1173] RET, EXPR s->state [L1173] COND FALSE !(s->state == 4432) [L1176] CALL, EXPR s->state [L1176] RET, EXPR s->state [L1176] COND FALSE !(s->state == 4433) [L1179] CALL, EXPR s->state [L1179] RET, EXPR s->state [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={-1878917085:0}] [L1646] __VERIFIER_error() VAL [init=1, SSLv3_client_data={-1878917085:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 143 locations, 1 error locations. UNSAFE Result, 79.3s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 52.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3508 SDtfs, 8282 SDslu, 8565 SDs, 0 SdLazy, 8294 SolverSat, 1234 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 48.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3824 GetRequests, 3655 SyntacticMatches, 4 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1589occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 6633 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 14.7s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2374 NumberOfCodeBlocks, 2374 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3710 ConstructedInterpolants, 1 QuantifiedInterpolants, 1457973 SizeOfPredicates, 255 NumberOfNonLiveVariables, 13510 ConjunctsInSsa, 283 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 5276/5325 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...