/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:46:53,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:46:53,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:46:53,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:46:53,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:46:53,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:46:53,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:46:53,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:46:53,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:46:53,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:46:53,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:46:53,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:46:53,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:46:53,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:46:53,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:46:53,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:46:53,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:46:53,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:46:53,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:46:53,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:46:53,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:46:53,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:46:53,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:46:53,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:46:53,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:46:53,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:46:53,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:46:53,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:46:53,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:46:53,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:46:53,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:46:53,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:46:53,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:46:53,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:46:53,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:46:53,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:46:53,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:46:53,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:46:53,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:46:53,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:46:53,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:46:53,879 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:46:53,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:46:53,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:46:53,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:46:53,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:46:53,902 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:46:53,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:46:53,903 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:46:53,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:46:53,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:46:53,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:46:53,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:46:53,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:46:53,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:46:53,906 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:46:53,906 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:46:53,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:46:53,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:46:53,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:46:53,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:46:53,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:46:53,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:46:53,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:46:53,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:46:53,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:46:53,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:46:53,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:46:53,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:46:53,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:46:53,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:46:53,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:46:54,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:46:54,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:46:54,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:46:54,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:46:54,214 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:46:54,215 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-1.c [2019-11-23 22:46:54,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991275ba8/c6477aef82054df89cf10ebdd2baca11/FLAG3154cd5e1 [2019-11-23 22:46:54,829 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:46:54,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-11-23 22:46:54,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991275ba8/c6477aef82054df89cf10ebdd2baca11/FLAG3154cd5e1 [2019-11-23 22:46:55,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991275ba8/c6477aef82054df89cf10ebdd2baca11 [2019-11-23 22:46:55,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:46:55,155 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:46:55,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:46:55,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:46:55,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:46:55,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:46:55" (1/1) ... [2019-11-23 22:46:55,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9d0bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:55, skipping insertion in model container [2019-11-23 22:46:55,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:46:55" (1/1) ... [2019-11-23 22:46:55,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:46:55,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:46:55,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:46:55,558 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:46:55,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:46:55,745 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:46:55,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:55 WrapperNode [2019-11-23 22:46:55,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:46:55,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:46:55,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:46:55,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:46:55,754 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:46:55" (1/1) ... [2019-11-23 22:46:55,763 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:46:55" (1/1) ... [2019-11-23 22:46:55,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:46:55,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:46:55,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:46:55,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:46:55,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:55" (1/1) ... [2019-11-23 22:46:55,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:55" (1/1) ... [2019-11-23 22:46:55,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:55" (1/1) ... [2019-11-23 22:46:55,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:55" (1/1) ... [2019-11-23 22:46:55,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:55" (1/1) ... [2019-11-23 22:46:55,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:55" (1/1) ... [2019-11-23 22:46:55,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:55" (1/1) ... [2019-11-23 22:46:55,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:46:55,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:46:55,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:46:55,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:46:55,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:55" (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:46:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:46:55,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:46:56,080 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:46:56,703 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-23 22:46:56,703 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-23 22:46:56,705 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:46:56,706 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:46:56,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:46:56 BoogieIcfgContainer [2019-11-23 22:46:56,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:46:56,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:46:56,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:46:56,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:46:56,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:46:55" (1/3) ... [2019-11-23 22:46:56,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adc8c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:46:56, skipping insertion in model container [2019-11-23 22:46:56,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:55" (2/3) ... [2019-11-23 22:46:56,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adc8c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:46:56, skipping insertion in model container [2019-11-23 22:46:56,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:46:56" (3/3) ... [2019-11-23 22:46:56,722 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-11-23 22:46:56,733 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:46:56,743 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:46:56,756 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:46:56,801 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:46:56,801 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:46:56,801 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:46:56,802 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:46:56,802 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:46:56,802 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:46:56,802 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:46:56,802 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:46:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-23 22:46:56,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:46:56,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:56,827 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:46:56,827 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:56,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2019-11-23 22:46:56,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:56,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986337384] [2019-11-23 22:46:56,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:57,056 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:46:57,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986337384] [2019-11-23 22:46:57,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:57,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:46:57,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016512223] [2019-11-23 22:46:57,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:57,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:57,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:57,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:57,089 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-11-23 22:46:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:57,354 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2019-11-23 22:46:57,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:57,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:46:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:57,373 INFO L225 Difference]: With dead ends: 249 [2019-11-23 22:46:57,373 INFO L226 Difference]: Without dead ends: 113 [2019-11-23 22:46:57,380 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:46:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-23 22:46:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-23 22:46:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-23 22:46:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-11-23 22:46:57,430 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2019-11-23 22:46:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:57,431 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-11-23 22:46:57,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-11-23 22:46:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 22:46:57,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:57,433 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:46:57,433 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:57,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:57,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2019-11-23 22:46:57,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:57,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094970532] [2019-11-23 22:46:57,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:57,534 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:46:57,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094970532] [2019-11-23 22:46:57,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:57,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:57,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102458199] [2019-11-23 22:46:57,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:57,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:57,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:57,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:57,538 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-11-23 22:46:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:57,718 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2019-11-23 22:46:57,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:57,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-23 22:46:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:57,721 INFO L225 Difference]: With dead ends: 235 [2019-11-23 22:46:57,721 INFO L226 Difference]: Without dead ends: 131 [2019-11-23 22:46:57,722 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:46:57,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-23 22:46:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-11-23 22:46:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-23 22:46:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-11-23 22:46:57,736 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2019-11-23 22:46:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:57,736 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-11-23 22:46:57,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-11-23 22:46:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:46:57,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:57,739 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:46:57,739 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:57,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:57,739 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2019-11-23 22:46:57,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:57,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723606387] [2019-11-23 22:46:57,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:57,831 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:46:57,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723606387] [2019-11-23 22:46:57,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:57,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:57,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301801238] [2019-11-23 22:46:57,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:57,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:57,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:57,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:57,836 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-11-23 22:46:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:57,985 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2019-11-23 22:46:57,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:57,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:46:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:57,989 INFO L225 Difference]: With dead ends: 268 [2019-11-23 22:46:57,989 INFO L226 Difference]: Without dead ends: 149 [2019-11-23 22:46:57,990 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:46:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-23 22:46:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-11-23 22:46:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 22:46:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-11-23 22:46:58,008 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2019-11-23 22:46:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:58,009 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-11-23 22:46:58,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-11-23 22:46:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:46:58,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:58,012 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:46:58,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2019-11-23 22:46:58,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:58,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022463057] [2019-11-23 22:46:58,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:58,082 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:46:58,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022463057] [2019-11-23 22:46:58,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:58,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:58,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056472287] [2019-11-23 22:46:58,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:58,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:58,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:58,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:58,085 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-11-23 22:46:58,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:58,292 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2019-11-23 22:46:58,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:58,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:46:58,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:58,295 INFO L225 Difference]: With dead ends: 332 [2019-11-23 22:46:58,295 INFO L226 Difference]: Without dead ends: 195 [2019-11-23 22:46:58,296 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:46:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-23 22:46:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-11-23 22:46:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-23 22:46:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2019-11-23 22:46:58,310 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2019-11-23 22:46:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:58,311 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2019-11-23 22:46:58,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:58,311 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2019-11-23 22:46:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:46:58,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:58,314 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:46:58,314 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:58,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2019-11-23 22:46:58,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:58,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510385307] [2019-11-23 22:46:58,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:58,425 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:46:58,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510385307] [2019-11-23 22:46:58,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:58,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:58,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916525234] [2019-11-23 22:46:58,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:58,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:58,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:58,429 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2019-11-23 22:46:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:58,554 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2019-11-23 22:46:58,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:58,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:46:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:58,556 INFO L225 Difference]: With dead ends: 386 [2019-11-23 22:46:58,557 INFO L226 Difference]: Without dead ends: 209 [2019-11-23 22:46:58,558 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:46:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-23 22:46:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2019-11-23 22:46:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-23 22:46:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2019-11-23 22:46:58,583 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2019-11-23 22:46:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:58,584 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2019-11-23 22:46:58,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2019-11-23 22:46:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:46:58,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:58,591 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:46:58,591 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2019-11-23 22:46:58,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:58,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472101819] [2019-11-23 22:46:58,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:58,676 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:46:58,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472101819] [2019-11-23 22:46:58,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:58,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:58,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149280114] [2019-11-23 22:46:58,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:58,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:58,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:58,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:58,681 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2019-11-23 22:46:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:58,822 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2019-11-23 22:46:58,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:58,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 22:46:58,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:58,825 INFO L225 Difference]: With dead ends: 425 [2019-11-23 22:46:58,825 INFO L226 Difference]: Without dead ends: 229 [2019-11-23 22:46:58,826 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:46:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-23 22:46:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-11-23 22:46:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-23 22:46:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2019-11-23 22:46:58,834 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2019-11-23 22:46:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:58,834 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2019-11-23 22:46:58,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2019-11-23 22:46:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 22:46:58,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:58,837 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:46:58,837 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2019-11-23 22:46:58,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:58,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93021451] [2019-11-23 22:46:58,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:58,920 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:46:58,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93021451] [2019-11-23 22:46:58,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:58,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:58,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916857438] [2019-11-23 22:46:58,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:58,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:58,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:58,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:58,931 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2019-11-23 22:46:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:58,972 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2019-11-23 22:46:58,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:58,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-23 22:46:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:58,977 INFO L225 Difference]: With dead ends: 658 [2019-11-23 22:46:58,977 INFO L226 Difference]: Without dead ends: 441 [2019-11-23 22:46:58,978 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:46:58,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-23 22:46:58,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-11-23 22:46:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-23 22:46:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2019-11-23 22:46:58,996 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2019-11-23 22:46:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:58,996 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2019-11-23 22:46:58,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2019-11-23 22:46:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:46:58,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:58,999 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:46:58,999 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:59,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:59,000 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2019-11-23 22:46:59,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:59,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133067261] [2019-11-23 22:46:59,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 22:46:59,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133067261] [2019-11-23 22:46:59,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:59,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:59,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534088123] [2019-11-23 22:46:59,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:59,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:59,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:59,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:59,110 INFO L87 Difference]: Start difference. First operand 441 states and 607 transitions. Second operand 3 states. [2019-11-23 22:46:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:59,153 INFO L93 Difference]: Finished difference Result 658 states and 906 transitions. [2019-11-23 22:46:59,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:59,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 22:46:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:59,158 INFO L225 Difference]: With dead ends: 658 [2019-11-23 22:46:59,158 INFO L226 Difference]: Without dead ends: 656 [2019-11-23 22:46:59,159 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:46:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-11-23 22:46:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-11-23 22:46:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-11-23 22:46:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2019-11-23 22:46:59,177 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 105 [2019-11-23 22:46:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:59,177 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2019-11-23 22:46:59,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2019-11-23 22:46:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-23 22:46:59,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:59,180 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2019-11-23 22:46:59,180 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1076298523, now seen corresponding path program 1 times [2019-11-23 22:46:59,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:59,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353112756] [2019-11-23 22:46:59,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 22:46:59,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353112756] [2019-11-23 22:46:59,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:59,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:59,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842911677] [2019-11-23 22:46:59,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:59,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:59,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:59,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:59,237 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand 3 states. [2019-11-23 22:46:59,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:59,369 INFO L93 Difference]: Finished difference Result 1383 states and 1932 transitions. [2019-11-23 22:46:59,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:59,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-23 22:46:59,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:59,374 INFO L225 Difference]: With dead ends: 1383 [2019-11-23 22:46:59,374 INFO L226 Difference]: Without dead ends: 736 [2019-11-23 22:46:59,375 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:46:59,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-11-23 22:46:59,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 725. [2019-11-23 22:46:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-11-23 22:46:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 988 transitions. [2019-11-23 22:46:59,395 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 988 transitions. Word has length 130 [2019-11-23 22:46:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:59,395 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 988 transitions. [2019-11-23 22:46:59,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 988 transitions. [2019-11-23 22:46:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 22:46:59,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:59,398 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1] [2019-11-23 22:46:59,399 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:59,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1485143904, now seen corresponding path program 1 times [2019-11-23 22:46:59,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:59,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413473360] [2019-11-23 22:46:59,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-23 22:46:59,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413473360] [2019-11-23 22:46:59,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:59,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:59,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681836621] [2019-11-23 22:46:59,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:59,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:59,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:59,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:59,458 INFO L87 Difference]: Start difference. First operand 725 states and 988 transitions. Second operand 3 states. [2019-11-23 22:46:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:59,641 INFO L93 Difference]: Finished difference Result 1594 states and 2230 transitions. [2019-11-23 22:46:59,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:59,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 22:46:59,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:59,647 INFO L225 Difference]: With dead ends: 1594 [2019-11-23 22:46:59,647 INFO L226 Difference]: Without dead ends: 875 [2019-11-23 22:46:59,649 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:46:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-11-23 22:46:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 842. [2019-11-23 22:46:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-11-23 22:46:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1165 transitions. [2019-11-23 22:46:59,675 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1165 transitions. Word has length 151 [2019-11-23 22:46:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:59,676 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1165 transitions. [2019-11-23 22:46:59,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1165 transitions. [2019-11-23 22:46:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-23 22:46:59,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:59,679 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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:46:59,680 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:59,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:59,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1560654223, now seen corresponding path program 1 times [2019-11-23 22:46:59,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:59,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031441751] [2019-11-23 22:46:59,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-23 22:46:59,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031441751] [2019-11-23 22:46:59,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:59,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:59,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359073929] [2019-11-23 22:46:59,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:59,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:59,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:59,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:59,758 INFO L87 Difference]: Start difference. First operand 842 states and 1165 transitions. Second operand 3 states. [2019-11-23 22:46:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:59,905 INFO L93 Difference]: Finished difference Result 1765 states and 2434 transitions. [2019-11-23 22:46:59,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:59,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-23 22:46:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:59,911 INFO L225 Difference]: With dead ends: 1765 [2019-11-23 22:46:59,911 INFO L226 Difference]: Without dead ends: 932 [2019-11-23 22:46:59,912 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:46:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-11-23 22:46:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 926. [2019-11-23 22:46:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 22:46:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1264 transitions. [2019-11-23 22:46:59,936 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1264 transitions. Word has length 187 [2019-11-23 22:46:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:59,937 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1264 transitions. [2019-11-23 22:46:59,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1264 transitions. [2019-11-23 22:46:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-23 22:46:59,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:59,941 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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:46:59,941 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:59,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:59,941 INFO L82 PathProgramCache]: Analyzing trace with hash -999954445, now seen corresponding path program 1 times [2019-11-23 22:46:59,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:59,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96056584] [2019-11-23 22:46:59,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-23 22:47:00,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96056584] [2019-11-23 22:47:00,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:00,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:00,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386532874] [2019-11-23 22:47:00,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:00,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:00,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:00,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:00,050 INFO L87 Difference]: Start difference. First operand 926 states and 1264 transitions. Second operand 3 states. [2019-11-23 22:47:00,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:00,184 INFO L93 Difference]: Finished difference Result 1945 states and 2659 transitions. [2019-11-23 22:47:00,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:00,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-23 22:47:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:00,189 INFO L225 Difference]: With dead ends: 1945 [2019-11-23 22:47:00,190 INFO L226 Difference]: Without dead ends: 1028 [2019-11-23 22:47:00,192 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:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-11-23 22:47:00,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2019-11-23 22:47:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-11-23 22:47:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1372 transitions. [2019-11-23 22:47:00,217 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1372 transitions. Word has length 187 [2019-11-23 22:47:00,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:00,218 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1372 transitions. [2019-11-23 22:47:00,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1372 transitions. [2019-11-23 22:47:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-23 22:47:00,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:00,222 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 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:00,223 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:00,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:00,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1300602353, now seen corresponding path program 1 times [2019-11-23 22:47:00,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:00,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027403715] [2019-11-23 22:47:00,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-23 22:47:00,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027403715] [2019-11-23 22:47:00,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:00,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:00,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702803814] [2019-11-23 22:47:00,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:00,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:00,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:00,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:00,323 INFO L87 Difference]: Start difference. First operand 1019 states and 1372 transitions. Second operand 3 states. [2019-11-23 22:47:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:00,372 INFO L93 Difference]: Finished difference Result 3036 states and 4087 transitions. [2019-11-23 22:47:00,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:00,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-23 22:47:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:00,384 INFO L225 Difference]: With dead ends: 3036 [2019-11-23 22:47:00,384 INFO L226 Difference]: Without dead ends: 2026 [2019-11-23 22:47:00,387 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:00,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-11-23 22:47:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2024. [2019-11-23 22:47:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-11-23 22:47:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2724 transitions. [2019-11-23 22:47:00,441 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2724 transitions. Word has length 217 [2019-11-23 22:47:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:00,442 INFO L462 AbstractCegarLoop]: Abstraction has 2024 states and 2724 transitions. [2019-11-23 22:47:00,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2724 transitions. [2019-11-23 22:47:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-23 22:47:00,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:00,450 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 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:00,450 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:00,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:00,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1861302131, now seen corresponding path program 1 times [2019-11-23 22:47:00,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:00,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278832860] [2019-11-23 22:47:00,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-23 22:47:00,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278832860] [2019-11-23 22:47:00,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:00,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:00,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752199698] [2019-11-23 22:47:00,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:00,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:00,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:00,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:00,585 INFO L87 Difference]: Start difference. First operand 2024 states and 2724 transitions. Second operand 3 states. [2019-11-23 22:47:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:00,755 INFO L93 Difference]: Finished difference Result 4264 states and 5762 transitions. [2019-11-23 22:47:00,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:00,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-23 22:47:00,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:00,769 INFO L225 Difference]: With dead ends: 4264 [2019-11-23 22:47:00,769 INFO L226 Difference]: Without dead ends: 2249 [2019-11-23 22:47:00,774 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:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-11-23 22:47:00,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2237. [2019-11-23 22:47:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2019-11-23 22:47:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 2967 transitions. [2019-11-23 22:47:00,843 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 2967 transitions. Word has length 217 [2019-11-23 22:47:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:00,844 INFO L462 AbstractCegarLoop]: Abstraction has 2237 states and 2967 transitions. [2019-11-23 22:47:00,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2967 transitions. [2019-11-23 22:47:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-23 22:47:00,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:00,853 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,853 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:00,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:00,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1392663397, now seen corresponding path program 1 times [2019-11-23 22:47:00,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:00,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368308447] [2019-11-23 22:47:00,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-23 22:47:00,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368308447] [2019-11-23 22:47:00,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:00,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:00,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986317081] [2019-11-23 22:47:00,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:00,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:00,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:00,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:00,992 INFO L87 Difference]: Start difference. First operand 2237 states and 2967 transitions. Second operand 3 states. [2019-11-23 22:47:01,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:01,185 INFO L93 Difference]: Finished difference Result 4576 states and 6077 transitions. [2019-11-23 22:47:01,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:01,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-11-23 22:47:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:01,198 INFO L225 Difference]: With dead ends: 4576 [2019-11-23 22:47:01,198 INFO L226 Difference]: Without dead ends: 2348 [2019-11-23 22:47:01,203 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:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-11-23 22:47:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2336. [2019-11-23 22:47:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2019-11-23 22:47:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3081 transitions. [2019-11-23 22:47:01,265 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3081 transitions. Word has length 241 [2019-11-23 22:47:01,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:01,266 INFO L462 AbstractCegarLoop]: Abstraction has 2336 states and 3081 transitions. [2019-11-23 22:47:01,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3081 transitions. [2019-11-23 22:47:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-23 22:47:01,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:01,273 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,273 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:01,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:01,273 INFO L82 PathProgramCache]: Analyzing trace with hash 844629829, now seen corresponding path program 1 times [2019-11-23 22:47:01,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:01,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040577838] [2019-11-23 22:47:01,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-23 22:47:01,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040577838] [2019-11-23 22:47:01,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:01,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:01,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592669920] [2019-11-23 22:47:01,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:01,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:01,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:01,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:01,358 INFO L87 Difference]: Start difference. First operand 2336 states and 3081 transitions. Second operand 3 states. [2019-11-23 22:47:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:01,565 INFO L93 Difference]: Finished difference Result 4963 states and 6677 transitions. [2019-11-23 22:47:01,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:01,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-23 22:47:01,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:01,583 INFO L225 Difference]: With dead ends: 4963 [2019-11-23 22:47:01,583 INFO L226 Difference]: Without dead ends: 2636 [2019-11-23 22:47:01,588 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:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-11-23 22:47:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2576. [2019-11-23 22:47:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-11-23 22:47:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3363 transitions. [2019-11-23 22:47:01,688 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3363 transitions. Word has length 252 [2019-11-23 22:47:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:01,689 INFO L462 AbstractCegarLoop]: Abstraction has 2576 states and 3363 transitions. [2019-11-23 22:47:01,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3363 transitions. [2019-11-23 22:47:01,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-23 22:47:01,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:01,703 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,704 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:01,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:01,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1701177459, now seen corresponding path program 1 times [2019-11-23 22:47:01,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:01,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346518786] [2019-11-23 22:47:01,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-23 22:47:01,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346518786] [2019-11-23 22:47:01,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786036765] [2019-11-23 22:47:01,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:02,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:02,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-23 22:47:02,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:47:02,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:47:02,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444972014] [2019-11-23 22:47:02,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:02,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:02,317 INFO L87 Difference]: Start difference. First operand 2576 states and 3363 transitions. Second operand 4 states. [2019-11-23 22:47:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:02,867 INFO L93 Difference]: Finished difference Result 8082 states and 10681 transitions. [2019-11-23 22:47:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:47:02,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-23 22:47:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:02,894 INFO L225 Difference]: With dead ends: 8082 [2019-11-23 22:47:02,895 INFO L226 Difference]: Without dead ends: 5509 [2019-11-23 22:47:02,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2019-11-23 22:47:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5117. [2019-11-23 22:47:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2019-11-23 22:47:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 6676 transitions. [2019-11-23 22:47:03,036 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 6676 transitions. Word has length 291 [2019-11-23 22:47:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:03,037 INFO L462 AbstractCegarLoop]: Abstraction has 5117 states and 6676 transitions. [2019-11-23 22:47:03,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 6676 transitions. [2019-11-23 22:47:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-23 22:47:03,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:03,049 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:03,253 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:03,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:03,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1916566562, now seen corresponding path program 1 times [2019-11-23 22:47:03,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:03,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564083806] [2019-11-23 22:47:03,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-11-23 22:47:03,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564083806] [2019-11-23 22:47:03,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:03,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:03,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822538736] [2019-11-23 22:47:03,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:03,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:03,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:03,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:03,445 INFO L87 Difference]: Start difference. First operand 5117 states and 6676 transitions. Second operand 3 states. [2019-11-23 22:47:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:03,592 INFO L93 Difference]: Finished difference Result 12402 states and 16215 transitions. [2019-11-23 22:47:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:03,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-23 22:47:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:03,660 INFO L225 Difference]: With dead ends: 12402 [2019-11-23 22:47:03,660 INFO L226 Difference]: Without dead ends: 7294 [2019-11-23 22:47:03,669 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:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2019-11-23 22:47:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 7292. [2019-11-23 22:47:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7292 states. [2019-11-23 22:47:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 9521 transitions. [2019-11-23 22:47:03,872 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 9521 transitions. Word has length 292 [2019-11-23 22:47:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:03,873 INFO L462 AbstractCegarLoop]: Abstraction has 7292 states and 9521 transitions. [2019-11-23 22:47:03,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 9521 transitions. [2019-11-23 22:47:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-11-23 22:47:03,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:03,885 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,885 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:03,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1205777966, now seen corresponding path program 1 times [2019-11-23 22:47:03,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:03,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552751743] [2019-11-23 22:47:03,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-11-23 22:47:04,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552751743] [2019-11-23 22:47:04,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:04,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:04,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206060046] [2019-11-23 22:47:04,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:04,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:04,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:04,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:04,023 INFO L87 Difference]: Start difference. First operand 7292 states and 9521 transitions. Second operand 3 states. [2019-11-23 22:47:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:04,268 INFO L93 Difference]: Finished difference Result 14569 states and 18999 transitions. [2019-11-23 22:47:04,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:04,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-11-23 22:47:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:04,296 INFO L225 Difference]: With dead ends: 14569 [2019-11-23 22:47:04,296 INFO L226 Difference]: Without dead ends: 7286 [2019-11-23 22:47:04,310 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:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2019-11-23 22:47:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 6269. [2019-11-23 22:47:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6269 states. [2019-11-23 22:47:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6269 states to 6269 states and 8068 transitions. [2019-11-23 22:47:04,698 INFO L78 Accepts]: Start accepts. Automaton has 6269 states and 8068 transitions. Word has length 293 [2019-11-23 22:47:04,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:04,699 INFO L462 AbstractCegarLoop]: Abstraction has 6269 states and 8068 transitions. [2019-11-23 22:47:04,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:04,699 INFO L276 IsEmpty]: Start isEmpty. Operand 6269 states and 8068 transitions. [2019-11-23 22:47:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-11-23 22:47:04,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:04,712 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:04,712 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:04,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2024435260, now seen corresponding path program 1 times [2019-11-23 22:47:04,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:04,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703391573] [2019-11-23 22:47:04,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1419 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:04,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703391573] [2019-11-23 22:47:04,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:04,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:04,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236315195] [2019-11-23 22:47:04,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:04,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:04,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:04,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:04,836 INFO L87 Difference]: Start difference. First operand 6269 states and 8068 transitions. Second operand 3 states. [2019-11-23 22:47:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:05,097 INFO L93 Difference]: Finished difference Result 13675 states and 17821 transitions. [2019-11-23 22:47:05,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:05,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-11-23 22:47:05,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:05,121 INFO L225 Difference]: With dead ends: 13675 [2019-11-23 22:47:05,121 INFO L226 Difference]: Without dead ends: 7415 [2019-11-23 22:47:05,132 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:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2019-11-23 22:47:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 6611. [2019-11-23 22:47:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6611 states. [2019-11-23 22:47:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 8554 transitions. [2019-11-23 22:47:05,321 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 8554 transitions. Word has length 333 [2019-11-23 22:47:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:05,322 INFO L462 AbstractCegarLoop]: Abstraction has 6611 states and 8554 transitions. [2019-11-23 22:47:05,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 8554 transitions. [2019-11-23 22:47:05,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-11-23 22:47:05,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:05,335 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:05,336 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:05,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:05,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2018141812, now seen corresponding path program 1 times [2019-11-23 22:47:05,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:05,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324864118] [2019-11-23 22:47:05,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:05,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324864118] [2019-11-23 22:47:05,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632241274] [2019-11-23 22:47:05,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:05,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:05,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-11-23 22:47:06,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:47:06,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 22:47:06,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343837498] [2019-11-23 22:47:06,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:06,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:06,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:06,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:06,009 INFO L87 Difference]: Start difference. First operand 6611 states and 8554 transitions. Second operand 3 states. [2019-11-23 22:47:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:06,188 INFO L93 Difference]: Finished difference Result 15401 states and 19915 transitions. [2019-11-23 22:47:06,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:06,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2019-11-23 22:47:06,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:06,216 INFO L225 Difference]: With dead ends: 15401 [2019-11-23 22:47:06,216 INFO L226 Difference]: Without dead ends: 8799 [2019-11-23 22:47:06,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8799 states. [2019-11-23 22:47:06,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8799 to 8799. [2019-11-23 22:47:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8799 states. [2019-11-23 22:47:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8799 states to 8799 states and 11356 transitions. [2019-11-23 22:47:06,670 INFO L78 Accepts]: Start accepts. Automaton has 8799 states and 11356 transitions. Word has length 371 [2019-11-23 22:47:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:06,671 INFO L462 AbstractCegarLoop]: Abstraction has 8799 states and 11356 transitions. [2019-11-23 22:47:06,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:06,672 INFO L276 IsEmpty]: Start isEmpty. Operand 8799 states and 11356 transitions. [2019-11-23 22:47:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-23 22:47:06,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:06,696 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:47:06,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:06,903 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:06,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:06,904 INFO L82 PathProgramCache]: Analyzing trace with hash -106230564, now seen corresponding path program 1 times [2019-11-23 22:47:06,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:06,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255038896] [2019-11-23 22:47:06,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:07,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255038896] [2019-11-23 22:47:07,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005175110] [2019-11-23 22:47:07,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:07,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:07,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-23 22:47:07,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:47:07,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:47:07,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136506426] [2019-11-23 22:47:07,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:07,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:07,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:07,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:07,390 INFO L87 Difference]: Start difference. First operand 8799 states and 11356 transitions. Second operand 4 states. [2019-11-23 22:47:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:07,884 INFO L93 Difference]: Finished difference Result 19741 states and 25400 transitions. [2019-11-23 22:47:07,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:47:07,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-23 22:47:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:07,906 INFO L225 Difference]: With dead ends: 19741 [2019-11-23 22:47:07,907 INFO L226 Difference]: Without dead ends: 10934 [2019-11-23 22:47:07,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2019-11-23 22:47:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 9585. [2019-11-23 22:47:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9585 states. [2019-11-23 22:47:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9585 states to 9585 states and 12272 transitions. [2019-11-23 22:47:08,162 INFO L78 Accepts]: Start accepts. Automaton has 9585 states and 12272 transitions. Word has length 373 [2019-11-23 22:47:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:08,163 INFO L462 AbstractCegarLoop]: Abstraction has 9585 states and 12272 transitions. [2019-11-23 22:47:08,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 9585 states and 12272 transitions. [2019-11-23 22:47:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-23 22:47:08,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:08,191 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:08,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:08,404 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:08,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:08,405 INFO L82 PathProgramCache]: Analyzing trace with hash -77148624, now seen corresponding path program 1 times [2019-11-23 22:47:08,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:08,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287988820] [2019-11-23 22:47:08,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-23 22:47:08,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287988820] [2019-11-23 22:47:08,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:08,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:08,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214878491] [2019-11-23 22:47:08,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:08,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:08,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:08,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:08,671 INFO L87 Difference]: Start difference. First operand 9585 states and 12272 transitions. Second operand 3 states. [2019-11-23 22:47:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:09,021 INFO L93 Difference]: Finished difference Result 18222 states and 23076 transitions. [2019-11-23 22:47:09,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:09,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-23 22:47:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:09,035 INFO L225 Difference]: With dead ends: 18222 [2019-11-23 22:47:09,036 INFO L226 Difference]: Without dead ends: 3798 [2019-11-23 22:47:09,063 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:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2019-11-23 22:47:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3523. [2019-11-23 22:47:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2019-11-23 22:47:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 4382 transitions. [2019-11-23 22:47:09,197 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 4382 transitions. Word has length 412 [2019-11-23 22:47:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:09,198 INFO L462 AbstractCegarLoop]: Abstraction has 3523 states and 4382 transitions. [2019-11-23 22:47:09,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 4382 transitions. [2019-11-23 22:47:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-23 22:47:09,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:09,433 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:09,434 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:09,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:09,435 INFO L82 PathProgramCache]: Analyzing trace with hash -896719054, now seen corresponding path program 1 times [2019-11-23 22:47:09,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:09,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211641781] [2019-11-23 22:47:09,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-11-23 22:47:09,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211641781] [2019-11-23 22:47:09,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175308167] [2019-11-23 22:47:09,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:09,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:47:09,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:47:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-11-23 22:47:10,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:47:10,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-23 22:47:10,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903183097] [2019-11-23 22:47:10,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:10,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:10,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:10,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:10,158 INFO L87 Difference]: Start difference. First operand 3523 states and 4382 transitions. Second operand 4 states. [2019-11-23 22:47:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:10,696 INFO L93 Difference]: Finished difference Result 3784 states and 4712 transitions. [2019-11-23 22:47:10,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:47:10,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 441 [2019-11-23 22:47:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:10,697 INFO L225 Difference]: With dead ends: 3784 [2019-11-23 22:47:10,697 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:47:10,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:47:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:47:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:47:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:47:10,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 441 [2019-11-23 22:47:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:10,701 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:47:10,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:47:10,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:47:10,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:47:10,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:47:11,752 WARN L192 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 96 [2019-11-23 22:47:12,321 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2019-11-23 22:47:12,534 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-11-23 22:47:13,072 WARN L192 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-11-23 22:47:13,366 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-11-23 22:47:13,504 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2019-11-23 22:47:13,756 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 490) no Hoare annotation was computed. [2019-11-23 22:47:13,757 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 501) no Hoare annotation was computed. [2019-11-23 22:47:13,757 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 512) no Hoare annotation was computed. [2019-11-23 22:47:13,757 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-23 22:47:13,757 INFO L444 ceAbstractionStarter]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-23 22:47:13,757 INFO L440 ceAbstractionStarter]: At program point L136(lines 132 502) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-23 22:47:13,758 INFO L447 ceAbstractionStarter]: At program point L533(lines 95 534) the Hoare annotation is: true [2019-11-23 22:47:13,758 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 273) no Hoare annotation was computed. [2019-11-23 22:47:13,758 INFO L444 ceAbstractionStarter]: For program point L236(lines 236 239) no Hoare annotation was computed. [2019-11-23 22:47:13,758 INFO L444 ceAbstractionStarter]: For program point L269-2(lines 269 273) no Hoare annotation was computed. [2019-11-23 22:47:13,758 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 306) no Hoare annotation was computed. [2019-11-23 22:47:13,758 INFO L440 ceAbstractionStarter]: At program point L204(lines 102 512) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0) (and .cse0 .cse1) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse1))) [2019-11-23 22:47:13,758 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 489) no Hoare annotation was computed. [2019-11-23 22:47:13,759 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 500) no Hoare annotation was computed. [2019-11-23 22:47:13,759 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 511) no Hoare annotation was computed. [2019-11-23 22:47:13,759 INFO L440 ceAbstractionStarter]: At program point L172(lines 168 490) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-23 22:47:13,759 INFO L444 ceAbstractionStarter]: For program point L471(lines 471 473) no Hoare annotation was computed. [2019-11-23 22:47:13,759 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 449) no Hoare annotation was computed. [2019-11-23 22:47:13,759 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 419) no Hoare annotation was computed. [2019-11-23 22:47:13,759 INFO L444 ceAbstractionStarter]: For program point L405-1(lines 405 419) no Hoare annotation was computed. [2019-11-23 22:47:13,760 INFO L444 ceAbstractionStarter]: For program point L438-2(lines 438 449) no Hoare annotation was computed. [2019-11-23 22:47:13,760 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 488) no Hoare annotation was computed. [2019-11-23 22:47:13,760 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 499) no Hoare annotation was computed. [2019-11-23 22:47:13,760 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 510) no Hoare annotation was computed. [2019-11-23 22:47:13,760 INFO L444 ceAbstractionStarter]: For program point L538(lines 538 540) no Hoare annotation was computed. [2019-11-23 22:47:13,760 INFO L444 ceAbstractionStarter]: For program point L538-2(lines 538 540) no Hoare annotation was computed. [2019-11-23 22:47:13,760 INFO L440 ceAbstractionStarter]: At program point L142(lines 138 500) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-23 22:47:13,760 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 343) no Hoare annotation was computed. [2019-11-23 22:47:13,761 INFO L444 ceAbstractionStarter]: For program point L209(lines 209 211) no Hoare annotation was computed. [2019-11-23 22:47:13,761 INFO L444 ceAbstractionStarter]: For program point L209-2(lines 209 211) no Hoare annotation was computed. [2019-11-23 22:47:13,761 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 377) no Hoare annotation was computed. [2019-11-23 22:47:13,761 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 487) no Hoare annotation was computed. [2019-11-23 22:47:13,761 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 498) no Hoare annotation was computed. [2019-11-23 22:47:13,761 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 509) no Hoare annotation was computed. [2019-11-23 22:47:13,761 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 415) no Hoare annotation was computed. [2019-11-23 22:47:13,762 INFO L440 ceAbstractionStarter]: At program point L178(lines 174 488) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-23 22:47:13,762 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 446) no Hoare annotation was computed. [2019-11-23 22:47:13,762 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 313) no Hoare annotation was computed. [2019-11-23 22:47:13,762 INFO L444 ceAbstractionStarter]: For program point L278-1(lines 278 288) no Hoare annotation was computed. [2019-11-23 22:47:13,762 INFO L447 ceAbstractionStarter]: At program point L543(lines 10 545) the Hoare annotation is: true [2019-11-23 22:47:13,762 INFO L440 ceAbstractionStarter]: At program point L312(lines 74 544) the Hoare annotation is: false [2019-11-23 22:47:13,762 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 486) no Hoare annotation was computed. [2019-11-23 22:47:13,762 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 497) no Hoare annotation was computed. [2019-11-23 22:47:13,763 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 508) no Hoare annotation was computed. [2019-11-23 22:47:13,763 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 217) no Hoare annotation was computed. [2019-11-23 22:47:13,763 INFO L440 ceAbstractionStarter]: At program point L148(lines 144 498) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 .cse1 .cse3 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse3 .cse2))) [2019-11-23 22:47:13,763 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-11-23 22:47:13,763 INFO L440 ceAbstractionStarter]: At program point L479(lines 96 532) the Hoare annotation is: (let ((.cse9 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse4 (= 4528 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse7 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse2 (= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse3 .cse1) (and .cse3 .cse1 (= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse4 .cse3 .cse1) (and .cse5 .cse6 .cse3 .cse7 .cse1 .cse8) (and .cse9 .cse3 .cse8) (and .cse3 (= 4496 ULTIMATE.start_ssl3_connect_~s__state~0) .cse1) (and .cse0 .cse9 .cse8) (and (= 4480 ULTIMATE.start_ssl3_connect_~s__state~0) .cse3 .cse1) (and .cse4 .cse0) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse10 .cse11 .cse3 .cse7 .cse1 .cse8) (and .cse2 .cse0) (and .cse5 .cse6 .cse0) (and .cse10 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11))) [2019-11-23 22:47:13,764 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-11-23 22:47:13,764 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 250) no Hoare annotation was computed. [2019-11-23 22:47:13,764 INFO L444 ceAbstractionStarter]: For program point L248-2(lines 199 478) no Hoare annotation was computed. [2019-11-23 22:47:13,764 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 385) no Hoare annotation was computed. [2019-11-23 22:47:13,764 INFO L444 ceAbstractionStarter]: For program point L381-2(lines 199 478) no Hoare annotation was computed. [2019-11-23 22:47:13,764 INFO L444 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-11-23 22:47:13,764 INFO L444 ceAbstractionStarter]: For program point L282-2(lines 280 288) no Hoare annotation was computed. [2019-11-23 22:47:13,765 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 485) no Hoare annotation was computed. [2019-11-23 22:47:13,765 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 496) no Hoare annotation was computed. [2019-11-23 22:47:13,765 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 507) no Hoare annotation was computed. [2019-11-23 22:47:13,765 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 530) no Hoare annotation was computed. [2019-11-23 22:47:13,765 INFO L440 ceAbstractionStarter]: At program point L184(lines 180 486) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-23 22:47:13,765 INFO L440 ceAbstractionStarter]: At program point L118(lines 114 508) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-23 22:47:13,765 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-11-23 22:47:13,766 INFO L444 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-11-23 22:47:13,766 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 529) no Hoare annotation was computed. [2019-11-23 22:47:13,766 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 352) no Hoare annotation was computed. [2019-11-23 22:47:13,766 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:47:13,766 INFO L444 ceAbstractionStarter]: For program point L516(lines 516 521) no Hoare annotation was computed. [2019-11-23 22:47:13,766 INFO L444 ceAbstractionStarter]: For program point L516-2(lines 515 529) no Hoare annotation was computed. [2019-11-23 22:47:13,766 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 484) no Hoare annotation was computed. [2019-11-23 22:47:13,766 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 495) no Hoare annotation was computed. [2019-11-23 22:47:13,767 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 506) no Hoare annotation was computed. [2019-11-23 22:47:13,767 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 231) no Hoare annotation was computed. [2019-11-23 22:47:13,767 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 199 478) no Hoare annotation was computed. [2019-11-23 22:47:13,767 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 520) no Hoare annotation was computed. [2019-11-23 22:47:13,767 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 359) no Hoare annotation was computed. [2019-11-23 22:47:13,767 INFO L444 ceAbstractionStarter]: For program point L354-2(lines 354 359) no Hoare annotation was computed. [2019-11-23 22:47:13,767 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 225) no Hoare annotation was computed. [2019-11-23 22:47:13,767 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 483) no Hoare annotation was computed. [2019-11-23 22:47:13,767 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 494) no Hoare annotation was computed. [2019-11-23 22:47:13,767 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 505) no Hoare annotation was computed. [2019-11-23 22:47:13,768 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-11-23 22:47:13,768 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 454 456) no Hoare annotation was computed. [2019-11-23 22:47:13,768 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:47:13,768 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 258) no Hoare annotation was computed. [2019-11-23 22:47:13,768 INFO L440 ceAbstractionStarter]: At program point L190(lines 186 484) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 .cse4 .cse3) (and .cse0 .cse1 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse2 .cse3))) [2019-11-23 22:47:13,768 INFO L440 ceAbstractionStarter]: At program point L124(lines 120 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-23 22:47:13,769 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-11-23 22:47:13,769 INFO L447 ceAbstractionStarter]: At program point L554(lines 546 556) the Hoare annotation is: true [2019-11-23 22:47:13,769 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-23 22:47:13,769 INFO L444 ceAbstractionStarter]: For program point L323-2(lines 199 478) no Hoare annotation was computed. [2019-11-23 22:47:13,769 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 393) no Hoare annotation was computed. [2019-11-23 22:47:13,769 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 482) no Hoare annotation was computed. [2019-11-23 22:47:13,769 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 493) no Hoare annotation was computed. [2019-11-23 22:47:13,769 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 504) no Hoare annotation was computed. [2019-11-23 22:47:13,769 INFO L444 ceAbstractionStarter]: For program point L523(lines 523 527) no Hoare annotation was computed. [2019-11-23 22:47:13,770 INFO L444 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2019-11-23 22:47:13,770 INFO L440 ceAbstractionStarter]: At program point L193(lines 192 482) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 .cse4 .cse1 .cse3) (and .cse0 .cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1))) [2019-11-23 22:47:13,770 INFO L440 ceAbstractionStarter]: At program point L160(lines 150 496) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-23 22:47:13,770 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:47:13,770 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 427) no Hoare annotation was computed. [2019-11-23 22:47:13,770 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 481) no Hoare annotation was computed. [2019-11-23 22:47:13,770 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 492) no Hoare annotation was computed. [2019-11-23 22:47:13,771 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 503) no Hoare annotation was computed. [2019-11-23 22:47:13,771 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 74 544) no Hoare annotation was computed. [2019-11-23 22:47:13,771 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 462) no Hoare annotation was computed. [2019-11-23 22:47:13,771 INFO L444 ceAbstractionStarter]: For program point L460-2(lines 460 462) no Hoare annotation was computed. [2019-11-23 22:47:13,771 INFO L444 ceAbstractionStarter]: For program point L295(lines 295 297) no Hoare annotation was computed. [2019-11-23 22:47:13,771 INFO L444 ceAbstractionStarter]: For program point L295-2(lines 199 478) no Hoare annotation was computed. [2019-11-23 22:47:13,771 INFO L447 ceAbstractionStarter]: At program point L196(lines 195 481) the Hoare annotation is: true [2019-11-23 22:47:13,771 INFO L440 ceAbstractionStarter]: At program point L130(lines 126 504) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-23 22:47:13,771 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-23 22:47:13,772 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 432) no Hoare annotation was computed. [2019-11-23 22:47:13,772 INFO L444 ceAbstractionStarter]: For program point L428-2(lines 428 432) no Hoare annotation was computed. [2019-11-23 22:47:13,772 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-23 22:47:13,772 INFO L444 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-11-23 22:47:13,772 INFO L444 ceAbstractionStarter]: For program point L329-2(lines 329 333) no Hoare annotation was computed. [2019-11-23 22:47:13,772 INFO L444 ceAbstractionStarter]: For program point L263-2(lines 199 478) no Hoare annotation was computed. [2019-11-23 22:47:13,772 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2019-11-23 22:47:13,772 INFO L447 ceAbstractionStarter]: At program point L198(lines 197 481) the Hoare annotation is: true [2019-11-23 22:47:13,773 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 491) no Hoare annotation was computed. [2019-11-23 22:47:13,773 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 502) no Hoare annotation was computed. [2019-11-23 22:47:13,773 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 513) no Hoare annotation was computed. [2019-11-23 22:47:13,773 INFO L440 ceAbstractionStarter]: At program point L166(lines 162 492) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-23 22:47:13,773 INFO L440 ceAbstractionStarter]: At program point L100(lines 99 513) the Hoare annotation is: (let ((.cse0 (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-23 22:47:13,773 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-23 22:47:13,773 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 367) no Hoare annotation was computed. [2019-11-23 22:47:13,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:47:13 BoogieIcfgContainer [2019-11-23 22:47:13,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:47:13,819 INFO L168 Benchmark]: Toolchain (without parser) took 18665.16 ms. Allocated memory was 146.3 MB in the beginning and 897.6 MB in the end (delta: 751.3 MB). Free memory was 103.9 MB in the beginning and 450.4 MB in the end (delta: -346.4 MB). Peak memory consumption was 404.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:13,820 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.3 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:13,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.79 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 103.7 MB in the beginning and 178.2 MB in the end (delta: -74.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:13,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.71 ms. Allocated memory is still 202.9 MB. Free memory was 178.2 MB in the beginning and 175.6 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:13,823 INFO L168 Benchmark]: Boogie Preprocessor took 52.22 ms. Allocated memory is still 202.9 MB. Free memory was 175.6 MB in the beginning and 173.2 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:13,830 INFO L168 Benchmark]: RCFGBuilder took 850.81 ms. Allocated memory is still 202.9 MB. Free memory was 173.2 MB in the beginning and 123.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:13,831 INFO L168 Benchmark]: TraceAbstraction took 17104.90 ms. Allocated memory was 202.9 MB in the beginning and 897.6 MB in the end (delta: 694.7 MB). Free memory was 123.3 MB in the beginning and 450.4 MB in the end (delta: -327.1 MB). Peak memory consumption was 367.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:47:13,835 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.53 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 590.79 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 103.7 MB in the beginning and 178.2 MB in the end (delta: -74.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.71 ms. Allocated memory is still 202.9 MB. Free memory was 178.2 MB in the beginning and 175.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.22 ms. Allocated memory is still 202.9 MB. Free memory was 175.6 MB in the beginning and 173.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 850.81 ms. Allocated memory is still 202.9 MB. Free memory was 173.2 MB in the beginning and 123.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17104.90 ms. Allocated memory was 202.9 MB in the beginning and 897.6 MB in the end (delta: 694.7 MB). Free memory was 123.3 MB in the beginning and 450.4 MB in the end (delta: -327.1 MB). Peak memory consumption was 367.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 542]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((4560 <= s__state && blastFlag <= 2) && 0 == s__hit)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((4560 <= s__state && blastFlag <= 4) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 546]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && 4368 == s__state) || (blastFlag <= 2 && 0 == s__hit)) || ((4512 == s__state && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || ((s__s3__tmp__new_cipher__algorithms == 256 && 0 == s__hit) && 4464 == s__state)) || ((4528 == s__state && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || (((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 3 && s__s3__tmp__new_cipher__algorithms == 256) && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__new_cipher__algorithms == 256 && 4496 == s__state) && 0 == s__hit)) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || ((4480 == s__state && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || (4528 == s__state && blastFlag <= 2)) || (blastFlag <= 2 && 4384 == s__state)) || (((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (4512 == s__state && blastFlag <= 2)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || (((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) || (blastFlag <= 2 && 0 == s__hit)) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 12292 == s__state) || (((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 12292 == s__state) && 0 == s__hit) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Result: SAFE, OverallTime: 16.9s, OverallIterations: 24, TraceHistogramMax: 18, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, HoareTripleCheckerStatistics: 4616 SDtfs, 1482 SDslu, 2556 SDs, 0 SdLazy, 2390 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1553 GetRequests, 1521 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9585occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 4007 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 325 NumberOfFragments, 660 HoareAnnotationTreeSize, 22 FomulaSimplifications, 13142 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1989 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 6398 NumberOfCodeBlocks, 6398 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6370 ConstructedInterpolants, 0 QuantifiedInterpolants, 2622380 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 21955/22034 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 correct! Received shutdown request...