/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/loops/s3_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dea210a9 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/loops/s3_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdf0cf9bd7de1f69825d4535f203da45c4edbbfc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/loops/s3_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdf0cf9bd7de1f69825d4535f203da45c4edbbfc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-dea210a [2018-11-23 15:51:00,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:51:00,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:51:00,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:51:00,358 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:51:00,359 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:51:00,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:51:00,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:51:00,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:51:00,364 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:51:00,365 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:51:00,365 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:51:00,366 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:51:00,367 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:51:00,369 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:51:00,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:51:00,370 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:51:00,373 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:51:00,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:51:00,376 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:51:00,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:51:00,379 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:51:00,381 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:51:00,382 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:51:00,382 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:51:00,383 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:51:00,384 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:51:00,385 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:51:00,385 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:51:00,387 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:51:00,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:51:00,387 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:51:00,388 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:51:00,388 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:51:00,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:51:00,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:51:00,390 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 15:51:00,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:51:00,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:51:00,406 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:51:00,406 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:51:00,407 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:51:00,407 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:51:00,407 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:51:00,407 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:51:00,407 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:51:00,408 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:51:00,408 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:51:00,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:51:00,408 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:51:00,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:51:00,409 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:51:00,410 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:51:00,410 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:51:00,410 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:51:00,410 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:51:00,411 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:51:00,411 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:51:00,412 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:51:00,412 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:51:00,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:51:00,412 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:51:00,412 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:51:00,413 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:51:00,413 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:51:00,413 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:51:00,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:51:00,413 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdf0cf9bd7de1f69825d4535f203da45c4edbbfc [2018-11-23 15:51:00,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:51:00,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:51:00,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:51:00,467 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:51:00,468 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:51:00,468 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3_false-unreach-call.i [2018-11-23 15:51:00,525 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7995c6387/c2408353207d4c33befeec6b03a875db/FLAGfa19c5b62 [2018-11-23 15:51:00,999 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:51:01,000 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3_false-unreach-call.i [2018-11-23 15:51:01,016 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7995c6387/c2408353207d4c33befeec6b03a875db/FLAGfa19c5b62 [2018-11-23 15:51:01,496 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7995c6387/c2408353207d4c33befeec6b03a875db [2018-11-23 15:51:01,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:51:01,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:51:01,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:51:01,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:51:01,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:51:01,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:01" (1/1) ... [2018-11-23 15:51:01,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110faddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:01, skipping insertion in model container [2018-11-23 15:51:01,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:01" (1/1) ... [2018-11-23 15:51:01,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:51:01,576 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:51:01,952 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:51:02,025 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:51:02,124 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:51:02,148 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:51:02,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:02 WrapperNode [2018-11-23 15:51:02,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:51:02,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:51:02,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:51:02,150 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:51:02,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:02" (1/1) ... [2018-11-23 15:51:02,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:02" (1/1) ... [2018-11-23 15:51:02,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:51:02,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:51:02,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:51:02,198 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:51:02,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:02" (1/1) ... [2018-11-23 15:51:02,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:02" (1/1) ... [2018-11-23 15:51:02,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:02" (1/1) ... [2018-11-23 15:51:02,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:02" (1/1) ... [2018-11-23 15:51:02,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:02" (1/1) ... [2018-11-23 15:51:02,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:02" (1/1) ... [2018-11-23 15:51:02,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:02" (1/1) ... [2018-11-23 15:51:02,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:51:02,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:51:02,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:51:02,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:51:02,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 15:51:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 15:51:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 15:51:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:51:02,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:51:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 15:51:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 15:51:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:51:02,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:51:02,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:51:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:51:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-23 15:51:02,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-23 15:51:02,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:51:02,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:51:02,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:51:02,643 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 15:51:02,643 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 15:51:03,399 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:51:03,399 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 15:51:03,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:03 BoogieIcfgContainer [2018-11-23 15:51:03,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:51:03,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:51:03,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:51:03,405 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:51:03,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:51:01" (1/3) ... [2018-11-23 15:51:03,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121f09f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:51:03, skipping insertion in model container [2018-11-23 15:51:03,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:02" (2/3) ... [2018-11-23 15:51:03,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121f09f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:51:03, skipping insertion in model container [2018-11-23 15:51:03,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:03" (3/3) ... [2018-11-23 15:51:03,408 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-11-23 15:51:03,418 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:51:03,426 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:51:03,444 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:51:03,473 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:51:03,474 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:51:03,474 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:51:03,474 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:51:03,474 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:51:03,475 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:51:03,475 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:51:03,475 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:51:03,475 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:51:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-11-23 15:51:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 15:51:03,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:03,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:03,504 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:03,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1513562951, now seen corresponding path program 1 times [2018-11-23 15:51:03,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:03,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:03,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:03,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:03,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:03,785 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-23 15:51:03,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:03,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:51:03,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:51:03,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:51:03,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:03,811 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2018-11-23 15:51:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:03,928 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2018-11-23 15:51:03,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:51:03,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 15:51:03,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:03,945 INFO L225 Difference]: With dead ends: 385 [2018-11-23 15:51:03,945 INFO L226 Difference]: Without dead ends: 223 [2018-11-23 15:51:03,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-23 15:51:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-11-23 15:51:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-23 15:51:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2018-11-23 15:51:04,012 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2018-11-23 15:51:04,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:04,013 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2018-11-23 15:51:04,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:51:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2018-11-23 15:51:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 15:51:04,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:04,016 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:04,017 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:04,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:04,017 INFO L82 PathProgramCache]: Analyzing trace with hash -959560751, now seen corresponding path program 1 times [2018-11-23 15:51:04,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:04,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:04,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:04,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:04,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:04,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:04,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:51:04,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:51:04,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:51:04,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:04,134 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2018-11-23 15:51:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:04,221 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2018-11-23 15:51:04,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:51:04,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-23 15:51:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:04,226 INFO L225 Difference]: With dead ends: 432 [2018-11-23 15:51:04,226 INFO L226 Difference]: Without dead ends: 325 [2018-11-23 15:51:04,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-23 15:51:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-11-23 15:51:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-23 15:51:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2018-11-23 15:51:04,254 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2018-11-23 15:51:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:04,255 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2018-11-23 15:51:04,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:51:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2018-11-23 15:51:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 15:51:04,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:04,260 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:04,260 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:04,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:04,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1822634295, now seen corresponding path program 1 times [2018-11-23 15:51:04,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:04,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:04,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:04,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:04,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:04,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:04,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:04,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:04,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:04,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:04,413 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2018-11-23 15:51:04,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:04,994 INFO L93 Difference]: Finished difference Result 825 states and 1216 transitions. [2018-11-23 15:51:04,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:04,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-23 15:51:04,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:04,998 INFO L225 Difference]: With dead ends: 825 [2018-11-23 15:51:04,998 INFO L226 Difference]: Without dead ends: 513 [2018-11-23 15:51:05,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-11-23 15:51:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2018-11-23 15:51:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-11-23 15:51:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2018-11-23 15:51:05,026 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2018-11-23 15:51:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:05,026 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2018-11-23 15:51:05,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2018-11-23 15:51:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 15:51:05,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:05,030 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:05,030 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:05,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1956647801, now seen corresponding path program 1 times [2018-11-23 15:51:05,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:05,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:05,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:05,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:05,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:05,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:05,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:05,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:05,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:05,152 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2018-11-23 15:51:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:05,476 INFO L93 Difference]: Finished difference Result 821 states and 1232 transitions. [2018-11-23 15:51:05,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:05,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-23 15:51:05,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:05,480 INFO L225 Difference]: With dead ends: 821 [2018-11-23 15:51:05,480 INFO L226 Difference]: Without dead ends: 459 [2018-11-23 15:51:05,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-11-23 15:51:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2018-11-23 15:51:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-11-23 15:51:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2018-11-23 15:51:05,501 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2018-11-23 15:51:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:05,502 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2018-11-23 15:51:05,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2018-11-23 15:51:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 15:51:05,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:05,504 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-11-23 15:51:05,505 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:05,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash -671506196, now seen corresponding path program 1 times [2018-11-23 15:51:05,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:05,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:05,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:05,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:05,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:05,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:05,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:05,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:05,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:05,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:05,613 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2018-11-23 15:51:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:06,073 INFO L93 Difference]: Finished difference Result 949 states and 1429 transitions. [2018-11-23 15:51:06,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:06,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-23 15:51:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:06,077 INFO L225 Difference]: With dead ends: 949 [2018-11-23 15:51:06,077 INFO L226 Difference]: Without dead ends: 547 [2018-11-23 15:51:06,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-11-23 15:51:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2018-11-23 15:51:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-23 15:51:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2018-11-23 15:51:06,090 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2018-11-23 15:51:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:06,090 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2018-11-23 15:51:06,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2018-11-23 15:51:06,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 15:51:06,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:06,092 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-11-23 15:51:06,092 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:06,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:06,093 INFO L82 PathProgramCache]: Analyzing trace with hash 653887364, now seen corresponding path program 1 times [2018-11-23 15:51:06,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:06,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:06,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:06,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:06,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:06,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:06,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:06,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:06,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:06,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:06,173 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2018-11-23 15:51:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:06,600 INFO L93 Difference]: Finished difference Result 951 states and 1429 transitions. [2018-11-23 15:51:06,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:06,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-23 15:51:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:06,604 INFO L225 Difference]: With dead ends: 951 [2018-11-23 15:51:06,604 INFO L226 Difference]: Without dead ends: 547 [2018-11-23 15:51:06,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-11-23 15:51:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2018-11-23 15:51:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-23 15:51:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2018-11-23 15:51:06,618 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2018-11-23 15:51:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:06,619 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2018-11-23 15:51:06,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2018-11-23 15:51:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 15:51:06,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:06,621 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-11-23 15:51:06,621 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:06,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1208805305, now seen corresponding path program 1 times [2018-11-23 15:51:06,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:06,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:06,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:06,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:06,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:06,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:06,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:06,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:06,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:06,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:06,703 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2018-11-23 15:51:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:07,122 INFO L93 Difference]: Finished difference Result 943 states and 1417 transitions. [2018-11-23 15:51:07,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:07,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-23 15:51:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:07,126 INFO L225 Difference]: With dead ends: 943 [2018-11-23 15:51:07,126 INFO L226 Difference]: Without dead ends: 537 [2018-11-23 15:51:07,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-11-23 15:51:07,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2018-11-23 15:51:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2018-11-23 15:51:07,145 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2018-11-23 15:51:07,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:07,146 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2018-11-23 15:51:07,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2018-11-23 15:51:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 15:51:07,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:07,148 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:07,148 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:07,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:07,148 INFO L82 PathProgramCache]: Analyzing trace with hash -784316286, now seen corresponding path program 1 times [2018-11-23 15:51:07,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:07,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:07,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:07,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:07,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:07,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:07,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:07,226 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand 4 states. [2018-11-23 15:51:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:07,619 INFO L93 Difference]: Finished difference Result 943 states and 1415 transitions. [2018-11-23 15:51:07,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:07,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-23 15:51:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:07,623 INFO L225 Difference]: With dead ends: 943 [2018-11-23 15:51:07,623 INFO L226 Difference]: Without dead ends: 535 [2018-11-23 15:51:07,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-23 15:51:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-11-23 15:51:07,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2018-11-23 15:51:07,641 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2018-11-23 15:51:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:07,641 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2018-11-23 15:51:07,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2018-11-23 15:51:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 15:51:07,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:07,643 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:07,643 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:07,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:07,644 INFO L82 PathProgramCache]: Analyzing trace with hash -802971744, now seen corresponding path program 1 times [2018-11-23 15:51:07,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:07,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:07,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:07,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:07,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:07,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:07,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:07,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:07,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:07,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:07,713 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand 4 states. [2018-11-23 15:51:08,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:08,086 INFO L93 Difference]: Finished difference Result 943 states and 1411 transitions. [2018-11-23 15:51:08,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:08,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-23 15:51:08,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:08,090 INFO L225 Difference]: With dead ends: 943 [2018-11-23 15:51:08,090 INFO L226 Difference]: Without dead ends: 535 [2018-11-23 15:51:08,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-23 15:51:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-11-23 15:51:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2018-11-23 15:51:08,109 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2018-11-23 15:51:08,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:08,109 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2018-11-23 15:51:08,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2018-11-23 15:51:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 15:51:08,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:08,111 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:08,111 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:08,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:08,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1508472381, now seen corresponding path program 1 times [2018-11-23 15:51:08,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:08,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:08,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:08,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:08,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:08,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:08,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:08,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:08,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:08,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:08,188 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2018-11-23 15:51:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:08,585 INFO L93 Difference]: Finished difference Result 794 states and 1181 transitions. [2018-11-23 15:51:08,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:08,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-23 15:51:08,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:08,589 INFO L225 Difference]: With dead ends: 794 [2018-11-23 15:51:08,589 INFO L226 Difference]: Without dead ends: 535 [2018-11-23 15:51:08,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-23 15:51:08,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-11-23 15:51:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2018-11-23 15:51:08,611 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2018-11-23 15:51:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:08,611 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2018-11-23 15:51:08,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2018-11-23 15:51:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 15:51:08,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:08,614 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:08,614 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:08,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:08,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1665283844, now seen corresponding path program 1 times [2018-11-23 15:51:08,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:08,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:08,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:08,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:08,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:08,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:08,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:08,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:08,716 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand 4 states. [2018-11-23 15:51:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:09,010 INFO L93 Difference]: Finished difference Result 871 states and 1296 transitions. [2018-11-23 15:51:09,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:09,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-23 15:51:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:09,013 INFO L225 Difference]: With dead ends: 871 [2018-11-23 15:51:09,013 INFO L226 Difference]: Without dead ends: 463 [2018-11-23 15:51:09,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-23 15:51:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-11-23 15:51:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2018-11-23 15:51:09,030 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2018-11-23 15:51:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:09,031 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2018-11-23 15:51:09,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2018-11-23 15:51:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 15:51:09,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:09,032 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:09,033 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:09,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1646628386, now seen corresponding path program 1 times [2018-11-23 15:51:09,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:09,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:09,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:09,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:09,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:09,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:09,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:09,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:09,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:09,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:09,105 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2018-11-23 15:51:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:09,546 INFO L93 Difference]: Finished difference Result 871 states and 1292 transitions. [2018-11-23 15:51:09,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:09,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-23 15:51:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:09,550 INFO L225 Difference]: With dead ends: 871 [2018-11-23 15:51:09,550 INFO L226 Difference]: Without dead ends: 463 [2018-11-23 15:51:09,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-23 15:51:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-11-23 15:51:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2018-11-23 15:51:09,564 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2018-11-23 15:51:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:09,564 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2018-11-23 15:51:09,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2018-11-23 15:51:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 15:51:09,566 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:09,566 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:09,566 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:09,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash 941127749, now seen corresponding path program 1 times [2018-11-23 15:51:09,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:09,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:09,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:09,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:09,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:09,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:09,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:09,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:09,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:09,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:09,639 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand 4 states. [2018-11-23 15:51:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:09,905 INFO L93 Difference]: Finished difference Result 722 states and 1065 transitions. [2018-11-23 15:51:09,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:09,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-23 15:51:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:09,908 INFO L225 Difference]: With dead ends: 722 [2018-11-23 15:51:09,908 INFO L226 Difference]: Without dead ends: 463 [2018-11-23 15:51:09,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-23 15:51:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-11-23 15:51:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2018-11-23 15:51:09,925 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2018-11-23 15:51:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:09,925 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2018-11-23 15:51:09,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2018-11-23 15:51:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 15:51:09,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:09,927 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:09,927 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:09,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:09,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1290131619, now seen corresponding path program 1 times [2018-11-23 15:51:09,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:09,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:09,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:09,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:09,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:10,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:10,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:10,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:10,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:10,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:10,002 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand 4 states. [2018-11-23 15:51:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:10,380 INFO L93 Difference]: Finished difference Result 943 states and 1391 transitions. [2018-11-23 15:51:10,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:10,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-23 15:51:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:10,384 INFO L225 Difference]: With dead ends: 943 [2018-11-23 15:51:10,384 INFO L226 Difference]: Without dead ends: 535 [2018-11-23 15:51:10,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-23 15:51:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-11-23 15:51:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2018-11-23 15:51:10,402 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2018-11-23 15:51:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:10,402 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2018-11-23 15:51:10,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2018-11-23 15:51:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 15:51:10,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:10,404 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:10,404 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:10,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:10,405 INFO L82 PathProgramCache]: Analyzing trace with hash 765876928, now seen corresponding path program 1 times [2018-11-23 15:51:10,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:10,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:10,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:10,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:10,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:10,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:10,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:10,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:10,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:10,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:10,469 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2018-11-23 15:51:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:10,811 INFO L93 Difference]: Finished difference Result 788 states and 1159 transitions. [2018-11-23 15:51:10,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:10,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-23 15:51:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:10,814 INFO L225 Difference]: With dead ends: 788 [2018-11-23 15:51:10,815 INFO L226 Difference]: Without dead ends: 529 [2018-11-23 15:51:10,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-23 15:51:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2018-11-23 15:51:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2018-11-23 15:51:10,832 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2018-11-23 15:51:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:10,832 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2018-11-23 15:51:10,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2018-11-23 15:51:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 15:51:10,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:10,834 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:10,834 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:10,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1633028379, now seen corresponding path program 1 times [2018-11-23 15:51:10,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:10,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:10,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:10,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:10,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:10,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:10,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:10,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:10,906 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand 4 states. [2018-11-23 15:51:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:11,161 INFO L93 Difference]: Finished difference Result 871 states and 1276 transitions. [2018-11-23 15:51:11,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:11,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-23 15:51:11,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:11,164 INFO L225 Difference]: With dead ends: 871 [2018-11-23 15:51:11,164 INFO L226 Difference]: Without dead ends: 463 [2018-11-23 15:51:11,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-23 15:51:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-11-23 15:51:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2018-11-23 15:51:11,181 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2018-11-23 15:51:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:11,181 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2018-11-23 15:51:11,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2018-11-23 15:51:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 15:51:11,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:11,183 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:11,183 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:11,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:11,184 INFO L82 PathProgramCache]: Analyzing trace with hash -605930370, now seen corresponding path program 1 times [2018-11-23 15:51:11,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:11,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:11,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:11,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:11,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:11,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:11,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:11,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:11,242 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand 4 states. [2018-11-23 15:51:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:11,485 INFO L93 Difference]: Finished difference Result 716 states and 1046 transitions. [2018-11-23 15:51:11,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:11,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-23 15:51:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:11,488 INFO L225 Difference]: With dead ends: 716 [2018-11-23 15:51:11,488 INFO L226 Difference]: Without dead ends: 457 [2018-11-23 15:51:11,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-23 15:51:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2018-11-23 15:51:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2018-11-23 15:51:11,507 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2018-11-23 15:51:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:11,507 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2018-11-23 15:51:11,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2018-11-23 15:51:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 15:51:11,509 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:11,510 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-11-23 15:51:11,510 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:11,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:11,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1753186171, now seen corresponding path program 1 times [2018-11-23 15:51:11,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:11,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:11,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:11,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:11,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:11,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:11,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:11,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:11,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:11,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:11,595 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand 4 states. [2018-11-23 15:51:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:12,001 INFO L93 Difference]: Finished difference Result 937 states and 1368 transitions. [2018-11-23 15:51:12,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:12,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-23 15:51:12,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:12,004 INFO L225 Difference]: With dead ends: 937 [2018-11-23 15:51:12,004 INFO L226 Difference]: Without dead ends: 529 [2018-11-23 15:51:12,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-23 15:51:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2018-11-23 15:51:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2018-11-23 15:51:12,017 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2018-11-23 15:51:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:12,017 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2018-11-23 15:51:12,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2018-11-23 15:51:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 15:51:12,019 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:12,019 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-11-23 15:51:12,019 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:12,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1329539449, now seen corresponding path program 1 times [2018-11-23 15:51:12,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:12,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:12,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:12,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:12,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:12,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:12,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:12,085 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand 4 states. [2018-11-23 15:51:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:12,332 INFO L93 Difference]: Finished difference Result 865 states and 1257 transitions. [2018-11-23 15:51:12,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:12,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-23 15:51:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:12,336 INFO L225 Difference]: With dead ends: 865 [2018-11-23 15:51:12,336 INFO L226 Difference]: Without dead ends: 457 [2018-11-23 15:51:12,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-23 15:51:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2018-11-23 15:51:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2018-11-23 15:51:12,348 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2018-11-23 15:51:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:12,348 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2018-11-23 15:51:12,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2018-11-23 15:51:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 15:51:12,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:12,350 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:12,350 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:12,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:12,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1468975710, now seen corresponding path program 1 times [2018-11-23 15:51:12,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:12,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:12,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:12,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:12,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:12,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:12,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:12,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:12,411 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand 4 states. [2018-11-23 15:51:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:12,742 INFO L93 Difference]: Finished difference Result 919 states and 1338 transitions. [2018-11-23 15:51:12,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:12,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-23 15:51:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:12,746 INFO L225 Difference]: With dead ends: 919 [2018-11-23 15:51:12,746 INFO L226 Difference]: Without dead ends: 511 [2018-11-23 15:51:12,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-11-23 15:51:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2018-11-23 15:51:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2018-11-23 15:51:12,762 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2018-11-23 15:51:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:12,762 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2018-11-23 15:51:12,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2018-11-23 15:51:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 15:51:12,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:12,764 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 15:51:12,764 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:12,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1134564595, now seen corresponding path program 1 times [2018-11-23 15:51:12,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:12,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:12,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:12,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:12,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:12,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:12,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:12,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:12,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:12,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:12,818 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand 4 states. [2018-11-23 15:51:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:13,158 INFO L93 Difference]: Finished difference Result 919 states and 1334 transitions. [2018-11-23 15:51:13,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:13,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-23 15:51:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:13,161 INFO L225 Difference]: With dead ends: 919 [2018-11-23 15:51:13,161 INFO L226 Difference]: Without dead ends: 511 [2018-11-23 15:51:13,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-11-23 15:51:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2018-11-23 15:51:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2018-11-23 15:51:13,179 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2018-11-23 15:51:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:13,180 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2018-11-23 15:51:13,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2018-11-23 15:51:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 15:51:13,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:13,182 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:13,182 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:13,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1220829216, now seen corresponding path program 1 times [2018-11-23 15:51:13,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:13,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:13,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:13,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:13,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:13,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:13,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:13,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:13,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:13,255 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand 4 states. [2018-11-23 15:51:13,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:13,487 INFO L93 Difference]: Finished difference Result 847 states and 1223 transitions. [2018-11-23 15:51:13,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:13,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-23 15:51:13,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:13,491 INFO L225 Difference]: With dead ends: 847 [2018-11-23 15:51:13,491 INFO L226 Difference]: Without dead ends: 439 [2018-11-23 15:51:13,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-11-23 15:51:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2018-11-23 15:51:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-23 15:51:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2018-11-23 15:51:13,508 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2018-11-23 15:51:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:13,509 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2018-11-23 15:51:13,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2018-11-23 15:51:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 15:51:13,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:13,511 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 15:51:13,511 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:13,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:13,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1382711089, now seen corresponding path program 1 times [2018-11-23 15:51:13,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:13,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:13,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:13,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:13,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 15:51:13,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:13,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:51:13,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:51:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:51:13,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:13,561 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2018-11-23 15:51:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:13,599 INFO L93 Difference]: Finished difference Result 831 states and 1204 transitions. [2018-11-23 15:51:13,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:51:13,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-23 15:51:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:13,603 INFO L225 Difference]: With dead ends: 831 [2018-11-23 15:51:13,603 INFO L226 Difference]: Without dead ends: 574 [2018-11-23 15:51:13,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-11-23 15:51:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-11-23 15:51:13,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-23 15:51:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 827 transitions. [2018-11-23 15:51:13,623 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 827 transitions. Word has length 81 [2018-11-23 15:51:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:13,623 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 827 transitions. [2018-11-23 15:51:13,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:51:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 827 transitions. [2018-11-23 15:51:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 15:51:13,625 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:13,625 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:13,626 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:13,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:13,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1024261319, now seen corresponding path program 1 times [2018-11-23 15:51:13,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:13,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:13,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:13,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:13,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 15:51:13,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:13,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:51:13,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:51:13,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:51:13,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:13,672 INFO L87 Difference]: Start difference. First operand 574 states and 827 transitions. Second operand 3 states. [2018-11-23 15:51:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:13,709 INFO L93 Difference]: Finished difference Result 729 states and 1052 transitions. [2018-11-23 15:51:13,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:51:13,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-23 15:51:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:13,712 INFO L225 Difference]: With dead ends: 729 [2018-11-23 15:51:13,712 INFO L226 Difference]: Without dead ends: 727 [2018-11-23 15:51:13,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-11-23 15:51:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2018-11-23 15:51:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-11-23 15:51:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1049 transitions. [2018-11-23 15:51:13,735 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1049 transitions. Word has length 83 [2018-11-23 15:51:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:13,735 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 1049 transitions. [2018-11-23 15:51:13,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:51:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1049 transitions. [2018-11-23 15:51:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 15:51:13,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:13,737 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:13,738 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:13,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:13,738 INFO L82 PathProgramCache]: Analyzing trace with hash 934069236, now seen corresponding path program 1 times [2018-11-23 15:51:13,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:13,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:13,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:13,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:13,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-23 15:51:13,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:13,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:51:13,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:51:13,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:51:13,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:13,789 INFO L87 Difference]: Start difference. First operand 727 states and 1049 transitions. Second operand 3 states. [2018-11-23 15:51:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:13,834 INFO L93 Difference]: Finished difference Result 1287 states and 1862 transitions. [2018-11-23 15:51:13,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:51:13,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-23 15:51:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:13,838 INFO L225 Difference]: With dead ends: 1287 [2018-11-23 15:51:13,838 INFO L226 Difference]: Without dead ends: 724 [2018-11-23 15:51:13,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-11-23 15:51:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2018-11-23 15:51:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-23 15:51:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1039 transitions. [2018-11-23 15:51:13,859 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1039 transitions. Word has length 104 [2018-11-23 15:51:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:13,860 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1039 transitions. [2018-11-23 15:51:13,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:51:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1039 transitions. [2018-11-23 15:51:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 15:51:13,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:13,862 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:13,862 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:13,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash -148840977, now seen corresponding path program 1 times [2018-11-23 15:51:13,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:13,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:13,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-23 15:51:13,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:13,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:13,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:13,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:13,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:13,948 INFO L87 Difference]: Start difference. First operand 724 states and 1039 transitions. Second operand 4 states. [2018-11-23 15:51:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:14,283 INFO L93 Difference]: Finished difference Result 1692 states and 2439 transitions. [2018-11-23 15:51:14,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:14,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-11-23 15:51:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:14,288 INFO L225 Difference]: With dead ends: 1692 [2018-11-23 15:51:14,288 INFO L226 Difference]: Without dead ends: 981 [2018-11-23 15:51:14,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-11-23 15:51:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 844. [2018-11-23 15:51:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-23 15:51:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1249 transitions. [2018-11-23 15:51:14,309 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1249 transitions. Word has length 106 [2018-11-23 15:51:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:14,310 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1249 transitions. [2018-11-23 15:51:14,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1249 transitions. [2018-11-23 15:51:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 15:51:14,312 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:14,312 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:14,312 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:14,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:14,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1084285646, now seen corresponding path program 1 times [2018-11-23 15:51:14,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:14,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:14,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:14,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:14,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-23 15:51:14,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:14,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:14,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:14,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:14,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:14,454 INFO L87 Difference]: Start difference. First operand 844 states and 1249 transitions. Second operand 4 states. [2018-11-23 15:51:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:14,819 INFO L93 Difference]: Finished difference Result 1807 states and 2639 transitions. [2018-11-23 15:51:14,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:14,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-11-23 15:51:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:14,826 INFO L225 Difference]: With dead ends: 1807 [2018-11-23 15:51:14,827 INFO L226 Difference]: Without dead ends: 976 [2018-11-23 15:51:14,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-11-23 15:51:14,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2018-11-23 15:51:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-23 15:51:14,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1244 transitions. [2018-11-23 15:51:14,856 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1244 transitions. Word has length 121 [2018-11-23 15:51:14,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:14,856 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1244 transitions. [2018-11-23 15:51:14,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:14,856 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1244 transitions. [2018-11-23 15:51:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 15:51:14,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:14,859 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:14,859 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:14,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:14,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1832311600, now seen corresponding path program 1 times [2018-11-23 15:51:14,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:14,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:14,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:14,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:14,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-23 15:51:14,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:14,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:14,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:14,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:14,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:14,950 INFO L87 Difference]: Start difference. First operand 844 states and 1244 transitions. Second operand 4 states. [2018-11-23 15:51:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:15,245 INFO L93 Difference]: Finished difference Result 1807 states and 2629 transitions. [2018-11-23 15:51:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:15,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-11-23 15:51:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:15,249 INFO L225 Difference]: With dead ends: 1807 [2018-11-23 15:51:15,250 INFO L226 Difference]: Without dead ends: 976 [2018-11-23 15:51:15,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:15,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-11-23 15:51:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2018-11-23 15:51:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-23 15:51:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1239 transitions. [2018-11-23 15:51:15,279 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1239 transitions. Word has length 121 [2018-11-23 15:51:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:15,279 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1239 transitions. [2018-11-23 15:51:15,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1239 transitions. [2018-11-23 15:51:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 15:51:15,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:15,282 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:15,282 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:15,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1213590989, now seen corresponding path program 1 times [2018-11-23 15:51:15,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:15,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:15,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:15,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:15,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-23 15:51:15,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:15,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:15,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:15,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:15,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:15,366 INFO L87 Difference]: Start difference. First operand 844 states and 1239 transitions. Second operand 4 states. [2018-11-23 15:51:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:15,615 INFO L93 Difference]: Finished difference Result 1638 states and 2411 transitions. [2018-11-23 15:51:15,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:15,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-11-23 15:51:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:15,620 INFO L225 Difference]: With dead ends: 1638 [2018-11-23 15:51:15,620 INFO L226 Difference]: Without dead ends: 982 [2018-11-23 15:51:15,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2018-11-23 15:51:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 916. [2018-11-23 15:51:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-11-23 15:51:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1359 transitions. [2018-11-23 15:51:15,644 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1359 transitions. Word has length 121 [2018-11-23 15:51:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:15,644 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1359 transitions. [2018-11-23 15:51:15,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1359 transitions. [2018-11-23 15:51:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 15:51:15,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:15,646 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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-23 15:51:15,647 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:15,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1233245309, now seen corresponding path program 1 times [2018-11-23 15:51:15,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:15,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:15,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:15,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:15,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-23 15:51:15,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:15,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:15,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:15,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:15,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:15,726 INFO L87 Difference]: Start difference. First operand 916 states and 1359 transitions. Second operand 4 states. [2018-11-23 15:51:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:15,970 INFO L93 Difference]: Finished difference Result 1951 states and 2859 transitions. [2018-11-23 15:51:15,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:15,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-11-23 15:51:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:15,976 INFO L225 Difference]: With dead ends: 1951 [2018-11-23 15:51:15,976 INFO L226 Difference]: Without dead ends: 1048 [2018-11-23 15:51:15,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-11-23 15:51:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2018-11-23 15:51:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-11-23 15:51:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1354 transitions. [2018-11-23 15:51:16,007 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1354 transitions. Word has length 122 [2018-11-23 15:51:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:16,008 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1354 transitions. [2018-11-23 15:51:16,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1354 transitions. [2018-11-23 15:51:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 15:51:16,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:16,010 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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-23 15:51:16,010 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:16,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:16,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2124457781, now seen corresponding path program 1 times [2018-11-23 15:51:16,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:16,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:16,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-23 15:51:16,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:16,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:16,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:16,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:16,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:16,084 INFO L87 Difference]: Start difference. First operand 916 states and 1354 transitions. Second operand 4 states. [2018-11-23 15:51:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:16,346 INFO L93 Difference]: Finished difference Result 1951 states and 2849 transitions. [2018-11-23 15:51:16,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:16,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-11-23 15:51:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:16,352 INFO L225 Difference]: With dead ends: 1951 [2018-11-23 15:51:16,352 INFO L226 Difference]: Without dead ends: 1048 [2018-11-23 15:51:16,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-11-23 15:51:16,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2018-11-23 15:51:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-11-23 15:51:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1349 transitions. [2018-11-23 15:51:16,382 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1349 transitions. Word has length 123 [2018-11-23 15:51:16,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:16,383 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1349 transitions. [2018-11-23 15:51:16,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1349 transitions. [2018-11-23 15:51:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 15:51:16,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:16,385 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:16,385 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:16,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:16,386 INFO L82 PathProgramCache]: Analyzing trace with hash 805588424, now seen corresponding path program 1 times [2018-11-23 15:51:16,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:16,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:16,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:16,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:16,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-23 15:51:16,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:16,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:16,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:16,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:16,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:16,464 INFO L87 Difference]: Start difference. First operand 916 states and 1349 transitions. Second operand 4 states. [2018-11-23 15:51:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:16,711 INFO L93 Difference]: Finished difference Result 1906 states and 2784 transitions. [2018-11-23 15:51:16,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:16,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-11-23 15:51:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:16,715 INFO L225 Difference]: With dead ends: 1906 [2018-11-23 15:51:16,715 INFO L226 Difference]: Without dead ends: 1003 [2018-11-23 15:51:16,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-23 15:51:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 916. [2018-11-23 15:51:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-11-23 15:51:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1344 transitions. [2018-11-23 15:51:16,743 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1344 transitions. Word has length 124 [2018-11-23 15:51:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:16,744 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1344 transitions. [2018-11-23 15:51:16,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1344 transitions. [2018-11-23 15:51:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 15:51:16,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:16,746 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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] [2018-11-23 15:51:16,746 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:16,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1158112039, now seen corresponding path program 1 times [2018-11-23 15:51:16,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:16,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:16,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-23 15:51:16,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:16,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:51:16,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:51:16,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:51:16,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:51:16,825 INFO L87 Difference]: Start difference. First operand 916 states and 1344 transitions. Second operand 4 states. [2018-11-23 15:51:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:17,141 INFO L93 Difference]: Finished difference Result 2051 states and 3014 transitions. [2018-11-23 15:51:17,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:51:17,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-11-23 15:51:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:17,146 INFO L225 Difference]: With dead ends: 2051 [2018-11-23 15:51:17,146 INFO L226 Difference]: Without dead ends: 1148 [2018-11-23 15:51:17,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:51:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2018-11-23 15:51:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1026. [2018-11-23 15:51:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2018-11-23 15:51:17,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1534 transitions. [2018-11-23 15:51:17,193 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1534 transitions. Word has length 124 [2018-11-23 15:51:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:17,194 INFO L480 AbstractCegarLoop]: Abstraction has 1026 states and 1534 transitions. [2018-11-23 15:51:17,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:51:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1534 transitions. [2018-11-23 15:51:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-23 15:51:17,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:17,196 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2018-11-23 15:51:17,196 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:17,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash -421436053, now seen corresponding path program 1 times [2018-11-23 15:51:17,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:17,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:17,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-11-23 15:51:17,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:17,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:51:17,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:51:17,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:51:17,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:51:17,337 INFO L87 Difference]: Start difference. First operand 1026 states and 1534 transitions. Second operand 6 states. [2018-11-23 15:51:17,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:17,589 INFO L93 Difference]: Finished difference Result 2043 states and 3056 transitions. [2018-11-23 15:51:17,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:51:17,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-11-23 15:51:17,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:17,593 INFO L225 Difference]: With dead ends: 2043 [2018-11-23 15:51:17,593 INFO L226 Difference]: Without dead ends: 1030 [2018-11-23 15:51:17,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:51:17,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-11-23 15:51:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1029. [2018-11-23 15:51:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2018-11-23 15:51:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1537 transitions. [2018-11-23 15:51:17,622 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1537 transitions. Word has length 128 [2018-11-23 15:51:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:17,622 INFO L480 AbstractCegarLoop]: Abstraction has 1029 states and 1537 transitions. [2018-11-23 15:51:17,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:51:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1537 transitions. [2018-11-23 15:51:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-23 15:51:17,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:17,624 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:17,624 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:17,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1528997636, now seen corresponding path program 1 times [2018-11-23 15:51:17,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:17,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:17,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:17,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:17,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:18,016 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-23 15:51:18,080 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20488 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-23 15:51:18,082 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20485 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-23 15:51:18,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:51:18 BoogieIcfgContainer [2018-11-23 15:51:18,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:51:18,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:51:18,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:51:18,151 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:51:18,154 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:03" (3/4) ... [2018-11-23 15:51:18,159 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:51:18,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:51:18,160 INFO L168 Benchmark]: Toolchain (without parser) took 16659.89 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 368.6 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 195.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:18,162 INFO L168 Benchmark]: CDTParser took 0.18 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-23 15:51:18,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -145.0 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:18,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:51:18,165 INFO L168 Benchmark]: Boogie Preprocessor took 85.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:18,165 INFO L168 Benchmark]: RCFGBuilder took 1116.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.1 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:18,168 INFO L168 Benchmark]: TraceAbstraction took 14749.59 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 258.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -114.4 MB). Peak memory consumption was 144.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:18,169 INFO L168 Benchmark]: Witness Printer took 7.92 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:51:18,174 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 647.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -145.0 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1116.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.1 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14749.59 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 258.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -114.4 MB). Peak memory consumption was 144.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.92 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20488 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20485 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; [L1040] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20542, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20490:0}] [L1062] SSL *s ; [L1066] s = malloc (sizeof (SSL)) [L1067] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1068] s->ctx = malloc(sizeof(SSL_CTX)) [L1069] s->state = 12292 [L1070] s->version = __VERIFIER_nondet_int() [L1071] CALL ssl3_connect(s) VAL [init=1, s={20498:0}, SSLv3_client_data={20490:0}] [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 [L1101] s->state = 12292 [L1102] s->hit = __VERIFIER_nondet_int() [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] tmp___0 = (int*)malloc(sizeof(int)) [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->info_callback={6:-5}, skip=0, SSLv3_client_data={20490:0}, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=12292, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1249] EXPR s->version VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->version=1, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->init_buf={3:-2}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) [L1282] s->state = 4368 [L1283] EXPR s->ctx [L1283] EXPR (s->ctx)->stats.sess_connect [L1283] (s->ctx)->stats.sess_connect += 1 [L1284] s->init_num = 0 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND TRUE s->state == 4368 [L1288] s->shutdown = 0 [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1295] COND FALSE !(ret <= 0) [L1300] s->state = 4384 [L1301] s->init_num = 0 [L1302] EXPR s->bbio [L1302] EXPR s->wbio VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->bbio={0:0}, s->wbio={0:1}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1316] COND FALSE !(ret <= 0) [L1321] s->hit VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->hit=0, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] COND FALSE !(s->hit) [L1324] s->state = 4400 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1326] s->init_num = 0 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND TRUE s->state == 4400 [L1330] EXPR s->s3 [L1330] EXPR (s->s3)->tmp.new_cipher [L1330] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={6:-5}, ((s->s3)->tmp.new_cipher)->algorithms=20524, (s->s3)->tmp.new_cipher={20541:0}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1345] s->state = 4416 [L1346] s->init_num = 0 VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1356] COND FALSE !(ret <= 0) [L1361] s->state = 4432 [L1362] s->init_num = 0 [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4448 [L1385] s->init_num = 0 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=0, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1645] __VERIFIER_error() VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=0, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 1 error locations. UNSAFE Result, 14.6s OverallTime, 35 OverallIterations, 7 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7566 SDtfs, 2657 SDslu, 9982 SDs, 0 SdLazy, 5228 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 68 SyntacticMatches, 45 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1029occurred in iteration=34, 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.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 2607 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3084 NumberOfCodeBlocks, 3084 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2907 ConstructedInterpolants, 0 QuantifiedInterpolants, 612042 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2666/2666 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-dea210a [2018-11-23 15:51:20,052 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:51:20,054 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:51:20,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:51:20,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:51:20,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:51:20,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:51:20,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:51:20,071 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:51:20,072 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:51:20,073 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:51:20,073 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:51:20,074 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:51:20,075 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:51:20,077 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:51:20,077 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:51:20,078 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:51:20,081 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:51:20,083 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:51:20,085 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:51:20,086 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:51:20,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:51:20,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:51:20,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:51:20,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:51:20,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:51:20,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:51:20,093 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:51:20,094 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:51:20,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:51:20,096 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:51:20,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:51:20,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:51:20,097 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:51:20,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:51:20,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:51:20,099 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 15:51:20,113 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:51:20,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:51:20,114 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:51:20,114 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:51:20,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:51:20,115 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:51:20,115 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:51:20,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:51:20,116 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:51:20,116 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:51:20,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:51:20,116 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:51:20,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:51:20,117 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:51:20,117 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 15:51:20,117 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 15:51:20,117 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:51:20,117 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:51:20,117 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:51:20,118 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:51:20,118 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:51:20,118 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:51:20,119 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:51:20,119 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:51:20,119 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:51:20,119 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:51:20,119 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:51:20,119 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:51:20,119 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 15:51:20,119 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:51:20,119 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-23 15:51:20,120 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 15:51:20,120 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdf0cf9bd7de1f69825d4535f203da45c4edbbfc [2018-11-23 15:51:20,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:51:20,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:51:20,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:51:20,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:51:20,179 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:51:20,180 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/s3_false-unreach-call.i [2018-11-23 15:51:20,231 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceee5209f/4b4c8583454a4a59a0dcc1eeff499e8f/FLAG7a863ef47 [2018-11-23 15:51:20,695 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:51:20,696 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/s3_false-unreach-call.i [2018-11-23 15:51:20,713 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceee5209f/4b4c8583454a4a59a0dcc1eeff499e8f/FLAG7a863ef47 [2018-11-23 15:51:21,201 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceee5209f/4b4c8583454a4a59a0dcc1eeff499e8f [2018-11-23 15:51:21,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:51:21,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:51:21,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:51:21,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:51:21,211 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:51:21,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:21" (1/1) ... [2018-11-23 15:51:21,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ec104b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21, skipping insertion in model container [2018-11-23 15:51:21,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:21" (1/1) ... [2018-11-23 15:51:21,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:51:21,288 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:51:21,677 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:51:21,756 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:51:21,861 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:51:21,887 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:51:21,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21 WrapperNode [2018-11-23 15:51:21,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:51:21,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:51:21,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:51:21,889 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:51:21,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21" (1/1) ... [2018-11-23 15:51:21,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21" (1/1) ... [2018-11-23 15:51:21,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:51:21,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:51:21,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:51:21,941 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:51:21,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21" (1/1) ... [2018-11-23 15:51:21,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21" (1/1) ... [2018-11-23 15:51:21,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21" (1/1) ... [2018-11-23 15:51:21,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21" (1/1) ... [2018-11-23 15:51:22,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21" (1/1) ... [2018-11-23 15:51:22,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21" (1/1) ... [2018-11-23 15:51:22,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21" (1/1) ... [2018-11-23 15:51:22,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:51:22,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:51:22,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:51:22,041 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:51:22,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 15:51:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 15:51:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 15:51:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:51:22,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:51:22,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-23 15:51:22,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 15:51:22,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:51:22,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:51:22,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:51:22,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 15:51:22,109 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-23 15:51:22,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-23 15:51:22,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:51:22,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:51:22,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 15:51:22,423 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 15:51:22,423 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 15:51:24,556 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:51:24,557 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 15:51:24,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:24 BoogieIcfgContainer [2018-11-23 15:51:24,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:51:24,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:51:24,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:51:24,561 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:51:24,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:51:21" (1/3) ... [2018-11-23 15:51:24,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d323ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:51:24, skipping insertion in model container [2018-11-23 15:51:24,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:21" (2/3) ... [2018-11-23 15:51:24,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d323ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:51:24, skipping insertion in model container [2018-11-23 15:51:24,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:24" (3/3) ... [2018-11-23 15:51:24,565 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-11-23 15:51:24,573 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:51:24,582 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:51:24,596 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:51:24,625 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:51:24,626 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:51:24,626 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:51:24,626 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:51:24,627 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:51:24,627 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:51:24,627 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:51:24,627 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:51:24,627 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:51:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-11-23 15:51:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 15:51:24,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:24,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:24,656 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:24,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:24,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1513562951, now seen corresponding path program 1 times [2018-11-23 15:51:24,666 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:51:24,666 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:51:24,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:24,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:24,858 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-23 15:51:24,859 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:51:24,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:24,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:51:24,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:51:24,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:51:24,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:24,887 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2018-11-23 15:51:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:25,004 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2018-11-23 15:51:25,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:51:25,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 15:51:25,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:25,020 INFO L225 Difference]: With dead ends: 385 [2018-11-23 15:51:25,020 INFO L226 Difference]: Without dead ends: 223 [2018-11-23 15:51:25,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-23 15:51:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-23 15:51:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-11-23 15:51:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-23 15:51:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2018-11-23 15:51:25,078 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2018-11-23 15:51:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:25,079 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2018-11-23 15:51:25,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:51:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2018-11-23 15:51:25,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 15:51:25,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:25,083 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:25,083 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:25,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:25,084 INFO L82 PathProgramCache]: Analyzing trace with hash -959560751, now seen corresponding path program 1 times [2018-11-23 15:51:25,085 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:51:25,085 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:51:25,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:25,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:25,254 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 15:51:25,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:25,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:51:25,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:51:25,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:51:25,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:25,259 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2018-11-23 15:51:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:25,568 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2018-11-23 15:51:25,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:51:25,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-23 15:51:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:25,573 INFO L225 Difference]: With dead ends: 432 [2018-11-23 15:51:25,573 INFO L226 Difference]: Without dead ends: 325 [2018-11-23 15:51:25,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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-23 15:51:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-23 15:51:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-11-23 15:51:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-23 15:51:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2018-11-23 15:51:25,604 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2018-11-23 15:51:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:25,605 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2018-11-23 15:51:25,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:51:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2018-11-23 15:51:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 15:51:25,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:25,609 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:25,609 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:25,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:25,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1822634295, now seen corresponding path program 1 times [2018-11-23 15:51:25,610 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:51:25,610 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:51:25,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:25,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:51:25,784 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:51:25,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:25,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:51:25,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:51:25,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:51:25,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:25,789 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 3 states. [2018-11-23 15:51:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:25,906 INFO L93 Difference]: Finished difference Result 638 states and 943 transitions. [2018-11-23 15:51:25,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:51:25,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-23 15:51:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:25,912 INFO L225 Difference]: With dead ends: 638 [2018-11-23 15:51:25,912 INFO L226 Difference]: Without dead ends: 429 [2018-11-23 15:51:25,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 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-23 15:51:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-11-23 15:51:25,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2018-11-23 15:51:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-11-23 15:51:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 628 transitions. [2018-11-23 15:51:25,939 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 628 transitions. Word has length 63 [2018-11-23 15:51:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:25,939 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 628 transitions. [2018-11-23 15:51:25,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:51:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 628 transitions. [2018-11-23 15:51:25,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 15:51:25,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:25,945 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:25,945 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:25,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:25,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1221318135, now seen corresponding path program 1 times [2018-11-23 15:51:25,947 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:51:25,947 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:51:25,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:26,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 15:51:26,176 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:51:26,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:26,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:51:26,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:51:26,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:51:26,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:26,180 INFO L87 Difference]: Start difference. First operand 429 states and 628 transitions. Second operand 3 states. [2018-11-23 15:51:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:26,288 INFO L93 Difference]: Finished difference Result 845 states and 1246 transitions. [2018-11-23 15:51:26,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:51:26,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-23 15:51:26,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:26,293 INFO L225 Difference]: With dead ends: 845 [2018-11-23 15:51:26,293 INFO L226 Difference]: Without dead ends: 532 [2018-11-23 15:51:26,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 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-23 15:51:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-11-23 15:51:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2018-11-23 15:51:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-11-23 15:51:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 779 transitions. [2018-11-23 15:51:26,310 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 779 transitions. Word has length 83 [2018-11-23 15:51:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:26,311 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 779 transitions. [2018-11-23 15:51:26,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:51:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 779 transitions. [2018-11-23 15:51:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 15:51:26,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:26,315 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:26,315 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:26,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1674718222, now seen corresponding path program 1 times [2018-11-23 15:51:26,316 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:51:26,316 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:51:26,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:26,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-23 15:51:26,529 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:51:26,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:26,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:51:26,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:51:26,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:51:26,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:51:26,533 INFO L87 Difference]: Start difference. First operand 532 states and 779 transitions. Second operand 3 states. [2018-11-23 15:51:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:26,770 INFO L93 Difference]: Finished difference Result 945 states and 1387 transitions. [2018-11-23 15:51:26,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:51:26,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-23 15:51:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:26,775 INFO L225 Difference]: With dead ends: 945 [2018-11-23 15:51:26,776 INFO L226 Difference]: Without dead ends: 529 [2018-11-23 15:51:26,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 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-23 15:51:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-23 15:51:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-11-23 15:51:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-23 15:51:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 769 transitions. [2018-11-23 15:51:26,797 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 769 transitions. Word has length 104 [2018-11-23 15:51:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:26,797 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 769 transitions. [2018-11-23 15:51:26,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:51:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 769 transitions. [2018-11-23 15:51:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 15:51:26,800 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:26,800 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:26,801 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:26,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:26,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1067312749, now seen corresponding path program 1 times [2018-11-23 15:51:26,802 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:51:26,802 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:51:26,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:27,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:27,762 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 15:51:27,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-11-23 15:51:27,823 INFO L478 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-23 15:51:27,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:27,835 INFO L478 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-23 15:51:27,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:27,850 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:27,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 15:51:27,893 INFO L478 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-23 15:51:27,894 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:27,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:27,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:27,941 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-23 15:51:27,956 INFO L478 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 35 treesize of output 32 [2018-11-23 15:51:27,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:27,977 INFO L478 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 32 treesize of output 38 [2018-11-23 15:51:27,978 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:28,009 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:28,050 INFO L478 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 30 treesize of output 26 [2018-11-23 15:51:28,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,086 INFO L478 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 23 treesize of output 56 [2018-11-23 15:51:28,087 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:28,110 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:28,127 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:28,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:51:28,162 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:45, output treesize:20 [2018-11-23 15:51:28,226 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 62 [2018-11-23 15:51:28,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-11-23 15:51:28,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:28,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-11-23 15:51:28,466 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:28,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:28,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:51:28,500 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:22 [2018-11-23 15:51:28,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2018-11-23 15:51:28,542 INFO L478 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 15 treesize of output 8 [2018-11-23 15:51:28,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:28,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:28,567 INFO L478 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-23 15:51:28,567 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:28,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:28,583 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-23 15:51:28,583 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-11-23 15:51:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:51:28,610 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:51:28,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:28,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:51:28,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:51:28,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:51:28,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:51:28,616 INFO L87 Difference]: Start difference. First operand 529 states and 769 transitions. Second operand 6 states. [2018-11-23 15:51:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:33,643 INFO L93 Difference]: Finished difference Result 1028 states and 1496 transitions. [2018-11-23 15:51:33,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:51:33,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2018-11-23 15:51:33,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:33,650 INFO L225 Difference]: With dead ends: 1028 [2018-11-23 15:51:33,650 INFO L226 Difference]: Without dead ends: 613 [2018-11-23 15:51:33,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:51:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-11-23 15:51:33,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 537. [2018-11-23 15:51:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-11-23 15:51:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 782 transitions. [2018-11-23 15:51:33,677 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 782 transitions. Word has length 106 [2018-11-23 15:51:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:33,677 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 782 transitions. [2018-11-23 15:51:33,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:51:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 782 transitions. [2018-11-23 15:51:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 15:51:33,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:33,680 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:33,680 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:33,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:33,680 INFO L82 PathProgramCache]: Analyzing trace with hash 534436016, now seen corresponding path program 1 times [2018-11-23 15:51:33,681 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:51:33,681 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:51:33,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:34,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:34,607 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 15:51:34,624 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-23 15:51:34,632 INFO L478 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 35 treesize of output 32 [2018-11-23 15:51:34,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:34,659 INFO L478 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 32 treesize of output 38 [2018-11-23 15:51:34,660 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:34,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:34,734 INFO L478 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 30 treesize of output 26 [2018-11-23 15:51:34,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:34,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:34,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:34,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:34,784 INFO L478 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 23 treesize of output 56 [2018-11-23 15:51:34,785 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:34,813 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:34,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:34,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-11-23 15:51:34,858 INFO L478 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-23 15:51:34,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:34,878 INFO L478 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-23 15:51:34,878 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:34,898 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:34,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 15:51:34,958 INFO L478 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-23 15:51:34,958 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:34,990 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:35,007 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:35,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:51:35,046 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2018-11-23 15:51:35,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:35,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 62 [2018-11-23 15:51:35,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:35,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:35,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-11-23 15:51:35,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:35,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:35,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:35,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:35,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:35,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:35,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-11-23 15:51:35,309 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:35,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:35,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:51:35,343 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:22 [2018-11-23 15:51:35,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2018-11-23 15:51:35,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:35,388 INFO L478 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-23 15:51:35,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:35,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:35,403 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-23 15:51:35,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-11-23 15:51:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:51:35,433 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:51:35,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:35,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:51:35,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:51:35,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:51:35,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:51:35,440 INFO L87 Difference]: Start difference. First operand 537 states and 782 transitions. Second operand 6 states. [2018-11-23 15:51:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:40,482 INFO L93 Difference]: Finished difference Result 1025 states and 1492 transitions. [2018-11-23 15:51:40,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:51:40,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-11-23 15:51:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:40,487 INFO L225 Difference]: With dead ends: 1025 [2018-11-23 15:51:40,488 INFO L226 Difference]: Without dead ends: 610 [2018-11-23 15:51:40,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:51:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-11-23 15:51:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 538. [2018-11-23 15:51:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-11-23 15:51:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 783 transitions. [2018-11-23 15:51:40,512 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 783 transitions. Word has length 107 [2018-11-23 15:51:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:40,512 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 783 transitions. [2018-11-23 15:51:40,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:51:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 783 transitions. [2018-11-23 15:51:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 15:51:40,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:40,514 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:51:40,515 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:40,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:40,515 INFO L82 PathProgramCache]: Analyzing trace with hash -48734010, now seen corresponding path program 1 times [2018-11-23 15:51:40,516 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:51:40,516 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:51:40,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:41,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:41,363 INFO L478 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-23 15:51:41,366 INFO L478 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-23 15:51:41,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:41,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:41,373 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:51:41,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:41,384 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:41,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:41,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:41,401 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:51:41,445 INFO L478 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-23 15:51:41,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:41,450 INFO L478 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-23 15:51:41,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:41,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:41,456 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-23 15:51:41,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:51:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:51:41,498 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:51:41,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:41,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:51:41,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:51:41,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:51:41,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:51:41,505 INFO L87 Difference]: Start difference. First operand 538 states and 783 transitions. Second operand 7 states. [2018-11-23 15:51:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:49,569 INFO L93 Difference]: Finished difference Result 1420 states and 2074 transitions. [2018-11-23 15:51:49,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:51:49,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-11-23 15:51:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:51:49,577 INFO L225 Difference]: With dead ends: 1420 [2018-11-23 15:51:49,577 INFO L226 Difference]: Without dead ends: 904 [2018-11-23 15:51:49,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:51:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-11-23 15:51:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 642. [2018-11-23 15:51:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-11-23 15:51:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 967 transitions. [2018-11-23 15:51:49,610 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 967 transitions. Word has length 121 [2018-11-23 15:51:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:51:49,611 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 967 transitions. [2018-11-23 15:51:49,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:51:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 967 transitions. [2018-11-23 15:51:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 15:51:49,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:51:49,614 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-11-23 15:51:49,614 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:51:49,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:49,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1515231419, now seen corresponding path program 1 times [2018-11-23 15:51:49,615 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:51:49,615 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:51:49,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:50,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:50,478 INFO L478 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-23 15:51:50,481 INFO L478 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-23 15:51:50,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:50,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:50,489 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:51:50,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:50,499 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:50,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:50,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:50,516 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:51:50,543 INFO L478 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-23 15:51:50,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:50,547 INFO L478 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-23 15:51:50,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:50,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:50,554 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-23 15:51:50,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:51:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:51:50,583 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:51:50,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:50,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:51:50,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:51:50,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:51:50,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:51:50,588 INFO L87 Difference]: Start difference. First operand 642 states and 967 transitions. Second operand 7 states. [2018-11-23 15:51:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:59,998 INFO L93 Difference]: Finished difference Result 1508 states and 2236 transitions. [2018-11-23 15:52:00,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:52:00,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-11-23 15:52:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:52:00,006 INFO L225 Difference]: With dead ends: 1508 [2018-11-23 15:52:00,006 INFO L226 Difference]: Without dead ends: 888 [2018-11-23 15:52:00,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:52:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-11-23 15:52:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 646. [2018-11-23 15:52:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-23 15:52:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 971 transitions. [2018-11-23 15:52:00,039 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 971 transitions. Word has length 122 [2018-11-23 15:52:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:52:00,039 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 971 transitions. [2018-11-23 15:52:00,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:52:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 971 transitions. [2018-11-23 15:52:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 15:52:00,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:52:00,042 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:52:00,042 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:52:00,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:00,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1330335365, now seen corresponding path program 2 times [2018-11-23 15:52:00,043 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:52:00,043 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:52:00,064 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 15:52:00,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:52:00,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:52:00,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:52:00,723 INFO L478 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-23 15:52:00,725 INFO L478 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-23 15:52:00,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:00,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:00,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:00,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-23 15:52:00,761 INFO L478 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-23 15:52:00,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:00,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:00,768 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:52:00,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:00,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:00,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:00,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-23 15:52:00,815 INFO L478 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-23 15:52:00,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:00,818 INFO L478 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-23 15:52:00,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:00,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:00,825 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-23 15:52:00,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:52:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 15:52:00,853 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:52:00,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:52:00,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 15:52:00,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:52:00,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:52:00,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:52:00,859 INFO L87 Difference]: Start difference. First operand 646 states and 971 transitions. Second operand 8 states. [2018-11-23 15:52:13,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:52:13,430 INFO L93 Difference]: Finished difference Result 1644 states and 2459 transitions. [2018-11-23 15:52:13,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:52:13,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2018-11-23 15:52:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:52:13,437 INFO L225 Difference]: With dead ends: 1644 [2018-11-23 15:52:13,437 INFO L226 Difference]: Without dead ends: 1020 [2018-11-23 15:52:13,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:52:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-11-23 15:52:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 730. [2018-11-23 15:52:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-23 15:52:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1111 transitions. [2018-11-23 15:52:13,476 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1111 transitions. Word has length 136 [2018-11-23 15:52:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:52:13,476 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 1111 transitions. [2018-11-23 15:52:13,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:52:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1111 transitions. [2018-11-23 15:52:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 15:52:13,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:52:13,479 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:52:13,479 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:52:13,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:13,480 INFO L82 PathProgramCache]: Analyzing trace with hash 236422585, now seen corresponding path program 1 times [2018-11-23 15:52:13,480 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:52:13,480 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:52:13,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:52:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:52:14,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:52:14,514 INFO L478 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-23 15:52:14,518 INFO L478 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-23 15:52:14,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:14,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:14,526 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:52:14,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:14,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:14,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:14,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:14,558 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:52:14,587 INFO L478 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-23 15:52:14,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:14,591 INFO L478 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-23 15:52:14,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:14,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:14,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-23 15:52:14,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:52:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 96 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:52:14,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:52:14,687 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:52:14,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:14,689 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-23 15:52:14,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-23 15:52:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:52:14,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:52:14,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 15:52:14,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:52:14,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:52:14,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:52:14,709 INFO L87 Difference]: Start difference. First operand 730 states and 1111 transitions. Second operand 9 states. [2018-11-23 15:52:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:52:27,474 INFO L93 Difference]: Finished difference Result 2126 states and 3179 transitions. [2018-11-23 15:52:27,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:52:27,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2018-11-23 15:52:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:52:27,481 INFO L225 Difference]: With dead ends: 2126 [2018-11-23 15:52:27,481 INFO L226 Difference]: Without dead ends: 1418 [2018-11-23 15:52:27,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:52:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-11-23 15:52:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 785. [2018-11-23 15:52:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-11-23 15:52:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1183 transitions. [2018-11-23 15:52:27,527 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1183 transitions. Word has length 136 [2018-11-23 15:52:27,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:52:27,527 INFO L480 AbstractCegarLoop]: Abstraction has 785 states and 1183 transitions. [2018-11-23 15:52:27,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:52:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1183 transitions. [2018-11-23 15:52:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 15:52:27,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:52:27,530 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 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-23 15:52:27,531 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:52:27,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:27,531 INFO L82 PathProgramCache]: Analyzing trace with hash -511603369, now seen corresponding path program 1 times [2018-11-23 15:52:27,531 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:52:27,532 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:52:27,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:52:28,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:52:28,494 INFO L478 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-23 15:52:28,496 INFO L478 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-23 15:52:28,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:28,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:28,510 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:52:28,510 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:28,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:28,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:28,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:28,534 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:52:28,560 INFO L478 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-23 15:52:28,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:28,564 INFO L478 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-23 15:52:28,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:28,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:28,568 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-23 15:52:28,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:52:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:52:28,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:52:28,626 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:52:28,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:28,627 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-23 15:52:28,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-23 15:52:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:52:28,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:52:28,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 15:52:28,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:52:28,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:52:28,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:52:28,645 INFO L87 Difference]: Start difference. First operand 785 states and 1183 transitions. Second operand 9 states. [2018-11-23 15:52:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:52:39,988 INFO L93 Difference]: Finished difference Result 2182 states and 3239 transitions. [2018-11-23 15:52:39,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:52:39,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2018-11-23 15:52:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:52:39,995 INFO L225 Difference]: With dead ends: 2182 [2018-11-23 15:52:39,995 INFO L226 Difference]: Without dead ends: 1419 [2018-11-23 15:52:39,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 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-23 15:52:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-11-23 15:52:40,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 790. [2018-11-23 15:52:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-11-23 15:52:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1179 transitions. [2018-11-23 15:52:40,028 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1179 transitions. Word has length 136 [2018-11-23 15:52:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:52:40,028 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1179 transitions. [2018-11-23 15:52:40,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:52:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1179 transitions. [2018-11-23 15:52:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 15:52:40,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:52:40,030 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:52:40,031 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:52:40,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:40,031 INFO L82 PathProgramCache]: Analyzing trace with hash 107117242, now seen corresponding path program 1 times [2018-11-23 15:52:40,031 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:52:40,031 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:52:40,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:52:40,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:52:40,950 INFO L478 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-23 15:52:40,952 INFO L478 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-23 15:52:40,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:40,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:40,959 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:52:40,959 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:40,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:40,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:40,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:40,984 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:52:41,007 INFO L478 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-23 15:52:41,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:41,011 INFO L478 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-23 15:52:41,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:41,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:41,017 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-23 15:52:41,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:52:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:52:41,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:52:41,097 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:52:41,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:41,097 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-23 15:52:41,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-23 15:52:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:52:41,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:52:41,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 15:52:41,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:52:41,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:52:41,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:52:41,118 INFO L87 Difference]: Start difference. First operand 790 states and 1179 transitions. Second operand 9 states. [2018-11-23 15:52:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:52:50,171 INFO L93 Difference]: Finished difference Result 2086 states and 3064 transitions. [2018-11-23 15:52:50,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:52:50,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2018-11-23 15:52:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:52:50,179 INFO L225 Difference]: With dead ends: 2086 [2018-11-23 15:52:50,179 INFO L226 Difference]: Without dead ends: 1479 [2018-11-23 15:52:50,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 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-23 15:52:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2018-11-23 15:52:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 870. [2018-11-23 15:52:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-11-23 15:52:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1291 transitions. [2018-11-23 15:52:50,217 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1291 transitions. Word has length 136 [2018-11-23 15:52:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:52:50,217 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1291 transitions. [2018-11-23 15:52:50,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:52:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1291 transitions. [2018-11-23 15:52:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 15:52:50,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:52:50,220 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 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-23 15:52:50,220 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:52:50,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:50,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1054004188, now seen corresponding path program 1 times [2018-11-23 15:52:50,221 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:52:50,221 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:52:50,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:52:51,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:52:51,180 INFO L478 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-23 15:52:51,183 INFO L478 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-23 15:52:51,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:51,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:51,192 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:52:51,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:51,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:51,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:51,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:51,220 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:52:51,244 INFO L478 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-23 15:52:51,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:52:51,248 INFO L478 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-23 15:52:51,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:51,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:52:51,252 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-23 15:52:51,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:52:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 106 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:52:51,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:52:51,311 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:52:51,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:52:51,312 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-23 15:52:51,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-23 15:52:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:52:51,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:52:51,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 15:52:51,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:52:51,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:52:51,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:52:51,333 INFO L87 Difference]: Start difference. First operand 870 states and 1291 transitions. Second operand 9 states. [2018-11-23 15:53:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:03,446 INFO L93 Difference]: Finished difference Result 2347 states and 3446 transitions. [2018-11-23 15:53:03,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:53:03,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2018-11-23 15:53:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:03,453 INFO L225 Difference]: With dead ends: 2347 [2018-11-23 15:53:03,453 INFO L226 Difference]: Without dead ends: 1499 [2018-11-23 15:53:03,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:53:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2018-11-23 15:53:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 875. [2018-11-23 15:53:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-11-23 15:53:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1282 transitions. [2018-11-23 15:53:03,513 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1282 transitions. Word has length 137 [2018-11-23 15:53:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:03,513 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1282 transitions. [2018-11-23 15:53:03,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:53:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1282 transitions. [2018-11-23 15:53:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-23 15:53:03,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:03,516 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:53:03,517 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:03,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:03,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1193261695, now seen corresponding path program 1 times [2018-11-23 15:53:03,518 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:53:03,518 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:53:03,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:04,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:04,444 INFO L478 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-23 15:53:04,447 INFO L478 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-23 15:53:04,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:04,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:04,455 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:53:04,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:04,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:04,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:04,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:04,482 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:53:04,506 INFO L478 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-23 15:53:04,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:04,513 INFO L478 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-23 15:53:04,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:04,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:04,518 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-23 15:53:04,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:53:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 122 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:53:04,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:53:04,588 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:53:04,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:04,589 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-23 15:53:04,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-23 15:53:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:53:04,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:53:04,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 15:53:04,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:53:04,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:53:04,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:53:04,623 INFO L87 Difference]: Start difference. First operand 875 states and 1282 transitions. Second operand 9 states. [2018-11-23 15:53:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:14,510 INFO L93 Difference]: Finished difference Result 2134 states and 3101 transitions. [2018-11-23 15:53:14,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:53:14,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2018-11-23 15:53:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:14,519 INFO L225 Difference]: With dead ends: 2134 [2018-11-23 15:53:14,519 INFO L226 Difference]: Without dead ends: 1459 [2018-11-23 15:53:14,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 269 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-23 15:53:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2018-11-23 15:53:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 874. [2018-11-23 15:53:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-23 15:53:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1271 transitions. [2018-11-23 15:53:14,572 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1271 transitions. Word has length 137 [2018-11-23 15:53:14,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:14,572 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1271 transitions. [2018-11-23 15:53:14,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:53:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1271 transitions. [2018-11-23 15:53:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-23 15:53:14,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:14,574 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:53:14,574 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:14,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:14,575 INFO L82 PathProgramCache]: Analyzing trace with hash 14748156, now seen corresponding path program 1 times [2018-11-23 15:53:14,575 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:53:14,575 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:53:14,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:15,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:15,581 INFO L478 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-23 15:53:15,585 INFO L478 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-23 15:53:15,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:15,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:15,596 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:53:15,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:15,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:15,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:15,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:15,624 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:53:15,652 INFO L478 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-23 15:53:15,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:15,656 INFO L478 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-23 15:53:15,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:15,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:15,661 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-23 15:53:15,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:53:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:53:15,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:53:15,721 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:53:15,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:15,722 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-23 15:53:15,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-23 15:53:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:53:15,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:53:15,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 15:53:15,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:53:15,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:53:15,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:53:15,743 INFO L87 Difference]: Start difference. First operand 874 states and 1271 transitions. Second operand 9 states. [2018-11-23 15:53:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:26,779 INFO L93 Difference]: Finished difference Result 2345 states and 3394 transitions. [2018-11-23 15:53:26,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:53:26,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2018-11-23 15:53:26,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:26,787 INFO L225 Difference]: With dead ends: 2345 [2018-11-23 15:53:26,787 INFO L226 Difference]: Without dead ends: 1487 [2018-11-23 15:53:26,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 271 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-23 15:53:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-11-23 15:53:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 879. [2018-11-23 15:53:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-11-23 15:53:26,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1263 transitions. [2018-11-23 15:53:26,830 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1263 transitions. Word has length 138 [2018-11-23 15:53:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:26,830 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1263 transitions. [2018-11-23 15:53:26,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:53:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1263 transitions. [2018-11-23 15:53:26,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 15:53:26,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:26,833 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:53:26,833 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:26,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:26,833 INFO L82 PathProgramCache]: Analyzing trace with hash -170900511, now seen corresponding path program 1 times [2018-11-23 15:53:26,834 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:53:26,834 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:53:26,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:27,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:27,812 INFO L478 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-23 15:53:27,815 INFO L478 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-23 15:53:27,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:27,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:27,822 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:53:27,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:27,832 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:27,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:27,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:27,850 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:53:27,880 INFO L478 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-23 15:53:27,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:27,890 INFO L478 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-23 15:53:27,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:27,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:27,896 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-23 15:53:27,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:53:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 116 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:53:27,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:53:27,974 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:53:27,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:27,975 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-23 15:53:27,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-23 15:53:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:53:27,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:53:27,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 15:53:27,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:53:27,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:53:27,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:53:27,995 INFO L87 Difference]: Start difference. First operand 879 states and 1263 transitions. Second operand 9 states. [2018-11-23 15:53:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:38,153 INFO L93 Difference]: Finished difference Result 2314 states and 3324 transitions. [2018-11-23 15:53:38,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:53:38,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2018-11-23 15:53:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:38,161 INFO L225 Difference]: With dead ends: 2314 [2018-11-23 15:53:38,161 INFO L226 Difference]: Without dead ends: 1451 [2018-11-23 15:53:38,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 273 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-23 15:53:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2018-11-23 15:53:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 884. [2018-11-23 15:53:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-11-23 15:53:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1255 transitions. [2018-11-23 15:53:38,215 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1255 transitions. Word has length 139 [2018-11-23 15:53:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:38,215 INFO L480 AbstractCegarLoop]: Abstraction has 884 states and 1255 transitions. [2018-11-23 15:53:38,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:53:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1255 transitions. [2018-11-23 15:53:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 15:53:38,217 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:38,217 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:53:38,217 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:38,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1475321086, now seen corresponding path program 1 times [2018-11-23 15:53:38,218 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:53:38,218 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:53:38,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:39,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:39,086 INFO L478 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-23 15:53:39,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,098 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:53:39,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-23 15:53:39,154 INFO L478 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 32 treesize of output 25 [2018-11-23 15:53:39,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,168 INFO L478 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 25 treesize of output 68 [2018-11-23 15:53:39,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-23 15:53:39,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,235 INFO L478 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 46 treesize of output 51 [2018-11-23 15:53:39,239 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:53:39,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,250 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 88 [2018-11-23 15:53:39,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,315 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 62 [2018-11-23 15:53:39,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,354 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:49, output treesize:31 [2018-11-23 15:53:39,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,396 INFO L478 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 46 treesize of output 51 [2018-11-23 15:53:39,402 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:53:39,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,422 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 88 [2018-11-23 15:53:39,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 62 [2018-11-23 15:53:39,495 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,528 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:49, output treesize:31 [2018-11-23 15:53:39,569 INFO L478 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 29 treesize of output 21 [2018-11-23 15:53:39,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:53:39,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 8 [2018-11-23 15:53:39,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,576 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-23 15:53:39,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-11-23 15:53:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 157 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 15:53:39,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:53:39,727 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:53:39,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:39,729 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-23 15:53:39,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:1 [2018-11-23 15:53:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 157 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-23 15:53:39,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:53:39,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2018-11-23 15:53:39,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 15:53:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 15:53:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:53:39,757 INFO L87 Difference]: Start difference. First operand 884 states and 1255 transitions. Second operand 13 states. [2018-11-23 15:54:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:54:11,138 INFO L93 Difference]: Finished difference Result 3327 states and 4752 transitions. [2018-11-23 15:54:11,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 15:54:11,139 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2018-11-23 15:54:11,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:54:11,147 INFO L225 Difference]: With dead ends: 3327 [2018-11-23 15:54:11,147 INFO L226 Difference]: Without dead ends: 2459 [2018-11-23 15:54:11,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 268 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2018-11-23 15:54:11,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2018-11-23 15:54:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 1480. [2018-11-23 15:54:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-11-23 15:54:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2136 transitions. [2018-11-23 15:54:11,232 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2136 transitions. Word has length 139 [2018-11-23 15:54:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:54:11,232 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 2136 transitions. [2018-11-23 15:54:11,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 15:54:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2136 transitions. [2018-11-23 15:54:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 15:54:11,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:54:11,234 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:54:11,235 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:54:11,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:11,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1537360700, now seen corresponding path program 1 times [2018-11-23 15:54:11,235 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:54:11,235 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:54:11,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:54:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:54:12,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:54:12,116 INFO L478 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-23 15:54:12,119 INFO L478 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-23 15:54:12,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:54:12,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:54:12,125 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:54:12,125 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:54:12,134 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:12,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:12,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:12,153 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:54:12,179 INFO L478 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-23 15:54:12,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:54:12,184 INFO L478 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-23 15:54:12,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:54:12,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:12,190 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-23 15:54:12,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:54:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 127 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:54:12,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:54:12,249 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:54:12,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:54:12,250 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-23 15:54:12,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-23 15:54:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:54:12,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:54:12,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 15:54:12,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:54:12,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:54:12,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:54:12,270 INFO L87 Difference]: Start difference. First operand 1480 states and 2136 transitions. Second operand 9 states. [2018-11-23 15:54:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:54:22,516 INFO L93 Difference]: Finished difference Result 4104 states and 5909 transitions. [2018-11-23 15:54:22,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:54:22,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2018-11-23 15:54:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:54:22,527 INFO L225 Difference]: With dead ends: 4104 [2018-11-23 15:54:22,528 INFO L226 Difference]: Without dead ends: 2640 [2018-11-23 15:54:22,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:54:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2018-11-23 15:54:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 1636. [2018-11-23 15:54:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2018-11-23 15:54:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2330 transitions. [2018-11-23 15:54:22,630 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2330 transitions. Word has length 139 [2018-11-23 15:54:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:54:22,630 INFO L480 AbstractCegarLoop]: Abstraction has 1636 states and 2330 transitions. [2018-11-23 15:54:22,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:54:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2330 transitions. [2018-11-23 15:54:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 15:54:22,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:54:22,633 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:54:22,633 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:54:22,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:22,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2134600974, now seen corresponding path program 1 times [2018-11-23 15:54:22,634 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:54:22,634 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:54:22,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:54:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:54:23,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:54:23,618 INFO L478 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-23 15:54:23,622 INFO L478 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-23 15:54:23,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:54:23,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:54:23,630 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:54:23,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:54:23,640 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:23,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:23,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:23,655 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:54:23,678 INFO L478 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-23 15:54:23,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:54:23,681 INFO L478 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-23 15:54:23,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:54:23,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:23,687 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-23 15:54:23,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:54:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:54:23,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:54:23,756 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:54:23,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:54:23,757 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-23 15:54:23,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-23 15:54:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:54:23,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:54:23,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 15:54:23,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:54:23,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:54:23,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:54:23,777 INFO L87 Difference]: Start difference. First operand 1636 states and 2330 transitions. Second operand 9 states. [2018-11-23 15:54:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:54:35,304 INFO L93 Difference]: Finished difference Result 4340 states and 6189 transitions. [2018-11-23 15:54:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:54:35,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2018-11-23 15:54:35,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:54:35,317 INFO L225 Difference]: With dead ends: 4340 [2018-11-23 15:54:35,317 INFO L226 Difference]: Without dead ends: 2720 [2018-11-23 15:54:35,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 273 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-23 15:54:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2018-11-23 15:54:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1656. [2018-11-23 15:54:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-11-23 15:54:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2356 transitions. [2018-11-23 15:54:35,436 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2356 transitions. Word has length 139 [2018-11-23 15:54:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:54:35,436 INFO L480 AbstractCegarLoop]: Abstraction has 1656 states and 2356 transitions. [2018-11-23 15:54:35,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:54:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2356 transitions. [2018-11-23 15:54:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 15:54:35,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:54:35,438 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:54:35,439 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:54:35,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash 913596365, now seen corresponding path program 1 times [2018-11-23 15:54:35,439 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:54:35,439 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:54:35,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:54:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:54:36,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:54:36,413 INFO L478 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-23 15:54:36,416 INFO L478 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-23 15:54:36,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:54:36,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:54:36,423 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:54:36,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:54:36,431 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:36,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:36,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:36,448 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:54:36,473 INFO L478 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-23 15:54:36,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:54:36,475 INFO L478 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-23 15:54:36,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:54:36,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:36,479 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-23 15:54:36,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:54:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 135 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:54:36,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:54:36,540 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:54:36,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:54:36,541 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-23 15:54:36,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-23 15:54:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:54:36,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:54:36,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 15:54:36,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:54:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:54:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:54:36,560 INFO L87 Difference]: Start difference. First operand 1656 states and 2356 transitions. Second operand 9 states. [2018-11-23 15:54:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:54:46,802 INFO L93 Difference]: Finished difference Result 4217 states and 6024 transitions. [2018-11-23 15:54:46,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:54:46,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2018-11-23 15:54:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:54:46,815 INFO L225 Difference]: With dead ends: 4217 [2018-11-23 15:54:46,815 INFO L226 Difference]: Without dead ends: 2577 [2018-11-23 15:54:46,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:54:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2018-11-23 15:54:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 1674. [2018-11-23 15:54:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2018-11-23 15:54:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2374 transitions. [2018-11-23 15:54:46,918 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2374 transitions. Word has length 140 [2018-11-23 15:54:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:54:46,919 INFO L480 AbstractCegarLoop]: Abstraction has 1674 states and 2374 transitions. [2018-11-23 15:54:46,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:54:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2374 transitions. [2018-11-23 15:54:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 15:54:46,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:54:46,921 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:54:46,921 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:54:46,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1901235017, now seen corresponding path program 1 times [2018-11-23 15:54:46,922 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:54:46,922 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:54:46,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:54:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:54:47,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:54:47,752 INFO L478 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-23 15:54:47,756 INFO L478 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-23 15:54:47,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:54:47,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:54:47,761 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 15:54:47,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:54:47,771 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:47,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:47,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:47,790 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-23 15:54:47,817 INFO L478 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-23 15:54:47,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:54:47,822 INFO L478 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-23 15:54:47,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:54:47,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:54:47,827 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-23 15:54:47,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-23 15:54:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:54:47,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:54:47,889 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:54:47,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:54:47,891 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-23 15:54:47,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-23 15:54:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 15:54:47,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:54:47,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 15:54:47,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:54:47,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:54:47,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:54:47,929 INFO L87 Difference]: Start difference. First operand 1674 states and 2374 transitions. Second operand 9 states. [2018-11-23 15:54:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:54:59,353 INFO L93 Difference]: Finished difference Result 4199 states and 5984 transitions. [2018-11-23 15:54:59,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:54:59,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2018-11-23 15:54:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:54:59,363 INFO L225 Difference]: With dead ends: 4199 [2018-11-23 15:54:59,363 INFO L226 Difference]: Without dead ends: 2541 [2018-11-23 15:54:59,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:54:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2018-11-23 15:54:59,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 1674. [2018-11-23 15:54:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2018-11-23 15:54:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2352 transitions. [2018-11-23 15:54:59,473 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2352 transitions. Word has length 140 [2018-11-23 15:54:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:54:59,473 INFO L480 AbstractCegarLoop]: Abstraction has 1674 states and 2352 transitions. [2018-11-23 15:54:59,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:54:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2352 transitions. [2018-11-23 15:54:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-23 15:54:59,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:54:59,476 INFO L402 BasicCegarLoop]: trace histogram [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-23 15:54:59,476 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:54:59,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:54:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1528997636, now seen corresponding path program 1 times [2018-11-23 15:54:59,477 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:54:59,477 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:54:59,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:55:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:55:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:55:07,748 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-23 15:55:07,819 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-23 15:55:07,821 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-23 15:55:07,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:55:07 BoogieIcfgContainer [2018-11-23 15:55:07,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:55:07,909 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:55:07,909 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:55:07,909 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:55:07,909 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:24" (3/4) ... [2018-11-23 15:55:07,912 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-23 15:55:07,942 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-23 15:55:07,942 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-23 15:55:08,063 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-23 15:55:08,064 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:55:08,064 INFO L168 Benchmark]: Toolchain (without parser) took 226858.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 254.8 MB). Free memory was 943.8 MB in the beginning and 851.3 MB in the end (delta: 92.5 MB). Peak memory consumption was 347.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:55:08,066 INFO L168 Benchmark]: CDTParser took 0.15 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-23 15:55:08,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -143.9 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:55:08,067 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:55:08,067 INFO L168 Benchmark]: Boogie Preprocessor took 98.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:55:08,067 INFO L168 Benchmark]: RCFGBuilder took 2516.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.5 MB in the end (delta: 80.4 MB). Peak memory consumption was 80.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:55:08,068 INFO L168 Benchmark]: TraceAbstraction took 223350.01 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 993.5 MB in the beginning and 880.1 MB in the end (delta: 113.4 MB). Peak memory consumption was 258.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:55:08,070 INFO L168 Benchmark]: Witness Printer took 155.06 ms. Allocated memory is still 1.3 GB. Free memory was 880.1 MB in the beginning and 851.3 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:55:08,072 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.15 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 681.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -143.9 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2516.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.5 MB in the end (delta: 80.4 MB). Peak memory consumption was 80.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 223350.01 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 993.5 MB in the beginning and 880.1 MB in the end (delta: 113.4 MB). Peak memory consumption was 258.6 MB. Max. memory is 11.5 GB. * Witness Printer took 155.06 ms. Allocated memory is still 1.3 GB. Free memory was 880.1 MB in the beginning and 851.3 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1645]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1039] static int init = 1; [L1040] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=0, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={5:0}] [L1062] SSL *s ; [L1066] s = malloc (sizeof (SSL)) [L1067] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1068] s->ctx = malloc(sizeof(SSL_CTX)) [L1069] s->state = 12292 [L1070] s->version = __VERIFIER_nondet_int() [L1071] CALL ssl3_connect(s) VAL [init=1, s={36:0}, SSLv3_client_data={5:0}] [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 [L1101] s->state = 12292 [L1102] s->hit = __VERIFIER_nondet_int() [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] tmp___0 = (int*)malloc(sizeof(int)) [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, s->info_callback={0:1}, skip=0, SSLv3_client_data={5:0}, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, s->state=12292, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0] [L1249] EXPR s->version VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, s->version=768, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, s->init_buf={0:1}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) [L1282] s->state = 4368 [L1283] EXPR s->ctx [L1283] EXPR (s->ctx)->stats.sess_connect [L1283] (s->ctx)->stats.sess_connect += 1 [L1284] s->init_num = 0 VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=1, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, s->s3={53:0}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, s->state=4368, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, s->state=4368, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, s->state=4368, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, s->state=4368, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, s->state=4368, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=4294967295, s={36:0}, s={36:0}, s->state=4368, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND TRUE s->state == 4368 [L1288] s->shutdown = 0 [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1295] COND FALSE !(ret <= 0) [L1300] s->state = 4384 [L1301] s->init_num = 0 [L1302] EXPR s->bbio [L1302] EXPR s->wbio VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->bbio={1:0}, s->wbio={0:0}, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=1, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->s3={53:0}, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1316] COND FALSE !(ret <= 0) [L1321] s->hit VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->hit=0, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] COND FALSE !(s->hit) [L1324] s->state = 4400 VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1326] s->init_num = 0 VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=1, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->s3={53:0}, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND TRUE s->state == 4400 [L1330] EXPR s->s3 [L1330] EXPR (s->s3)->tmp.new_cipher [L1330] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:1}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={36:52}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->s3={53:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1345] s->state = 4416 [L1346] s->init_num = 0 VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=1, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->s3={53:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1356] COND FALSE !(ret <= 0) [L1361] s->state = 4432 [L1362] s->init_num = 0 [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=1, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->s3={53:0}, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4448 [L1385] s->init_num = 0 VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=1, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->s3={53:0}, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=1073741824, s={36:0}, s={36:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=0, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1645] __VERIFIER_error() VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-54:0}, ret=0, s={36:0}, s={36:0}, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-54:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 1 error locations. UNSAFE Result, 223.2s OverallTime, 23 OverallIterations, 7 TraceHistogramMax, 192.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4261 SDtfs, 10410 SDslu, 11387 SDs, 0 SdLazy, 12050 SolverSat, 1447 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 177.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4325 GetRequests, 4123 SyntacticMatches, 5 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1674occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 10014 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 17.6s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2716 NumberOfCodeBlocks, 2716 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 4195 ConstructedInterpolants, 21 QuantifiedInterpolants, 1946391 SizeOfPredicates, 124 NumberOfNonLiveVariables, 8263 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 34 InterpolantComputations, 21 PerfectInterpolantSequences, 5842/5921 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...