/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:47:46,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:47:46,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:47:46,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:47:46,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:47:46,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:47:46,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:47:46,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:47:46,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:47:46,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:47:46,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:47:46,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:47:46,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:47:46,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:47:46,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:47:46,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:47:46,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:47:46,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:47:46,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:47:46,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:47:46,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:47:46,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:47:46,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:47:46,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:47:46,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:47:46,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:47:46,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:47:46,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:47:46,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:47:46,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:47:46,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:47:46,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:47:46,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:47:46,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:47:46,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:47:46,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:47:46,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:47:46,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:47:46,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:47:46,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:47:46,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:47:46,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:47:46,851 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:47:46,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:47:46,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:47:46,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:47:46,852 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:47:46,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:47:46,853 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:47:46,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:47:46,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:47:46,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:47:46,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:47:46,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:47:46,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:47:46,854 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:47:46,855 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:47:46,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:47:46,855 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:47:46,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:47:46,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:47:46,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:47:46,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:47:46,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:47:46,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:47:46,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:47:46,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:47:46,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:47:46,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:47:46,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:47:46,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:47:46,858 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:47:47,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:47:47,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:47:47,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:47:47,139 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:47:47,140 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:47:47,141 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-2.c [2019-11-23 22:47:47,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13dff5ccf/51e528fc82e044b3b37f2a1c4805a0ac/FLAGda038dd74 [2019-11-23 22:47:47,703 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:47:47,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_4.cil-2.c [2019-11-23 22:47:47,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13dff5ccf/51e528fc82e044b3b37f2a1c4805a0ac/FLAGda038dd74 [2019-11-23 22:47:48,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13dff5ccf/51e528fc82e044b3b37f2a1c4805a0ac [2019-11-23 22:47:48,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:47:48,069 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:47:48,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:48,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:47:48,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:47:48,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:48" (1/1) ... [2019-11-23 22:47:48,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a92ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48, skipping insertion in model container [2019-11-23 22:47:48,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:48" (1/1) ... [2019-11-23 22:47:48,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:47:48,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:47:48,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:48,407 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:47:48,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:48,583 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:47:48,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48 WrapperNode [2019-11-23 22:47:48,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:48,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:47:48,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:47:48,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:47:48,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48" (1/1) ... [2019-11-23 22:47:48,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48" (1/1) ... [2019-11-23 22:47:48,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:47:48,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:47:48,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:47:48,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:47:48,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48" (1/1) ... [2019-11-23 22:47:48,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48" (1/1) ... [2019-11-23 22:47:48,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48" (1/1) ... [2019-11-23 22:47:48,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48" (1/1) ... [2019-11-23 22:47:48,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48" (1/1) ... [2019-11-23 22:47:48,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48" (1/1) ... [2019-11-23 22:47:48,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48" (1/1) ... [2019-11-23 22:47:48,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:47:48,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:47:48,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:47:48,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:47:48,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48" (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-23 22:47:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:47:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:47:48,893 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:47:49,527 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-23 22:47:49,528 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-23 22:47:49,529 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:47:49,530 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:47:49,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:49 BoogieIcfgContainer [2019-11-23 22:47:49,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:47:49,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:47:49,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:47:49,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:47:49,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:47:48" (1/3) ... [2019-11-23 22:47:49,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4996b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:49, skipping insertion in model container [2019-11-23 22:47:49,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:48" (2/3) ... [2019-11-23 22:47:49,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4996b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:49, skipping insertion in model container [2019-11-23 22:47:49,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:49" (3/3) ... [2019-11-23 22:47:49,540 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-2.c [2019-11-23 22:47:49,551 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:47:49,559 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:47:49,571 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:47:49,601 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:47:49,601 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:47:49,601 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:47:49,602 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:47:49,602 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:47:49,602 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:47:49,602 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:47:49,602 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:47:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-23 22:47:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:47:49,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:49,633 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-23 22:47:49,634 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:49,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:49,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-23 22:47:49,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:49,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801270401] [2019-11-23 22:47:49,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:49,863 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-23 22:47:49,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801270401] [2019-11-23 22:47:49,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:49,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:49,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445215336] [2019-11-23 22:47:49,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:49,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:49,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:49,891 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-23 22:47:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:50,141 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-23 22:47:50,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:50,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:47:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:50,157 INFO L225 Difference]: With dead ends: 251 [2019-11-23 22:47:50,157 INFO L226 Difference]: Without dead ends: 114 [2019-11-23 22:47:50,161 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-23 22:47:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-23 22:47:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-23 22:47:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-23 22:47:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-23 22:47:50,208 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-23 22:47:50,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:50,209 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-23 22:47:50,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:50,209 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-23 22:47:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 22:47:50,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:50,211 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-23 22:47:50,212 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:50,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:50,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-23 22:47:50,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:50,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366473123] [2019-11-23 22:47:50,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:50,305 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-23 22:47:50,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366473123] [2019-11-23 22:47:50,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:50,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:50,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280356403] [2019-11-23 22:47:50,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:50,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:50,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:50,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:50,309 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-23 22:47:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:50,479 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-11-23 22:47:50,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:50,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-23 22:47:50,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:50,482 INFO L225 Difference]: With dead ends: 237 [2019-11-23 22:47:50,482 INFO L226 Difference]: Without dead ends: 132 [2019-11-23 22:47:50,484 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-23 22:47:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-23 22:47:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-11-23 22:47:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-23 22:47:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-23 22:47:50,497 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-23 22:47:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:50,497 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-23 22:47:50,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-23 22:47:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:47:50,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:50,500 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-23 22:47:50,500 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:50,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:50,501 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-11-23 22:47:50,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:50,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934800399] [2019-11-23 22:47:50,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:50,596 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-23 22:47:50,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934800399] [2019-11-23 22:47:50,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:50,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:50,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281494888] [2019-11-23 22:47:50,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:50,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:50,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:50,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:50,601 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-23 22:47:50,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:50,771 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-11-23 22:47:50,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:50,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:47:50,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:50,774 INFO L225 Difference]: With dead ends: 270 [2019-11-23 22:47:50,774 INFO L226 Difference]: Without dead ends: 150 [2019-11-23 22:47:50,775 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-23 22:47:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-23 22:47:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-11-23 22:47:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-23 22:47:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-23 22:47:50,790 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-23 22:47:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:50,795 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-23 22:47:50,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-23 22:47:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:47:50,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:50,802 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-23 22:47:50,802 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:50,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:50,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1168366188, now seen corresponding path program 1 times [2019-11-23 22:47:50,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:50,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416472926] [2019-11-23 22:47:50,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:50,959 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-23 22:47:50,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416472926] [2019-11-23 22:47:50,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:50,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:50,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616508400] [2019-11-23 22:47:50,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:50,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:50,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:50,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:50,963 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-23 22:47:51,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:51,203 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-23 22:47:51,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:51,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:47:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:51,207 INFO L225 Difference]: With dead ends: 334 [2019-11-23 22:47:51,207 INFO L226 Difference]: Without dead ends: 196 [2019-11-23 22:47:51,210 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-23 22:47:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-23 22:47:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-23 22:47:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-23 22:47:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-23 22:47:51,229 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-23 22:47:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:51,230 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-23 22:47:51,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-23 22:47:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:47:51,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:51,232 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-23 22:47:51,233 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:51,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:51,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1321162774, now seen corresponding path program 1 times [2019-11-23 22:47:51,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:51,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101667053] [2019-11-23 22:47:51,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:51,308 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-23 22:47:51,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101667053] [2019-11-23 22:47:51,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:51,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:51,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044451149] [2019-11-23 22:47:51,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:51,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:51,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:51,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:51,311 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-23 22:47:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:51,454 INFO L93 Difference]: Finished difference Result 390 states and 556 transitions. [2019-11-23 22:47:51,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:51,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:47:51,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:51,457 INFO L225 Difference]: With dead ends: 390 [2019-11-23 22:47:51,457 INFO L226 Difference]: Without dead ends: 212 [2019-11-23 22:47:51,458 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-23 22:47:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-23 22:47:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2019-11-23 22:47:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-23 22:47:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-23 22:47:51,468 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-23 22:47:51,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:51,469 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-23 22:47:51,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-23 22:47:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:47:51,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:51,471 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-23 22:47:51,471 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:51,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:51,471 INFO L82 PathProgramCache]: Analyzing trace with hash -136835443, now seen corresponding path program 1 times [2019-11-23 22:47:51,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:51,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934275822] [2019-11-23 22:47:51,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:51,520 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-23 22:47:51,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934275822] [2019-11-23 22:47:51,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:51,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:51,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874552710] [2019-11-23 22:47:51,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:51,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:51,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:51,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:51,523 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-23 22:47:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:51,668 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-23 22:47:51,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:51,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:47:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:51,673 INFO L225 Difference]: With dead ends: 427 [2019-11-23 22:47:51,673 INFO L226 Difference]: Without dead ends: 230 [2019-11-23 22:47:51,674 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-23 22:47:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-23 22:47:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-23 22:47:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-23 22:47:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-23 22:47:51,684 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-23 22:47:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:51,686 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-23 22:47:51,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-23 22:47:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 22:47:51,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:51,694 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-23 22:47:51,694 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:51,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1324345659, now seen corresponding path program 1 times [2019-11-23 22:47:51,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:51,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133067261] [2019-11-23 22:47:51,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:51,798 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-23 22:47:51,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133067261] [2019-11-23 22:47:51,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:51,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:51,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671552991] [2019-11-23 22:47:51,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:51,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:51,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:51,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:51,803 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-23 22:47:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:51,847 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-23 22:47:51,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:51,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-23 22:47:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:51,850 INFO L225 Difference]: With dead ends: 661 [2019-11-23 22:47:51,851 INFO L226 Difference]: Without dead ends: 443 [2019-11-23 22:47:51,851 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-23 22:47:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-23 22:47:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-23 22:47:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-23 22:47:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-23 22:47:51,866 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-23 22:47:51,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:51,866 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-23 22:47:51,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-23 22:47:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 22:47:51,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:51,868 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-23 22:47:51,869 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash -606282988, now seen corresponding path program 1 times [2019-11-23 22:47:51,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:51,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160763283] [2019-11-23 22:47:51,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:47:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:47:51,982 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 22:47:51,982 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 22:47:52,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:47:52 BoogieIcfgContainer [2019-11-23 22:47:52,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:47:52,080 INFO L168 Benchmark]: Toolchain (without parser) took 4010.26 ms. Allocated memory was 139.5 MB in the beginning and 244.8 MB in the end (delta: 105.4 MB). Free memory was 103.2 MB in the beginning and 210.9 MB in the end (delta: -107.6 MB). Peak memory consumption was 117.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:52,081 INFO L168 Benchmark]: CDTParser took 1.46 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:47:52,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.20 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 103.0 MB in the beginning and 178.7 MB in the end (delta: -75.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:52,083 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.27 ms. Allocated memory is still 203.4 MB. Free memory was 178.7 MB in the beginning and 176.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:52,083 INFO L168 Benchmark]: Boogie Preprocessor took 62.68 ms. Allocated memory is still 203.4 MB. Free memory was 176.0 MB in the beginning and 173.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:52,084 INFO L168 Benchmark]: RCFGBuilder took 822.42 ms. Allocated memory is still 203.4 MB. Free memory was 173.7 MB in the beginning and 124.6 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:52,085 INFO L168 Benchmark]: TraceAbstraction took 2544.51 ms. Allocated memory was 203.4 MB in the beginning and 244.8 MB in the end (delta: 41.4 MB). Free memory was 123.9 MB in the beginning and 210.9 MB in the end (delta: -87.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:52,089 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 514.20 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 103.0 MB in the beginning and 178.7 MB in the end (delta: -75.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.27 ms. Allocated memory is still 203.4 MB. Free memory was 178.7 MB in the beginning and 176.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.68 ms. Allocated memory is still 203.4 MB. Free memory was 176.0 MB in the beginning and 173.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.42 ms. Allocated memory is still 203.4 MB. Free memory was 173.7 MB in the beginning and 124.6 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2544.51 ms. Allocated memory was 203.4 MB in the beginning and 244.8 MB in the end (delta: 41.4 MB). Free memory was 123.9 MB in the beginning and 210.9 MB in the end (delta: -87.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 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.2s, 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.3s 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...