./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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_1.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 bdbeb15a4b6276d844a5889cd53cbf9564381e20 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-11-28 15:39:57,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:39:57,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:39:57,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:39:57,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:39:57,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:39:57,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:39:57,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:39:57,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:39:57,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:39:57,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:39:57,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:39:57,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:39:57,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:39:57,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:39:57,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:39:57,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:39:57,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:39:57,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:39:57,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:39:57,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:39:57,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:39:57,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:39:57,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:39:57,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:39:57,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:39:57,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:39:57,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:39:57,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:39:57,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:39:57,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:39:57,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:39:57,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:39:57,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:39:57,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:39:57,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:39:57,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:39:57,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:39:57,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:39:57,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:39:57,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:39:57,556 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:39:57,589 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:39:57,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:39:57,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:39:57,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:39:57,596 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:39:57,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:39:57,597 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:39:57,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:39:57,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:39:57,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:39:57,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:39:57,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:39:57,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:39:57,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:39:57,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:39:57,602 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:39:57,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:39:57,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:39:57,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:39:57,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:39:57,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:39:57,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:39:57,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:39:57,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:39:57,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:39:57,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:39:57,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:39:57,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:39:57,607 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:39:57,607 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 -> bdbeb15a4b6276d844a5889cd53cbf9564381e20 [2019-11-28 15:39:57,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:39:57,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:39:57,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:39:57,928 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:39:57,929 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:39:57,929 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-2.c [2019-11-28 15:39:58,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bce3e9ca/b7c76aa51dd8434fb53079fd8daa8122/FLAGbd340098f [2019-11-28 15:39:58,527 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:39:58,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-2.c [2019-11-28 15:39:58,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bce3e9ca/b7c76aa51dd8434fb53079fd8daa8122/FLAGbd340098f [2019-11-28 15:39:58,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bce3e9ca/b7c76aa51dd8434fb53079fd8daa8122 [2019-11-28 15:39:58,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:39:58,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:39:58,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:39:58,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:39:58,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:39:58,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:58" (1/1) ... [2019-11-28 15:39:58,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f897cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:58, skipping insertion in model container [2019-11-28 15:39:58,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:58" (1/1) ... [2019-11-28 15:39:58,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:39:58,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:39:59,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:39:59,257 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:39:59,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:39:59,398 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:39:59,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:59 WrapperNode [2019-11-28 15:39:59,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:39:59,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:39:59,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:39:59,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:39:59,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:59" (1/1) ... [2019-11-28 15:39:59,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:59" (1/1) ... [2019-11-28 15:39:59,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:39:59,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:39:59,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:39:59,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:39:59,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:59" (1/1) ... [2019-11-28 15:39:59,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:59" (1/1) ... [2019-11-28 15:39:59,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:59" (1/1) ... [2019-11-28 15:39:59,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:59" (1/1) ... [2019-11-28 15:39:59,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:59" (1/1) ... [2019-11-28 15:39:59,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:59" (1/1) ... [2019-11-28 15:39:59,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:59" (1/1) ... [2019-11-28 15:39:59,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:39:59,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:39:59,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:39:59,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:39:59,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:59" (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-28 15:39:59,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:39:59,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:39:59,739 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:40:00,368 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-28 15:40:00,368 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-28 15:40:00,370 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:00,370 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:40:00,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:00 BoogieIcfgContainer [2019-11-28 15:40:00,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:00,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:00,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:00,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:00,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:39:58" (1/3) ... [2019-11-28 15:40:00,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f235eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:00, skipping insertion in model container [2019-11-28 15:40:00,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:59" (2/3) ... [2019-11-28 15:40:00,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f235eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:00, skipping insertion in model container [2019-11-28 15:40:00,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:00" (3/3) ... [2019-11-28 15:40:00,383 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-2.c [2019-11-28 15:40:00,395 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:00,405 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:00,417 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:00,445 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:00,445 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:00,447 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:00,448 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:00,448 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:00,448 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:00,448 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:00,448 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-28 15:40:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:00,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:00,476 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-28 15:40:00,476 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:00,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:00,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2019-11-28 15:40:00,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:00,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754565476] [2019-11-28 15:40:00,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:00,684 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-28 15:40:00,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754565476] [2019-11-28 15:40:00,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:00,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:00,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925952657] [2019-11-28 15:40:00,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:00,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:00,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:00,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:00,712 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-11-28 15:40:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:00,962 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2019-11-28 15:40:00,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:00,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:00,977 INFO L225 Difference]: With dead ends: 249 [2019-11-28 15:40:00,977 INFO L226 Difference]: Without dead ends: 113 [2019-11-28 15:40:00,981 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-28 15:40:00,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-28 15:40:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-28 15:40:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 15:40:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-11-28 15:40:01,029 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2019-11-28 15:40:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:01,029 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-11-28 15:40:01,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-11-28 15:40:01,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 15:40:01,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:01,032 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-28 15:40:01,033 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:01,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:01,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2019-11-28 15:40:01,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:01,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59755126] [2019-11-28 15:40:01,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:01,120 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-28 15:40:01,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59755126] [2019-11-28 15:40:01,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:01,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:01,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069749141] [2019-11-28 15:40:01,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:01,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:01,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:01,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:01,126 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-11-28 15:40:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:01,351 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2019-11-28 15:40:01,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:01,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-28 15:40:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:01,354 INFO L225 Difference]: With dead ends: 235 [2019-11-28 15:40:01,355 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 15:40:01,356 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-28 15:40:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 15:40:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-11-28 15:40:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 15:40:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-11-28 15:40:01,371 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2019-11-28 15:40:01,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:01,371 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-11-28 15:40:01,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-11-28 15:40:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 15:40:01,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:01,375 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-28 15:40:01,375 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:01,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2019-11-28 15:40:01,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:01,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068463965] [2019-11-28 15:40:01,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:01,479 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-28 15:40:01,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068463965] [2019-11-28 15:40:01,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:01,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:01,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909313801] [2019-11-28 15:40:01,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:01,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:01,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:01,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:01,485 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-11-28 15:40:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:01,657 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2019-11-28 15:40:01,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:01,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 15:40:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:01,662 INFO L225 Difference]: With dead ends: 268 [2019-11-28 15:40:01,662 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 15:40:01,664 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-28 15:40:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 15:40:01,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-11-28 15:40:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-28 15:40:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-11-28 15:40:01,682 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2019-11-28 15:40:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:01,683 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-11-28 15:40:01,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-11-28 15:40:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 15:40:01,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:01,686 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-28 15:40:01,687 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:01,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:01,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2019-11-28 15:40:01,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:01,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258439888] [2019-11-28 15:40:01,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:01,806 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-28 15:40:01,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258439888] [2019-11-28 15:40:01,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:01,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:01,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728122838] [2019-11-28 15:40:01,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:01,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:01,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:01,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:01,810 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-11-28 15:40:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:02,032 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2019-11-28 15:40:02,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:02,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-28 15:40:02,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:02,035 INFO L225 Difference]: With dead ends: 332 [2019-11-28 15:40:02,036 INFO L226 Difference]: Without dead ends: 195 [2019-11-28 15:40:02,037 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-28 15:40:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-28 15:40:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-11-28 15:40:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 15:40:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2019-11-28 15:40:02,050 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2019-11-28 15:40:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:02,051 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2019-11-28 15:40:02,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2019-11-28 15:40:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 15:40:02,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:02,055 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-28 15:40:02,055 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:02,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2019-11-28 15:40:02,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:02,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558836170] [2019-11-28 15:40:02,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:02,114 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-28 15:40:02,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558836170] [2019-11-28 15:40:02,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:02,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:02,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708637980] [2019-11-28 15:40:02,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:02,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:02,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:02,117 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2019-11-28 15:40:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:02,303 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2019-11-28 15:40:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:02,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-28 15:40:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:02,306 INFO L225 Difference]: With dead ends: 386 [2019-11-28 15:40:02,306 INFO L226 Difference]: Without dead ends: 209 [2019-11-28 15:40:02,307 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-28 15:40:02,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-28 15:40:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2019-11-28 15:40:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-28 15:40:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2019-11-28 15:40:02,319 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2019-11-28 15:40:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:02,319 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2019-11-28 15:40:02,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2019-11-28 15:40:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 15:40:02,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:02,323 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] [2019-11-28 15:40:02,323 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:02,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:02,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2019-11-28 15:40:02,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:02,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406556780] [2019-11-28 15:40:02,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:02,387 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-28 15:40:02,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406556780] [2019-11-28 15:40:02,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:02,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:02,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028375050] [2019-11-28 15:40:02,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:02,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:02,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:02,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:02,391 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2019-11-28 15:40:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:02,537 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2019-11-28 15:40:02,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:02,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 15:40:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:02,541 INFO L225 Difference]: With dead ends: 425 [2019-11-28 15:40:02,541 INFO L226 Difference]: Without dead ends: 229 [2019-11-28 15:40:02,542 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-28 15:40:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-28 15:40:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-11-28 15:40:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-28 15:40:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2019-11-28 15:40:02,552 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2019-11-28 15:40:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:02,553 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2019-11-28 15:40:02,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2019-11-28 15:40:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-28 15:40:02,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:02,556 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] [2019-11-28 15:40:02,556 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:02,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:02,557 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2019-11-28 15:40:02,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:02,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881121006] [2019-11-28 15:40:02,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:02,633 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-28 15:40:02,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881121006] [2019-11-28 15:40:02,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:02,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:02,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565814309] [2019-11-28 15:40:02,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:02,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:02,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:02,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:02,646 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2019-11-28 15:40:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:02,692 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2019-11-28 15:40:02,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:02,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-28 15:40:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:02,696 INFO L225 Difference]: With dead ends: 658 [2019-11-28 15:40:02,696 INFO L226 Difference]: Without dead ends: 441 [2019-11-28 15:40:02,697 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-28 15:40:02,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-28 15:40:02,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-11-28 15:40:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-28 15:40:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2019-11-28 15:40:02,737 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2019-11-28 15:40:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:02,738 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2019-11-28 15:40:02,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2019-11-28 15:40:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 15:40:02,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:02,741 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] [2019-11-28 15:40:02,742 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:02,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:02,742 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2019-11-28 15:40:02,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:02,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554587801] [2019-11-28 15:40:02,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:02,879 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 15:40:02,880 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:40:02,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:02 BoogieIcfgContainer [2019-11-28 15:40:02,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:02,990 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:02,990 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:02,991 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:02,992 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:00" (3/4) ... [2019-11-28 15:40:02,994 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 15:40:03,160 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:03,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:03,163 INFO L168 Benchmark]: Toolchain (without parser) took 4246.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -218.9 MB). Peak memory consumption was 820.6 kB. Max. memory is 11.5 GB. [2019-11-28 15:40:03,164 INFO L168 Benchmark]: CDTParser took 0.35 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-28 15:40:03,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 482.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:03,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.76 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-28 15:40:03,166 INFO L168 Benchmark]: Boogie Preprocessor took 63.52 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:03,166 INFO L168 Benchmark]: RCFGBuilder took 837.66 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: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:03,167 INFO L168 Benchmark]: TraceAbstraction took 2614.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -120.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:03,167 INFO L168 Benchmark]: Witness Printer took 170.66 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.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:03,170 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.35 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 482.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.76 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 63.52 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 837.66 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: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2614.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -120.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 170.66 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.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 543]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L548] int s ; [L552] 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 = 1; [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 ; [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 ; [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] 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 ; [L76] s__state = initial_state [L77] blastFlag = 0 [L78] tmp = __VERIFIER_nondet_int() [L79] cb = 0 [L80] ret = -1 [L81] skip = 0 [L82] tmp___0 = 0 [L83] COND TRUE s__info_callback != 0 [L84] cb = s__info_callback [L90] s__in_handshake ++ [L91] COND FALSE !(tmp___1 - 12288) [L97] COND TRUE 1 [L99] state = s__state [L100] COND TRUE s__state == 12292 [L202] s__new_session = 1 [L203] s__state = 4096 [L204] s__ctx__stats__sess_connect_renegotiate ++ [L209] s__server = 0 [L210] COND TRUE cb != 0 [L214] __cil_tmp55 = s__version - 65280 [L215] COND FALSE !(__cil_tmp55 != 768) [L220] s__type = 4096 [L221] COND FALSE !(s__init_buf___0 == 0) [L233] COND FALSE !(! tmp___4) [L237] COND FALSE !(! tmp___5) [L241] s__state = 4368 [L242] s__ctx__stats__sess_connect ++ [L243] s__init_num = 0 [L515] COND FALSE !(! s__s3__tmp__reuse_message) [L532] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 4096) [L109] COND FALSE !(s__state == 20480) [L112] COND FALSE !(s__state == 4099) [L115] COND TRUE s__state == 4368 [L247] s__shutdown = 0 [L248] ret = __VERIFIER_nondet_int() [L249] COND TRUE blastFlag == 0 [L250] blastFlag = 1 [L252] COND FALSE !(ret <= 0) [L255] s__state = 4384 [L256] s__init_num = 0 [L257] COND TRUE s__bbio != s__wbio [L515] COND FALSE !(! s__s3__tmp__reuse_message) [L532] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 4096) [L109] COND FALSE !(s__state == 20480) [L112] COND FALSE !(s__state == 4099) [L115] COND FALSE !(s__state == 4368) [L118] COND FALSE !(s__state == 4369) [L121] COND TRUE s__state == 4384 [L263] ret = __VERIFIER_nondet_int() [L264] COND TRUE blastFlag == 1 [L265] blastFlag = 2 [L267] COND FALSE !(ret <= 0) [L270] COND FALSE !(\read(s__hit)) [L273] s__state = 4400 [L275] s__init_num = 0 [L515] COND FALSE !(! s__s3__tmp__reuse_message) [L532] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 4096) [L109] COND FALSE !(s__state == 20480) [L112] COND FALSE !(s__state == 4099) [L115] COND FALSE !(s__state == 4368) [L118] COND FALSE !(s__state == 4369) [L121] COND FALSE !(s__state == 4384) [L124] COND FALSE !(s__state == 4385) [L127] COND TRUE s__state == 4400 [L279] COND FALSE !(s__s3__tmp__new_cipher__algorithms - 256) [L282] ret = __VERIFIER_nondet_int() [L283] COND TRUE blastFlag == 2 [L284] blastFlag = 3 [L286] COND FALSE !(ret <= 0) [L290] s__state = 4416 [L291] s__init_num = 0 [L515] COND FALSE !(! s__s3__tmp__reuse_message) [L532] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 4096) [L109] COND FALSE !(s__state == 20480) [L112] COND FALSE !(s__state == 4099) [L115] COND FALSE !(s__state == 4368) [L118] COND FALSE !(s__state == 4369) [L121] COND FALSE !(s__state == 4384) [L124] COND FALSE !(s__state == 4385) [L127] COND FALSE !(s__state == 4400) [L130] COND FALSE !(s__state == 4401) [L133] COND TRUE s__state == 4416 [L295] ret = __VERIFIER_nondet_int() [L296] COND TRUE blastFlag == 3 [L297] blastFlag = 4 [L299] COND FALSE !(ret <= 0) [L302] s__state = 4432 [L303] s__init_num = 0 [L304] COND FALSE !(! tmp___6) [L515] COND FALSE !(! s__s3__tmp__reuse_message) [L532] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 4096) [L109] COND FALSE !(s__state == 20480) [L112] COND FALSE !(s__state == 4099) [L115] COND FALSE !(s__state == 4368) [L118] COND FALSE !(s__state == 4369) [L121] COND FALSE !(s__state == 4384) [L124] COND FALSE !(s__state == 4385) [L127] COND FALSE !(s__state == 4400) [L130] COND FALSE !(s__state == 4401) [L133] COND FALSE !(s__state == 4416) [L136] COND FALSE !(s__state == 4417) [L139] COND TRUE s__state == 4432 [L311] ret = __VERIFIER_nondet_int() [L312] COND TRUE blastFlag == 4 [L543] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1216 SDtfs, 252 SDslu, 644 SDs, 0 SdLazy, 617 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s 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=441occurred 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, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 46848 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...