java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ssh/s3_clnt.blast.02_false-unreach-call.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d63d1fb [2018-01-27 23:12:27,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-27 23:12:27,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-27 23:12:27,495 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-27 23:12:27,495 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-27 23:12:27,496 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-27 23:12:27,497 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-27 23:12:27,501 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-27 23:12:27,503 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-27 23:12:27,505 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-27 23:12:27,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-27 23:12:27,506 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-27 23:12:27,507 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-27 23:12:27,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-27 23:12:27,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-27 23:12:27,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-27 23:12:27,529 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-27 23:12:27,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-27 23:12:27,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-27 23:12:27,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-27 23:12:27,539 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-27 23:12:27,539 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-27 23:12:27,540 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-27 23:12:27,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-27 23:12:27,541 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-27 23:12:27,545 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-27 23:12:27,545 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-27 23:12:27,546 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-27 23:12:27,546 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-27 23:12:27,546 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-27 23:12:27,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-27 23:12:27,547 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-27 23:12:27,564 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-27 23:12:27,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-27 23:12:27,567 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-27 23:12:27,567 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-27 23:12:27,568 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-27 23:12:27,568 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-27 23:12:27,568 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-27 23:12:27,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-27 23:12:27,569 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-27 23:12:27,569 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-27 23:12:27,569 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-27 23:12:27,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-27 23:12:27,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-27 23:12:27,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-27 23:12:27,570 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-27 23:12:27,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-27 23:12:27,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-27 23:12:27,571 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-27 23:12:27,571 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-27 23:12:27,571 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-27 23:12:27,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-27 23:12:27,572 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-27 23:12:27,572 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-27 23:12:27,572 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-27 23:12:27,572 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-27 23:12:27,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-27 23:12:27,572 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-27 23:12:27,573 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-27 23:12:27,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-27 23:12:27,573 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-27 23:12:27,573 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-27 23:12:27,573 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-27 23:12:27,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-27 23:12:27,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-27 23:12:27,574 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-27 23:12:27,575 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-27 23:12:27,578 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-27 23:12:27,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-27 23:12:27,652 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-27 23:12:27,656 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-27 23:12:27,657 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-27 23:12:27,657 INFO L276 PluginConnector]: CDTParser initialized [2018-01-27 23:12:27,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.02_false-unreach-call.i.cil.c [2018-01-27 23:12:28,029 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-27 23:12:28,044 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-27 23:12:28,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-27 23:12:28,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-27 23:12:28,052 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-27 23:12:28,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:12:28" (1/1) ... [2018-01-27 23:12:28,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2498f498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:12:28, skipping insertion in model container [2018-01-27 23:12:28,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:12:28" (1/1) ... [2018-01-27 23:12:28,089 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 23:12:28,229 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-27 23:12:28,550 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 23:12:28,751 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-27 23:12:28,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:12:28 WrapperNode [2018-01-27 23:12:28,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-27 23:12:28,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-27 23:12:28,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-27 23:12:28,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-27 23:12:28,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:12:28" (1/1) ... [2018-01-27 23:12:28,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:12:28" (1/1) ... [2018-01-27 23:12:28,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:12:28" (1/1) ... [2018-01-27 23:12:28,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:12:28" (1/1) ... [2018-01-27 23:12:28,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:12:28" (1/1) ... [2018-01-27 23:12:28,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:12:28" (1/1) ... [2018-01-27 23:12:28,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:12:28" (1/1) ... [2018-01-27 23:12:28,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-27 23:12:28,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-27 23:12:28,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-27 23:12:28,877 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-27 23:12:28,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:12:28" (1/1) ... No working directory specified, using /storage/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-01-27 23:12:28,952 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-27 23:12:28,952 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-27 23:12:28,952 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-27 23:12:28,953 INFO L136 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-01-27 23:12:28,953 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-27 23:12:28,953 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-27 23:12:28,953 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-27 23:12:28,953 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-27 23:12:28,953 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-27 23:12:28,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-27 23:12:28,954 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-27 23:12:28,954 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-27 23:12:28,954 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-27 23:12:28,954 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-27 23:12:28,954 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-01-27 23:12:28,954 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-01-27 23:12:28,955 INFO L128 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-01-27 23:12:28,955 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-27 23:12:28,955 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-27 23:12:28,955 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-27 23:12:29,452 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-27 23:12:29,452 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-27 23:12:31,181 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-27 23:12:31,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:12:31 BoogieIcfgContainer [2018-01-27 23:12:31,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-27 23:12:31,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-27 23:12:31,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-27 23:12:31,185 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-27 23:12:31,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:12:28" (1/3) ... [2018-01-27 23:12:31,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b369e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:12:31, skipping insertion in model container [2018-01-27 23:12:31,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:12:28" (2/3) ... [2018-01-27 23:12:31,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b369e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:12:31, skipping insertion in model container [2018-01-27 23:12:31,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:12:31" (3/3) ... [2018-01-27 23:12:31,189 INFO L105 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02_false-unreach-call.i.cil.c [2018-01-27 23:12:31,198 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-27 23:12:31,208 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-27 23:12:31,261 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:12:31,262 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:12:31,262 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:12:31,262 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:12:31,262 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:12:31,263 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:12:31,263 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:12:31,263 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-27 23:12:31,264 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:12:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2018-01-27 23:12:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-27 23:12:31,295 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:12:31,296 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-27 23:12:31,296 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-27 23:12:31,301 INFO L82 PathProgramCache]: Analyzing trace with hash 732796, now seen corresponding path program 1 times [2018-01-27 23:12:31,303 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:12:31,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:12:31,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:31,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:12:31,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:12:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:12:31,561 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 23:12:31,569 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:12:31,589 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:12:31,589 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:12:31,590 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:12:31,590 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:12:31,590 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:12:31,590 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:12:31,590 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:12:31,590 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ssl3_connectErr0EnsuresViolation======== [2018-01-27 23:12:31,590 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:12:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2018-01-27 23:12:31,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-27 23:12:31,611 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:12:31,611 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:12:31,612 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0EnsuresViolation]=== [2018-01-27 23:12:31,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1243266717, now seen corresponding path program 1 times [2018-01-27 23:12:31,612 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:12:31,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:12:31,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:31,614 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:12:31,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:12:31,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:12:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 23:12:31,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:12:31,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:12:31,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:12:31,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:12:31,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:12:31,870 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 2 states. [2018-01-27 23:12:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:12:31,921 INFO L93 Difference]: Finished difference Result 338 states and 427 transitions. [2018-01-27 23:12:31,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:12:31,922 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 39 [2018-01-27 23:12:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:12:31,929 INFO L225 Difference]: With dead ends: 338 [2018-01-27 23:12:31,930 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 23:12:31,934 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:12:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 23:12:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 23:12:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 23:12:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 23:12:31,955 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-01-27 23:12:31,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:12:31,955 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 23:12:31,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:12:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 23:12:31,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 23:12:31,959 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:12:31,959 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:12:31,959 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:12:31,959 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:12:31,960 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:12:31,960 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:12:31,960 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:12:31,960 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-27 23:12:31,960 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:12:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2018-01-27 23:12:31,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-27 23:12:31,966 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:12:31,966 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:12:31,966 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:12:31,967 INFO L82 PathProgramCache]: Analyzing trace with hash -341062957, now seen corresponding path program 1 times [2018-01-27 23:12:31,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:12:31,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:12:31,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:31,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:12:31,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:12:32,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:12:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 23:12:32,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:12:32,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:12:32,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:12:32,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:12:32,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:12:32,045 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 2 states. [2018-01-27 23:12:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:12:32,064 INFO L93 Difference]: Finished difference Result 338 states and 427 transitions. [2018-01-27 23:12:32,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:12:32,065 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2018-01-27 23:12:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:12:32,075 INFO L225 Difference]: With dead ends: 338 [2018-01-27 23:12:32,076 INFO L226 Difference]: Without dead ends: 319 [2018-01-27 23:12:32,076 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:12:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-27 23:12:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-01-27 23:12:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-01-27 23:12:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 404 transitions. [2018-01-27 23:12:32,108 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 404 transitions. Word has length 44 [2018-01-27 23:12:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:12:32,109 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 404 transitions. [2018-01-27 23:12:32,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:12:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 404 transitions. [2018-01-27 23:12:32,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-27 23:12:32,111 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:12:32,111 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-27 23:12:32,111 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:12:32,112 INFO L82 PathProgramCache]: Analyzing trace with hash 823787952, now seen corresponding path program 1 times [2018-01-27 23:12:32,112 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:12:32,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:12:32,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:32,114 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:12:32,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:12:32,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:12:32,592 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 25 DAG size of output 23 [2018-01-27 23:12:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 23:12:32,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:12:32,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-27 23:12:32,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-27 23:12:32,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-27 23:12:32,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-27 23:12:32,704 INFO L87 Difference]: Start difference. First operand 319 states and 404 transitions. Second operand 7 states. [2018-01-27 23:12:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:12:35,461 INFO L93 Difference]: Finished difference Result 1012 states and 1323 transitions. [2018-01-27 23:12:35,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:12:35,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-01-27 23:12:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:12:35,471 INFO L225 Difference]: With dead ends: 1012 [2018-01-27 23:12:35,472 INFO L226 Difference]: Without dead ends: 732 [2018-01-27 23:12:35,474 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:12:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-01-27 23:12:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 327. [2018-01-27 23:12:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-01-27 23:12:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 413 transitions. [2018-01-27 23:12:35,504 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 413 transitions. Word has length 55 [2018-01-27 23:12:35,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:12:35,505 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 413 transitions. [2018-01-27 23:12:35,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-27 23:12:35,505 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 413 transitions. [2018-01-27 23:12:35,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-27 23:12:35,507 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:12:35,508 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-27 23:12:35,508 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:12:35,508 INFO L82 PathProgramCache]: Analyzing trace with hash -382237845, now seen corresponding path program 1 times [2018-01-27 23:12:35,508 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:12:35,508 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:12:35,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:35,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:12:35,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:12:35,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:12:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 23:12:35,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:12:35,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-27 23:12:35,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-27 23:12:35,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-27 23:12:35,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-27 23:12:35,741 INFO L87 Difference]: Start difference. First operand 327 states and 413 transitions. Second operand 7 states. [2018-01-27 23:12:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:12:37,021 INFO L93 Difference]: Finished difference Result 1012 states and 1322 transitions. [2018-01-27 23:12:37,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:12:37,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-01-27 23:12:37,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:12:37,028 INFO L225 Difference]: With dead ends: 1012 [2018-01-27 23:12:37,028 INFO L226 Difference]: Without dead ends: 732 [2018-01-27 23:12:37,031 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:12:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-01-27 23:12:37,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 329. [2018-01-27 23:12:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-01-27 23:12:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 415 transitions. [2018-01-27 23:12:37,056 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 415 transitions. Word has length 57 [2018-01-27 23:12:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:12:37,057 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 415 transitions. [2018-01-27 23:12:37,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-27 23:12:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 415 transitions. [2018-01-27 23:12:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-27 23:12:37,059 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:12:37,059 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-27 23:12:37,059 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-27 23:12:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash -653052046, now seen corresponding path program 1 times [2018-01-27 23:12:37,060 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:12:37,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:12:37,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:37,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:12:37,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:12:37,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:12:37,887 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 36 DAG size of output 33 [2018-01-27 23:12:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 23:12:37,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:12:37,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-27 23:12:37,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-27 23:12:37,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-27 23:12:37,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-27 23:12:37,926 INFO L87 Difference]: Start difference. First operand 329 states and 415 transitions. Second operand 10 states. [2018-01-27 23:12:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:12:40,431 INFO L93 Difference]: Finished difference Result 329 states and 415 transitions. [2018-01-27 23:12:40,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:12:40,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-01-27 23:12:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:12:40,432 INFO L225 Difference]: With dead ends: 329 [2018-01-27 23:12:40,432 INFO L226 Difference]: Without dead ends: 0 [2018-01-27 23:12:40,433 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-01-27 23:12:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-27 23:12:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-27 23:12:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-27 23:12:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-27 23:12:40,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2018-01-27 23:12:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:12:40,434 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-27 23:12:40,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-27 23:12:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-27 23:12:40,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-27 23:12:40,436 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-27 23:12:40,436 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-27 23:12:40,436 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-27 23:12:40,436 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-27 23:12:40,436 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-27 23:12:40,436 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-27 23:12:40,437 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-27 23:12:40,437 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-27 23:12:40,437 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-27 23:12:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2018-01-27 23:12:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-27 23:12:40,444 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:12:40,444 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:12:40,444 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-27 23:12:40,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1639866714, now seen corresponding path program 1 times [2018-01-27 23:12:40,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:12:40,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:12:40,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:40,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:12:40,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:12:40,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:12:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 23:12:40,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:12:40,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-27 23:12:40,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-27 23:12:40,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-27 23:12:40,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:12:40,516 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 2 states. [2018-01-27 23:12:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:12:40,524 INFO L93 Difference]: Finished difference Result 338 states and 427 transitions. [2018-01-27 23:12:40,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-27 23:12:40,524 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 42 [2018-01-27 23:12:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:12:40,526 INFO L225 Difference]: With dead ends: 338 [2018-01-27 23:12:40,526 INFO L226 Difference]: Without dead ends: 317 [2018-01-27 23:12:40,527 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-27 23:12:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-01-27 23:12:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-01-27 23:12:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-01-27 23:12:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 402 transitions. [2018-01-27 23:12:40,546 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 402 transitions. Word has length 42 [2018-01-27 23:12:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:12:40,548 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 402 transitions. [2018-01-27 23:12:40,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-27 23:12:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 402 transitions. [2018-01-27 23:12:40,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-27 23:12:40,550 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:12:40,550 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-27 23:12:40,550 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-27 23:12:40,550 INFO L82 PathProgramCache]: Analyzing trace with hash -602494089, now seen corresponding path program 1 times [2018-01-27 23:12:40,551 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:12:40,551 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:12:40,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:40,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:12:40,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:12:40,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:12:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 23:12:40,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:12:40,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-27 23:12:40,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-27 23:12:40,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-27 23:12:40,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-27 23:12:40,805 INFO L87 Difference]: Start difference. First operand 317 states and 402 transitions. Second operand 7 states. [2018-01-27 23:12:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:12:43,257 INFO L93 Difference]: Finished difference Result 1008 states and 1319 transitions. [2018-01-27 23:12:43,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:12:43,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-01-27 23:12:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:12:43,262 INFO L225 Difference]: With dead ends: 1008 [2018-01-27 23:12:43,262 INFO L226 Difference]: Without dead ends: 730 [2018-01-27 23:12:43,263 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:12:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-01-27 23:12:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 325. [2018-01-27 23:12:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-01-27 23:12:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 411 transitions. [2018-01-27 23:12:43,280 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 411 transitions. Word has length 53 [2018-01-27 23:12:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:12:43,280 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 411 transitions. [2018-01-27 23:12:43,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-27 23:12:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 411 transitions. [2018-01-27 23:12:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-27 23:12:43,282 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:12:43,282 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-27 23:12:43,282 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-27 23:12:43,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1886429198, now seen corresponding path program 1 times [2018-01-27 23:12:43,282 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:12:43,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:12:43,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:43,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:12:43,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-27 23:12:43,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-27 23:12:43,815 WARN L146 SmtUtils]: Spent 369ms on a formula simplification. DAG size of input: 25 DAG size of output 23 [2018-01-27 23:12:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-27 23:12:43,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-27 23:12:43,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-27 23:12:43,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-27 23:12:43,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-27 23:12:43,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-27 23:12:43,867 INFO L87 Difference]: Start difference. First operand 325 states and 411 transitions. Second operand 7 states. [2018-01-27 23:12:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-27 23:12:46,199 INFO L93 Difference]: Finished difference Result 1008 states and 1318 transitions. [2018-01-27 23:12:46,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-27 23:12:46,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-01-27 23:12:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-27 23:12:46,203 INFO L225 Difference]: With dead ends: 1008 [2018-01-27 23:12:46,203 INFO L226 Difference]: Without dead ends: 730 [2018-01-27 23:12:46,204 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-27 23:12:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-01-27 23:12:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 327. [2018-01-27 23:12:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-01-27 23:12:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 413 transitions. [2018-01-27 23:12:46,219 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 413 transitions. Word has length 55 [2018-01-27 23:12:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-27 23:12:46,219 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 413 transitions. [2018-01-27 23:12:46,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-27 23:12:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 413 transitions. [2018-01-27 23:12:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-27 23:12:46,220 INFO L322 BasicCegarLoop]: Found error trace [2018-01-27 23:12:46,221 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-27 23:12:46,221 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-27 23:12:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash 17197497, now seen corresponding path program 1 times [2018-01-27 23:12:46,222 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-27 23:12:46,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-27 23:12:46,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:46,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-27 23:12:46,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-27 23:12:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:12:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-27 23:12:46,364 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-27 23:12:46,389 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:12:46,410 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:12:46,411 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-27 23:12:46,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:12:46 BoogieIcfgContainer [2018-01-27 23:12:46,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-27 23:12:46,459 INFO L168 Benchmark]: Toolchain (without parser) took 18429.70 ms. Allocated memory was 299.4 MB in the beginning and 602.9 MB in the end (delta: 303.6 MB). Free memory was 258.1 MB in the beginning and 532.9 MB in the end (delta: -274.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 5.3 GB. [2018-01-27 23:12:46,462 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 299.4 MB. Free memory is still 264.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-27 23:12:46,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.39 ms. Allocated memory is still 299.4 MB. Free memory was 256.1 MB in the beginning and 230.0 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. [2018-01-27 23:12:46,462 INFO L168 Benchmark]: Boogie Preprocessor took 100.25 ms. Allocated memory is still 299.4 MB. Free memory was 230.0 MB in the beginning and 226.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-01-27 23:12:46,463 INFO L168 Benchmark]: RCFGBuilder took 2305.80 ms. Allocated memory was 299.4 MB in the beginning and 324.0 MB in the end (delta: 24.6 MB). Free memory was 226.0 MB in the beginning and 248.3 MB in the end (delta: -22.3 MB). Peak memory consumption was 57.7 MB. Max. memory is 5.3 GB. [2018-01-27 23:12:46,463 INFO L168 Benchmark]: TraceAbstraction took 15275.69 ms. Allocated memory was 324.0 MB in the beginning and 602.9 MB in the end (delta: 278.9 MB). Free memory was 248.3 MB in the beginning and 532.9 MB in the end (delta: -284.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-27 23:12:46,469 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 299.4 MB. Free memory is still 264.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 730.39 ms. Allocated memory is still 299.4 MB. Free memory was 256.1 MB in the beginning and 230.0 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 100.25 ms. Allocated memory is still 299.4 MB. Free memory was 230.0 MB in the beginning and 226.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 2305.80 ms. Allocated memory was 299.4 MB in the beginning and 324.0 MB in the end (delta: 24.6 MB). Free memory was 226.0 MB in the beginning and 248.3 MB in the end (delta: -22.3 MB). Peak memory consumption was 57.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15275.69 ms. Allocated memory was 324.0 MB in the beginning and 602.9 MB in the end (delta: 278.9 MB). Free memory was 248.3 MB in the beginning and 532.9 MB in the end (delta: -284.6 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 326 locations, 4 error locations. UNSAFE Result, 0.3s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 1026]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ssl3_connectErr0EnsuresViolation CFG has 4 procedures, 326 locations, 4 error locations. SAFE Result, 0.3s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 408 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 1444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 326 locations, 4 error locations. SAFE Result, 8.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1396 SDtfs, 2213 SDslu, 2805 SDs, 0 SdLazy, 3513 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=3, 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.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 808 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 96181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 1064]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseAnd at line 1249. Possible FailurePath: [L1065] EXPR, FCALL malloc(sizeof(SSL)) VAL [malloc(sizeof(SSL))={4294967321:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; VAL [malloc(sizeof(SSL))={4294967321:0}, s={4294967321:0}] [L1069] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) VAL [malloc(sizeof(SSL))={4294967321:0}, malloc(sizeof(struct ssl3_state_st))={4294967322:0}, s={4294967321:0}] [L1069] FCALL s->s3 = malloc(sizeof(struct ssl3_state_st)) VAL [malloc(sizeof(SSL))={4294967321:0}, malloc(sizeof(struct ssl3_state_st))={4294967322:0}, s={4294967321:0}] [L1070] EXPR, FCALL malloc(sizeof(SSL_CTX)) VAL [malloc(sizeof(SSL))={4294967321:0}, malloc(sizeof(SSL_CTX))={4294967304:0}, malloc(sizeof(struct ssl3_state_st))={4294967322:0}, s={4294967321:0}] [L1070] FCALL s->ctx = malloc(sizeof(SSL_CTX)) VAL [malloc(sizeof(SSL))={4294967321:0}, malloc(sizeof(SSL_CTX))={4294967304:0}, malloc(sizeof(struct ssl3_state_st))={4294967322:0}, s={4294967321:0}] [L1071] EXPR, FCALL malloc(sizeof(SSL_SESSION)) VAL [malloc(sizeof(SSL))={4294967321:0}, malloc(sizeof(SSL_CTX))={4294967304:0}, malloc(sizeof(SSL_SESSION))={4294967293:0}, malloc(sizeof(struct ssl3_state_st))={4294967322:0}, s={4294967321:0}] [L1071] FCALL s->session = malloc(sizeof(SSL_SESSION)) VAL [malloc(sizeof(SSL))={4294967321:0}, malloc(sizeof(SSL_CTX))={4294967304:0}, malloc(sizeof(SSL_SESSION))={4294967293:0}, malloc(sizeof(struct ssl3_state_st))={4294967322:0}, s={4294967321:0}] [L1072] FCALL s->state = 12292 VAL [malloc(sizeof(SSL))={4294967321:0}, malloc(sizeof(SSL_CTX))={4294967304:0}, malloc(sizeof(SSL_SESSION))={4294967293:0}, malloc(sizeof(struct ssl3_state_st))={4294967322:0}, s={4294967321:0}] [L1073] FCALL s->version = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, malloc(sizeof(SSL))={4294967321:0}, malloc(sizeof(SSL_CTX))={4294967304:0}, malloc(sizeof(SSL_SESSION))={4294967293:0}, malloc(sizeof(struct ssl3_state_st))={4294967322:0}, s={4294967321:0}] [L1074] CALL ssl3_connect(s) VAL [s={4294967321:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 = __VERIFIER_nondet_int() ; [L1093] int tmp___4 = __VERIFIER_nondet_int() ; [L1094] int tmp___5 = __VERIFIER_nondet_int() ; [L1095] int tmp___6 = __VERIFIER_nondet_int() ; [L1096] int tmp___7 = __VERIFIER_nondet_int() ; [L1097] int tmp___8 = __VERIFIER_nondet_int() ; [L1098] long tmp___9 = __VERIFIER_nondet_long() ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] FCALL s->hit=__VERIFIER_nondet_int () VAL [__VERIFIER_nondet_int ()=0, blastFlag=0, s={4294967321:0}, s={4294967321:0}, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1104] FCALL s->state = 12292 VAL [blastFlag=0, s={4294967321:0}, s={4294967321:0}, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 VAL [={0:0}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, skip=0, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1109] FCALL *tmp___0 = 0 VAL [={0:0}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, skip=0, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1110] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, s->info_callback={4294967292:5}, skip=0, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, s->info_callback={4294967292:5}, skip=0, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1111] cb = s->info_callback [L1119] EXPR, FCALL s->in_handshake VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, s->in_handshake=-5, skip=0, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1119] FCALL s->in_handshake += 1 VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, s->in_handshake=-5, skip=0, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1120] COND FALSE !(tmp___1 & 12288) VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, skip=0, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, skip=0, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR, FCALL s->state VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, s->state=12292, skip=0, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, s->state=12292, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND TRUE s->state == 12292 [L1236] FCALL s->new_session = 1 VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1237] FCALL s->state = 4096 VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1238] EXPR, FCALL s->ctx VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, s->ctx={4294967304:0}, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1238] EXPR, FCALL (s->ctx)->stats.sess_connect_renegotiate VAL [={4294967292:5}, (s->ctx)->stats.sess_connect_renegotiate=0, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, s->ctx={4294967304:0}, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1238] FCALL (s->ctx)->stats.sess_connect_renegotiate += 1 VAL [={4294967292:5}, (s->ctx)->stats.sess_connect_renegotiate=0, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, s->ctx={4294967304:0}, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1243] FCALL s->server = 0 VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] EXPR, FCALL s->version VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, s->version=0, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] COND TRUE (s->version & 65280) != 768 [L1250] ret = -1 VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1636] EXPR, FCALL s->in_handshake VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, s->in_handshake=-4, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1636] FCALL s->in_handshake -= 1 VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, s->in_handshake=-4, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1637] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={4294967292:5}, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1642] RET return (ret); VAL [={4294967292:5}, \result=-1, blastFlag=0, ret=-1, s={4294967321:0}, s={4294967321:0}, skip=0, state=12292, tmp=0, tmp___0={4294967324:4294967314}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L1074] ssl3_connect(s) VAL [malloc(sizeof(SSL))={4294967321:0}, malloc(sizeof(SSL_CTX))={4294967304:0}, malloc(sizeof(SSL_SESSION))={4294967293:0}, malloc(sizeof(struct ssl3_state_st))={4294967322:0}, s={4294967321:0}, ssl3_connect(s)=-1] [L1076] return (0); VAL [\result=0, malloc(sizeof(SSL))={4294967321:0}, malloc(sizeof(SSL_CTX))={4294967304:0}, malloc(sizeof(SSL_SESSION))={4294967293:0}, malloc(sizeof(struct ssl3_state_st))={4294967322:0}, s={4294967321:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 326 locations, 4 error locations. UNSAFE Result, 6.0s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1000 SDtfs, 2242 SDslu, 2339 SDs, 0 SdLazy, 1677 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=327occurred in iteration=3, 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 808 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 44417 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt.blast.02_false-unreach-call.i.cil.c_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-27_23-12-46-484.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt.blast.02_false-unreach-call.i.cil.c_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-27_23-12-46-484.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt.blast.02_false-unreach-call.i.cil.c_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-27_23-12-46-484.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt.blast.02_false-unreach-call.i.cil.c_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-27_23-12-46-484.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt.blast.02_false-unreach-call.i.cil.c_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-27_23-12-46-484.csv Received shutdown request...