./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-2.c -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 81368a04ddec74974b3367923efd498feea8a623 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-30f4e4a [2019-11-27 22:35:33,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:33,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:33,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:33,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:33,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:33,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:33,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:33,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:33,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:33,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:33,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:33,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:33,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:33,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:33,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:33,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:33,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:33,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:33,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:33,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:33,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:33,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:33,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:33,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:33,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:33,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:33,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:33,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:33,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:33,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:33,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:33,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:33,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:33,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:33,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:33,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:33,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:33,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:33,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:33,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:33,706 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:35:33,720 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:33,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:33,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:33,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:33,723 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:33,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:33,723 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:33,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:33,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:33,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:33,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:33,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:33,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:33,726 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:33,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:33,726 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:33,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:33,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:33,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:33,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:33,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:33,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:33,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:33,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:33,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:33,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:33,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:33,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:33,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 81368a04ddec74974b3367923efd498feea8a623 [2019-11-27 22:35:34,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:34,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:34,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:34,039 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:34,039 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:34,040 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-2.c [2019-11-27 22:35:34,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd9793f2/5804283753844014a31a4d4fc5ee8c52/FLAG825ca7dc3 [2019-11-27 22:35:34,603 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:34,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_clnt_4.cil-2.c [2019-11-27 22:35:34,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd9793f2/5804283753844014a31a4d4fc5ee8c52/FLAG825ca7dc3 [2019-11-27 22:35:34,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd9793f2/5804283753844014a31a4d4fc5ee8c52 [2019-11-27 22:35:34,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:34,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:34,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:34,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:34,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:34,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:34" (1/1) ... [2019-11-27 22:35:34,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e4995b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:34, skipping insertion in model container [2019-11-27 22:35:34,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:34" (1/1) ... [2019-11-27 22:35:34,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:35,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:35,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:35,282 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:35,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:35,425 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:35,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35 WrapperNode [2019-11-27 22:35:35,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:35,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:35,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:35,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:35,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:35,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:35,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:35,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:35,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (1/1) ... [2019-11-27 22:35:35,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:35,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:35,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:35,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:35,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (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 [2019-11-27 22:35:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:35,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:35,767 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:36,401 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-27 22:35:36,402 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-27 22:35:36,406 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:36,406 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:35:36,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:36 BoogieIcfgContainer [2019-11-27 22:35:36,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:36,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:36,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:36,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:36,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:34" (1/3) ... [2019-11-27 22:35:36,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105440a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:36, skipping insertion in model container [2019-11-27 22:35:36,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:35" (2/3) ... [2019-11-27 22:35:36,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105440a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:36, skipping insertion in model container [2019-11-27 22:35:36,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:36" (3/3) ... [2019-11-27 22:35:36,416 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-2.c [2019-11-27 22:35:36,427 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:36,439 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:36,452 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:36,476 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:36,476 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:36,476 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:36,477 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:36,477 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:36,477 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:36,477 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:36,477 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-27 22:35:36,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:36,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:36,503 INFO L410 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] [2019-11-27 22:35:36,503 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:36,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:36,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-27 22:35:36,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:36,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687680199] [2019-11-27 22:35:36,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:36,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687680199] [2019-11-27 22:35:36,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:36,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:36,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814835890] [2019-11-27 22:35:36,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:36,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:36,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:36,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:36,716 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-27 22:35:36,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:36,946 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-27 22:35:36,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:36,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:36,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:36,962 INFO L225 Difference]: With dead ends: 251 [2019-11-27 22:35:36,962 INFO L226 Difference]: Without dead ends: 114 [2019-11-27 22:35:36,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-27 22:35:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-27 22:35:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-27 22:35:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-27 22:35:37,016 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-27 22:35:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:37,017 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-27 22:35:37,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-27 22:35:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:35:37,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:37,019 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 22:35:37,019 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:37,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:37,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-27 22:35:37,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:37,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354260605] [2019-11-27 22:35:37,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:37,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354260605] [2019-11-27 22:35:37,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:37,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:37,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907224741] [2019-11-27 22:35:37,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:37,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:37,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:37,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,132 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-27 22:35:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:37,323 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-11-27 22:35:37,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:37,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-27 22:35:37,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:37,326 INFO L225 Difference]: With dead ends: 237 [2019-11-27 22:35:37,326 INFO L226 Difference]: Without dead ends: 132 [2019-11-27 22:35:37,328 INFO L630 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 [2019-11-27 22:35:37,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-27 22:35:37,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-11-27 22:35:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-27 22:35:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-27 22:35:37,340 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-27 22:35:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:37,341 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-27 22:35:37,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-27 22:35:37,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 22:35:37,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:37,343 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 22:35:37,343 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:37,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-11-27 22:35:37,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:37,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755986735] [2019-11-27 22:35:37,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:35:37,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755986735] [2019-11-27 22:35:37,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:37,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:37,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178873816] [2019-11-27 22:35:37,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:37,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:37,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:37,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,430 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-27 22:35:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:37,598 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-11-27 22:35:37,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:37,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-27 22:35:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:37,604 INFO L225 Difference]: With dead ends: 270 [2019-11-27 22:35:37,604 INFO L226 Difference]: Without dead ends: 150 [2019-11-27 22:35:37,606 INFO L630 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 [2019-11-27 22:35:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-27 22:35:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-11-27 22:35:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-27 22:35:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-27 22:35:37,628 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-27 22:35:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:37,629 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-27 22:35:37,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-27 22:35:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:35:37,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:37,636 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:37,637 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1168366188, now seen corresponding path program 1 times [2019-11-27 22:35:37,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:37,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288050472] [2019-11-27 22:35:37,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:35:37,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288050472] [2019-11-27 22:35:37,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:37,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:37,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127436287] [2019-11-27 22:35:37,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:37,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:37,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:37,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:37,793 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-27 22:35:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:37,993 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-27 22:35:37,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:37,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:35:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:37,996 INFO L225 Difference]: With dead ends: 334 [2019-11-27 22:35:37,999 INFO L226 Difference]: Without dead ends: 196 [2019-11-27 22:35:38,000 INFO L630 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 [2019-11-27 22:35:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-27 22:35:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-27 22:35:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-27 22:35:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-27 22:35:38,030 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-27 22:35:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:38,033 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-27 22:35:38,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-27 22:35:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:35:38,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:38,039 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:38,039 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:38,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1321162774, now seen corresponding path program 1 times [2019-11-27 22:35:38,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:38,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265615956] [2019-11-27 22:35:38,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:35:38,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265615956] [2019-11-27 22:35:38,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:38,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:38,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120488658] [2019-11-27 22:35:38,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:38,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:38,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:38,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,153 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-27 22:35:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:38,296 INFO L93 Difference]: Finished difference Result 390 states and 556 transitions. [2019-11-27 22:35:38,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:38,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:35:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:38,298 INFO L225 Difference]: With dead ends: 390 [2019-11-27 22:35:38,298 INFO L226 Difference]: Without dead ends: 212 [2019-11-27 22:35:38,299 INFO L630 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 [2019-11-27 22:35:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-27 22:35:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2019-11-27 22:35:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-27 22:35:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-27 22:35:38,327 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-27 22:35:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:38,327 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-27 22:35:38,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-27 22:35:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:35:38,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:38,332 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2019-11-27 22:35:38,332 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:38,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:38,333 INFO L82 PathProgramCache]: Analyzing trace with hash -136835443, now seen corresponding path program 1 times [2019-11-27 22:35:38,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:38,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469508999] [2019-11-27 22:35:38,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-27 22:35:38,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469508999] [2019-11-27 22:35:38,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:38,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:38,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470144717] [2019-11-27 22:35:38,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:38,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:38,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:38,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,419 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-27 22:35:38,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:38,547 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-27 22:35:38,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:38,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:35:38,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:38,550 INFO L225 Difference]: With dead ends: 427 [2019-11-27 22:35:38,550 INFO L226 Difference]: Without dead ends: 230 [2019-11-27 22:35:38,551 INFO L630 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 [2019-11-27 22:35:38,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-27 22:35:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-27 22:35:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-27 22:35:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-27 22:35:38,560 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-27 22:35:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:38,560 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-27 22:35:38,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-27 22:35:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-27 22:35:38,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:38,563 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 22:35:38,563 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:38,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1324345659, now seen corresponding path program 1 times [2019-11-27 22:35:38,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:38,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726913345] [2019-11-27 22:35:38,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:35:38,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726913345] [2019-11-27 22:35:38,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:38,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:38,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722433917] [2019-11-27 22:35:38,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:38,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:38,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:38,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:38,662 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-27 22:35:38,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:38,707 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-27 22:35:38,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:38,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-27 22:35:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:38,711 INFO L225 Difference]: With dead ends: 661 [2019-11-27 22:35:38,712 INFO L226 Difference]: Without dead ends: 443 [2019-11-27 22:35:38,713 INFO L630 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 [2019-11-27 22:35:38,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-27 22:35:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-27 22:35:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-27 22:35:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-27 22:35:38,728 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-27 22:35:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:38,729 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-27 22:35:38,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-27 22:35:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-27 22:35:38,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:38,731 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 22:35:38,732 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:38,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:38,732 INFO L82 PathProgramCache]: Analyzing trace with hash -606282988, now seen corresponding path program 1 times [2019-11-27 22:35:38,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:38,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493786313] [2019-11-27 22:35:38,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:38,880 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:35:38,881 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:35:38,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:35:38 BoogieIcfgContainer [2019-11-27 22:35:38,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:35:38,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:35:38,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:35:38,974 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:35:38,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:36" (3/4) ... [2019-11-27 22:35:38,977 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:35:39,133 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:35:39,133 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:35:39,136 INFO L168 Benchmark]: Toolchain (without parser) took 4173.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -210.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:39,136 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:39,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:39,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:39,137 INFO L168 Benchmark]: Boogie Preprocessor took 36.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:39,138 INFO L168 Benchmark]: RCFGBuilder took 877.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:39,138 INFO L168 Benchmark]: TraceAbstraction took 2564.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -112.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:39,139 INFO L168 Benchmark]: Witness Printer took 160.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:39,141 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 463.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 877.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2564.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -112.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 160.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 548]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L553] int s ; [L557] s = 12292 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__bbio = __VERIFIER_nondet_int() ; [L20] int s__wbio = __VERIFIER_nondet_int() ; [L21] int s__hit = __VERIFIER_nondet_int() ; [L22] int s__rwstate ; [L23] int s__init_buf___0 = __VERIFIER_nondet_int() ; [L24] int s__debug = __VERIFIER_nondet_int() ; [L25] int s__shutdown ; [L26] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L27] int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_int() ; [L28] int s__ctx__stats__sess_connect = __VERIFIER_nondet_int() ; [L29] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int() ; [L31] int s__s3__change_cipher_spec ; [L32] int s__s3__flags = __VERIFIER_nondet_int() ; [L33] int s__s3__delay_buf_pop_ret ; [L34] int s__s3__tmp__cert_req = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__new_compression = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int() ; [L41] int s__session__cipher ; [L42] int s__session__compress_meth ; [L43] int buf ; [L44] unsigned long tmp ; [L45] unsigned long l ; [L46] int num1 = __VERIFIER_nondet_int() ; [L47] int cb ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int tmp___0 ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 = __VERIFIER_nondet_int() ; [L60] int tmp___8 = __VERIFIER_nondet_int() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] long __cil_tmp57 ; [L66] long __cil_tmp58 ; [L67] long __cil_tmp59 ; [L68] long __cil_tmp60 ; [L69] long __cil_tmp61 ; [L70] long __cil_tmp62 ; [L71] long __cil_tmp63 ; [L72] long __cil_tmp64 ; [L73] long __cil_tmp65 ; [L77] s__state = initial_state [L78] blastFlag = 0 [L79] tmp = __VERIFIER_nondet_int() [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] tmp___0 = 0 [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback [L91] s__in_handshake ++ [L92] COND FALSE !(tmp___1 + 12288) [L98] COND TRUE 1 [L100] state = s__state [L101] COND TRUE s__state == 12292 [L203] s__new_session = 1 [L204] s__state = 4096 [L205] s__ctx__stats__sess_connect_renegotiate ++ [L210] s__server = 0 [L211] COND TRUE cb != 0 [L215] __cil_tmp55 = s__version + 65280 [L216] COND FALSE !(__cil_tmp55 != 768) [L221] s__type = 4096 [L222] COND FALSE !(s__init_buf___0 == 0) [L234] COND FALSE !(! tmp___4) [L238] COND FALSE !(! tmp___5) [L242] s__state = 4368 [L243] s__ctx__stats__sess_connect ++ [L244] s__init_num = 0 [L520] COND FALSE !(! s__s3__tmp__reuse_message) [L537] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND TRUE s__state == 4368 [L248] s__shutdown = 0 [L249] ret = __VERIFIER_nondet_int() [L250] COND TRUE blastFlag == 0 [L251] blastFlag = 1 [L253] COND FALSE !(ret <= 0) [L256] s__state = 4384 [L257] s__init_num = 0 [L258] COND TRUE s__bbio != s__wbio [L520] COND FALSE !(! s__s3__tmp__reuse_message) [L537] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND FALSE !(s__state == 4368) [L119] COND FALSE !(s__state == 4369) [L122] COND TRUE s__state == 4384 [L264] ret = __VERIFIER_nondet_int() [L265] COND TRUE blastFlag == 1 [L266] blastFlag = 2 [L268] COND FALSE !(ret <= 0) [L271] COND FALSE !(\read(s__hit)) [L274] s__state = 4400 [L276] s__init_num = 0 [L520] COND FALSE !(! s__s3__tmp__reuse_message) [L537] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND FALSE !(s__state == 4368) [L119] COND FALSE !(s__state == 4369) [L122] COND FALSE !(s__state == 4384) [L125] COND FALSE !(s__state == 4385) [L128] COND TRUE s__state == 4400 [L281] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L282] COND FALSE !(__cil_tmp56 + 256UL) [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 2 [L287] blastFlag = 3 [L293] COND FALSE !(ret <= 0) [L298] s__state = 4416 [L299] s__init_num = 0 [L520] COND FALSE !(! s__s3__tmp__reuse_message) [L537] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND FALSE !(s__state == 4368) [L119] COND FALSE !(s__state == 4369) [L122] COND FALSE !(s__state == 4384) [L125] COND FALSE !(s__state == 4385) [L128] COND FALSE !(s__state == 4400) [L131] COND FALSE !(s__state == 4401) [L134] COND TRUE s__state == 4416 [L303] ret = __VERIFIER_nondet_int() [L304] COND TRUE blastFlag == 3 [L305] blastFlag = 4 [L307] COND FALSE !(ret <= 0) [L310] s__state = 4432 [L311] s__init_num = 0 [L312] COND FALSE !(! tmp___6) [L520] COND FALSE !(! s__s3__tmp__reuse_message) [L537] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND FALSE !(s__state == 4368) [L119] COND FALSE !(s__state == 4369) [L122] COND FALSE !(s__state == 4384) [L125] COND FALSE !(s__state == 4385) [L128] COND FALSE !(s__state == 4400) [L131] COND FALSE !(s__state == 4401) [L134] COND FALSE !(s__state == 4416) [L137] COND FALSE !(s__state == 4417) [L140] COND TRUE s__state == 4432 [L319] ret = __VERIFIER_nondet_int() [L320] COND TRUE blastFlag == 4 [L548] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1223 SDtfs, 255 SDslu, 651 SDs, 0 SdLazy, 617 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 47530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 316/316 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...