/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_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:47:16,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:47:16,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:47:16,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:47:16,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:47:16,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:47:16,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:47:16,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:47:16,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:47:16,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:47:16,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:47:16,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:47:16,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:47:16,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:47:16,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:47:16,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:47:16,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:47:16,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:47:16,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:47:16,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:47:16,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:47:16,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:47:16,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:47:16,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:47:16,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:47:16,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:47:16,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:47:16,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:47:16,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:47:16,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:47:16,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:47:16,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:47:16,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:47:16,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:47:16,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:47:16,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:47:16,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:47:16,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:47:16,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:47:16,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:47:16,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:47:16,855 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:16,876 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:47:16,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:47:16,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:47:16,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:47:16,881 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:47:16,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:47:16,881 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:47:16,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:47:16,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:47:16,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:47:16,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:47:16,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:47:16,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:47:16,884 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:47:16,884 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:47:16,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:47:16,885 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:47:16,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:47:16,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:47:16,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:47:16,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:47:16,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:47:16,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:47:16,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:47:16,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:47:16,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:47:16,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:47:16,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:47:16,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:47:16,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:47:17,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:47:17,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:47:17,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:47:17,170 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:47:17,170 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:47:17,171 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-2.c [2019-11-23 22:47:17,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f309ea73d/674ecab5f70f443da3d79aa10164e7ef/FLAG399082050 [2019-11-23 22:47:17,787 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:47:17,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-2.c [2019-11-23 22:47:17,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f309ea73d/674ecab5f70f443da3d79aa10164e7ef/FLAG399082050 [2019-11-23 22:47:18,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f309ea73d/674ecab5f70f443da3d79aa10164e7ef [2019-11-23 22:47:18,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:47:18,098 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:47:18,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:18,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:47:18,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:47:18,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:18" (1/1) ... [2019-11-23 22:47:18,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449401a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:18, skipping insertion in model container [2019-11-23 22:47:18,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:18" (1/1) ... [2019-11-23 22:47:18,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:47:18,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:47:18,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:18,443 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:47:18,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:47:18,631 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:47:18,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:18 WrapperNode [2019-11-23 22:47:18,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:47:18,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:47:18,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:47:18,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:47:18,641 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:18" (1/1) ... [2019-11-23 22:47:18,650 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:18" (1/1) ... [2019-11-23 22:47:18,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:47:18,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:47:18,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:47:18,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:47:18,704 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:18" (1/1) ... [2019-11-23 22:47:18,705 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:18" (1/1) ... [2019-11-23 22:47:18,708 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:18" (1/1) ... [2019-11-23 22:47:18,708 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:18" (1/1) ... [2019-11-23 22:47:18,716 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:18" (1/1) ... [2019-11-23 22:47:18,725 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:18" (1/1) ... [2019-11-23 22:47:18,728 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:18" (1/1) ... [2019-11-23 22:47:18,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:47:18,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:47:18,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:47:18,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:47:18,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:18" (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:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:47:18,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:47:18,941 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:47:19,577 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-23 22:47:19,578 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-23 22:47:19,579 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:47:19,580 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:47:19,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:19 BoogieIcfgContainer [2019-11-23 22:47:19,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:47:19,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:47:19,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:47:19,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:47:19,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:47:18" (1/3) ... [2019-11-23 22:47:19,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351bc403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:19, skipping insertion in model container [2019-11-23 22:47:19,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:18" (2/3) ... [2019-11-23 22:47:19,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351bc403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:19, skipping insertion in model container [2019-11-23 22:47:19,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:19" (3/3) ... [2019-11-23 22:47:19,589 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-2.c [2019-11-23 22:47:19,596 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:47:19,602 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:47:19,613 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:47:19,647 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:47:19,647 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:47:19,648 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:47:19,648 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:47:19,648 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:47:19,649 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:47:19,649 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:47:19,649 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:47:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-23 22:47:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:47:19,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:19,677 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:19,677 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:19,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:19,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2019-11-23 22:47:19,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:19,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729244131] [2019-11-23 22:47:19,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:19,893 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:19,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729244131] [2019-11-23 22:47:19,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:19,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:47:19,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918252217] [2019-11-23 22:47:19,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:19,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:19,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:19,918 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-11-23 22:47:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:20,176 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2019-11-23 22:47:20,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:20,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:47:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:20,188 INFO L225 Difference]: With dead ends: 249 [2019-11-23 22:47:20,189 INFO L226 Difference]: Without dead ends: 113 [2019-11-23 22:47:20,192 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:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-23 22:47:20,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-23 22:47:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-23 22:47:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-11-23 22:47:20,240 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2019-11-23 22:47:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:20,240 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-11-23 22:47:20,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-11-23 22:47:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 22:47:20,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:20,242 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:20,243 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:20,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:20,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2019-11-23 22:47:20,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:20,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765675016] [2019-11-23 22:47:20,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:20,322 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:20,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765675016] [2019-11-23 22:47:20,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:20,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:20,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737884334] [2019-11-23 22:47:20,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:20,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:20,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:20,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:20,326 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-11-23 22:47:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:20,515 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2019-11-23 22:47:20,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:20,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-23 22:47:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:20,519 INFO L225 Difference]: With dead ends: 235 [2019-11-23 22:47:20,519 INFO L226 Difference]: Without dead ends: 131 [2019-11-23 22:47:20,522 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:20,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-23 22:47:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-11-23 22:47:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-23 22:47:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-11-23 22:47:20,549 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2019-11-23 22:47:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:20,550 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-11-23 22:47:20,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-11-23 22:47:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:47:20,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:20,552 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:20,552 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:20,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:20,553 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2019-11-23 22:47:20,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:20,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615021056] [2019-11-23 22:47:20,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:20,678 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:20,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615021056] [2019-11-23 22:47:20,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:20,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:20,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034446724] [2019-11-23 22:47:20,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:20,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:20,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:20,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:20,682 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-11-23 22:47:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:20,830 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2019-11-23 22:47:20,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:20,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:47:20,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:20,833 INFO L225 Difference]: With dead ends: 268 [2019-11-23 22:47:20,833 INFO L226 Difference]: Without dead ends: 149 [2019-11-23 22:47:20,837 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:20,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-23 22:47:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-11-23 22:47:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 22:47:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-11-23 22:47:20,858 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2019-11-23 22:47:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:20,859 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-11-23 22:47:20,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-11-23 22:47:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:47:20,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:20,864 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:20,865 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:20,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:20,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2019-11-23 22:47:20,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:20,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302976998] [2019-11-23 22:47:20,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:20,994 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:20,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302976998] [2019-11-23 22:47:20,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:20,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:20,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965718643] [2019-11-23 22:47:20,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:20,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:20,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:20,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:20,997 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-11-23 22:47:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:21,196 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2019-11-23 22:47:21,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:21,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:47:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:21,199 INFO L225 Difference]: With dead ends: 332 [2019-11-23 22:47:21,200 INFO L226 Difference]: Without dead ends: 195 [2019-11-23 22:47:21,201 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:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-23 22:47:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-11-23 22:47:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-23 22:47:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2019-11-23 22:47:21,213 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2019-11-23 22:47:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:21,213 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2019-11-23 22:47:21,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2019-11-23 22:47:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:47:21,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:21,216 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:21,216 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:21,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2019-11-23 22:47:21,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:21,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558448225] [2019-11-23 22:47:21,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:21,293 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:21,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558448225] [2019-11-23 22:47:21,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:21,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:21,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906443939] [2019-11-23 22:47:21,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:21,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:21,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:21,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:21,296 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2019-11-23 22:47:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:21,410 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2019-11-23 22:47:21,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:21,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:47:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:21,412 INFO L225 Difference]: With dead ends: 386 [2019-11-23 22:47:21,412 INFO L226 Difference]: Without dead ends: 209 [2019-11-23 22:47:21,413 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:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-23 22:47:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2019-11-23 22:47:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-23 22:47:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2019-11-23 22:47:21,425 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2019-11-23 22:47:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:21,426 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2019-11-23 22:47:21,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2019-11-23 22:47:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:47:21,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:21,429 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-23 22:47:21,429 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:21,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2019-11-23 22:47:21,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:21,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919950956] [2019-11-23 22:47:21,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:21,518 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:21,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919950956] [2019-11-23 22:47:21,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:21,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:21,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370666092] [2019-11-23 22:47:21,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:21,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:21,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:21,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:21,522 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2019-11-23 22:47:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:21,661 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2019-11-23 22:47:21,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:21,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 22:47:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:21,664 INFO L225 Difference]: With dead ends: 425 [2019-11-23 22:47:21,664 INFO L226 Difference]: Without dead ends: 229 [2019-11-23 22:47:21,666 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:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-23 22:47:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-11-23 22:47:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-23 22:47:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2019-11-23 22:47:21,677 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2019-11-23 22:47:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:21,679 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2019-11-23 22:47:21,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2019-11-23 22:47:21,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 22:47:21,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:21,684 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-23 22:47:21,685 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:21,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2019-11-23 22:47:21,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:21,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508406142] [2019-11-23 22:47:21,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:21,791 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:21,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508406142] [2019-11-23 22:47:21,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:21,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:21,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535571372] [2019-11-23 22:47:21,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:21,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:21,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:21,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:21,799 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2019-11-23 22:47:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:21,837 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2019-11-23 22:47:21,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:21,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-23 22:47:21,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:21,842 INFO L225 Difference]: With dead ends: 658 [2019-11-23 22:47:21,843 INFO L226 Difference]: Without dead ends: 441 [2019-11-23 22:47:21,844 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:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-23 22:47:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-11-23 22:47:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-23 22:47:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2019-11-23 22:47:21,859 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2019-11-23 22:47:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:21,859 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2019-11-23 22:47:21,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2019-11-23 22:47:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:47:21,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:21,861 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-23 22:47:21,862 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:21,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:21,862 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2019-11-23 22:47:21,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:21,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494321186] [2019-11-23 22:47:21,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:47:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:47:21,961 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 22:47:21,961 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 22:47:22,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:47:22 BoogieIcfgContainer [2019-11-23 22:47:22,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:47:22,036 INFO L168 Benchmark]: Toolchain (without parser) took 3936.81 ms. Allocated memory was 139.5 MB in the beginning and 243.8 MB in the end (delta: 104.3 MB). Free memory was 102.7 MB in the beginning and 93.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 113.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:22,037 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 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:22,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.48 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.5 MB in the beginning and 179.9 MB in the end (delta: -77.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:22,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.99 ms. Allocated memory is still 204.5 MB. Free memory was 179.9 MB in the beginning and 177.3 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:22,049 INFO L168 Benchmark]: Boogie Preprocessor took 39.49 ms. Allocated memory is still 204.5 MB. Free memory was 177.3 MB in the beginning and 175.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:22,049 INFO L168 Benchmark]: RCFGBuilder took 847.40 ms. Allocated memory is still 204.5 MB. Free memory was 175.4 MB in the beginning and 127.4 MB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:22,050 INFO L168 Benchmark]: TraceAbstraction took 2450.30 ms. Allocated memory was 204.5 MB in the beginning and 243.8 MB in the end (delta: 39.3 MB). Free memory was 126.7 MB in the beginning and 93.4 MB in the end (delta: 33.3 MB). Peak memory consumption was 72.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:22,055 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.54 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 533.48 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.5 MB in the beginning and 179.9 MB in the end (delta: -77.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.99 ms. Allocated memory is still 204.5 MB. Free memory was 179.9 MB in the beginning and 177.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.49 ms. Allocated memory is still 204.5 MB. Free memory was 177.3 MB in the beginning and 175.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.40 ms. Allocated memory is still 204.5 MB. Free memory was 175.4 MB in the beginning and 127.4 MB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2450.30 ms. Allocated memory was 204.5 MB in the beginning and 243.8 MB in the end (delta: 39.3 MB). Free memory was 126.7 MB in the beginning and 93.4 MB in the end (delta: 33.3 MB). Peak memory consumption was 72.7 MB. Max. memory is 7.1 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.3s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1216 SDtfs, 252 SDslu, 644 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=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.2s SatisfiabilityAnalysisTime, 0.4s 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...