./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_3_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_srvr_3_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb70094490cf46157ed6f1dc8c697227b983429d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:23:41,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:23:41,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:23:41,732 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:23:41,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:23:41,733 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:23:41,734 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:23:41,736 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:23:41,738 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:23:41,738 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:23:41,739 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:23:41,740 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:23:41,741 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:23:41,742 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:23:41,743 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:23:41,743 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:23:41,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:23:41,746 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:23:41,748 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:23:41,750 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:23:41,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:23:41,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:23:41,755 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:23:41,755 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:23:41,755 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:23:41,756 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:23:41,757 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:23:41,758 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:23:41,759 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:23:41,760 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:23:41,761 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:23:41,761 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:23:41,762 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:23:41,762 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:23:41,763 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:23:41,764 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:23:41,764 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:23:41,788 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:23:41,789 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:23:41,791 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:23:41,791 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:23:41,791 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:23:41,792 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:23:41,792 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:23:41,792 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:23:41,792 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:23:41,792 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:23:41,792 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:23:41,793 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:23:41,794 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:23:41,794 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:23:41,794 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:23:41,794 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:23:41,794 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:23:41,795 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:23:41,795 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:23:41,795 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:23:41,795 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:23:41,795 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:23:41,795 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:23:41,797 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:23:41,797 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:23:41,797 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:23:41,798 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:23:41,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:23:41,798 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb70094490cf46157ed6f1dc8c697227b983429d [2019-01-11 21:23:41,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:23:41,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:23:41,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:23:41,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:23:41,872 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:23:41,873 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_3_true-unreach-call_false-termination.cil.c [2019-01-11 21:23:41,935 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb6e770c/9d668054b7b04793b9e44441bd603945/FLAGd91860486 [2019-01-11 21:23:42,426 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:23:42,427 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_3_true-unreach-call_false-termination.cil.c [2019-01-11 21:23:42,439 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb6e770c/9d668054b7b04793b9e44441bd603945/FLAGd91860486 [2019-01-11 21:23:42,786 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb6e770c/9d668054b7b04793b9e44441bd603945 [2019-01-11 21:23:42,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:23:42,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:23:42,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:23:42,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:23:42,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:23:42,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:23:42" (1/1) ... [2019-01-11 21:23:42,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630dbd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:42, skipping insertion in model container [2019-01-11 21:23:42,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:23:42" (1/1) ... [2019-01-11 21:23:42,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:23:42,878 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:23:43,200 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:23:43,204 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:23:43,308 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:23:43,324 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:23:43,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:43 WrapperNode [2019-01-11 21:23:43,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:23:43,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:23:43,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:23:43,326 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:23:43,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:43" (1/1) ... [2019-01-11 21:23:43,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:43" (1/1) ... [2019-01-11 21:23:43,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:23:43,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:23:43,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:23:43,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:23:43,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:43" (1/1) ... [2019-01-11 21:23:43,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:43" (1/1) ... [2019-01-11 21:23:43,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:43" (1/1) ... [2019-01-11 21:23:43,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:43" (1/1) ... [2019-01-11 21:23:43,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:43" (1/1) ... [2019-01-11 21:23:43,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:43" (1/1) ... [2019-01-11 21:23:43,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:43" (1/1) ... [2019-01-11 21:23:43,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:23:43,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:23:43,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:23:43,509 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:23:43,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:43" (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-01-11 21:23:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:23:43,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:23:43,778 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:23:44,780 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:23:44,780 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:23:44,781 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:23:44,781 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:23:44,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:44 BoogieIcfgContainer [2019-01-11 21:23:44,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:23:44,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:23:44,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:23:44,787 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:23:44,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:23:42" (1/3) ... [2019-01-11 21:23:44,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c568783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:23:44, skipping insertion in model container [2019-01-11 21:23:44,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:43" (2/3) ... [2019-01-11 21:23:44,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c568783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:23:44, skipping insertion in model container [2019-01-11 21:23:44,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:44" (3/3) ... [2019-01-11 21:23:44,790 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_true-unreach-call_false-termination.cil.c [2019-01-11 21:23:44,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:23:44,808 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:23:44,825 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:23:44,858 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:23:44,859 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:23:44,860 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:23:44,860 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:23:44,860 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:23:44,860 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:23:44,861 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:23:44,861 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:23:44,861 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:23:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-01-11 21:23:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 21:23:44,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:44,891 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:44,893 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:44,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:44,899 INFO L82 PathProgramCache]: Analyzing trace with hash -91604792, now seen corresponding path program 1 times [2019-01-11 21:23:44,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:44,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:44,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:44,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:44,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:45,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:45,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:45,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:45,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:45,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:45,213 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-01-11 21:23:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:46,222 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-01-11 21:23:46,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:46,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-11 21:23:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:46,239 INFO L225 Difference]: With dead ends: 327 [2019-01-11 21:23:46,239 INFO L226 Difference]: Without dead ends: 174 [2019-01-11 21:23:46,243 INFO L631 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-01-11 21:23:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-11 21:23:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-01-11 21:23:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-11 21:23:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-01-11 21:23:46,304 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-01-11 21:23:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:46,305 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-01-11 21:23:46,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-01-11 21:23:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 21:23:46,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:46,308 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:46,308 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:46,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:46,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1448034255, now seen corresponding path program 1 times [2019-01-11 21:23:46,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:46,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:46,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:46,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:46,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:46,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:46,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:46,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:46,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:46,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:46,442 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-01-11 21:23:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:46,870 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-01-11 21:23:46,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:46,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-11 21:23:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:46,875 INFO L225 Difference]: With dead ends: 379 [2019-01-11 21:23:46,875 INFO L226 Difference]: Without dead ends: 215 [2019-01-11 21:23:46,877 INFO L631 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-01-11 21:23:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-11 21:23:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-01-11 21:23:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-11 21:23:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-01-11 21:23:46,898 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-01-11 21:23:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:46,899 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-01-11 21:23:46,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-01-11 21:23:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-11 21:23:46,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:46,903 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:23:46,903 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:46,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:46,903 INFO L82 PathProgramCache]: Analyzing trace with hash 564000227, now seen corresponding path program 1 times [2019-01-11 21:23:46,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:46,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:46,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:47,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:47,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:47,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:47,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:47,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:47,043 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-01-11 21:23:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:47,360 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-01-11 21:23:47,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:47,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-11 21:23:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:47,364 INFO L225 Difference]: With dead ends: 444 [2019-01-11 21:23:47,364 INFO L226 Difference]: Without dead ends: 241 [2019-01-11 21:23:47,366 INFO L631 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-01-11 21:23:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-11 21:23:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-01-11 21:23:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-11 21:23:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-01-11 21:23:47,387 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-01-11 21:23:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:47,388 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-01-11 21:23:47,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-01-11 21:23:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:23:47,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:47,393 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:23:47,393 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:47,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:47,394 INFO L82 PathProgramCache]: Analyzing trace with hash 730826777, now seen corresponding path program 1 times [2019-01-11 21:23:47,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:47,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:47,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:47,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:47,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:47,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:47,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:47,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:47,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:47,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:47,489 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-01-11 21:23:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:47,871 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-01-11 21:23:47,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:47,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:23:47,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:47,875 INFO L225 Difference]: With dead ends: 492 [2019-01-11 21:23:47,875 INFO L226 Difference]: Without dead ends: 258 [2019-01-11 21:23:47,876 INFO L631 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-01-11 21:23:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-11 21:23:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-01-11 21:23:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-11 21:23:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-01-11 21:23:47,908 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-01-11 21:23:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:47,908 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-01-11 21:23:47,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-01-11 21:23:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:23:47,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:47,912 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:47,913 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:47,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1628760422, now seen corresponding path program 1 times [2019-01-11 21:23:47,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:47,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:47,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:47,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:47,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:48,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:48,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:48,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:48,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:48,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:48,011 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-01-11 21:23:48,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:48,289 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-01-11 21:23:48,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:48,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:23:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:48,293 INFO L225 Difference]: With dead ends: 551 [2019-01-11 21:23:48,293 INFO L226 Difference]: Without dead ends: 302 [2019-01-11 21:23:48,294 INFO L631 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-01-11 21:23:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-11 21:23:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-01-11 21:23:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-11 21:23:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-01-11 21:23:48,309 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-01-11 21:23:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:48,309 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-01-11 21:23:48,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-01-11 21:23:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:23:48,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:48,313 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:23:48,313 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:48,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:48,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2100135205, now seen corresponding path program 1 times [2019-01-11 21:23:48,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:48,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:48,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:48,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:48,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:48,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:48,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:48,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:48,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:48,433 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-01-11 21:23:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:48,918 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-01-11 21:23:48,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:48,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:23:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:48,920 INFO L225 Difference]: With dead ends: 591 [2019-01-11 21:23:48,921 INFO L226 Difference]: Without dead ends: 300 [2019-01-11 21:23:48,921 INFO L631 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-01-11 21:23:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-11 21:23:48,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-01-11 21:23:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-11 21:23:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-01-11 21:23:48,938 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-01-11 21:23:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:48,938 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-01-11 21:23:48,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-01-11 21:23:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:23:48,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:48,941 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:48,941 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:48,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:48,942 INFO L82 PathProgramCache]: Analyzing trace with hash 967197197, now seen corresponding path program 1 times [2019-01-11 21:23:48,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:48,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:48,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:48,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:48,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:49,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:49,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:49,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:49,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:49,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:49,037 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-01-11 21:23:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:49,741 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-01-11 21:23:49,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:49,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:23:49,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:49,746 INFO L225 Difference]: With dead ends: 593 [2019-01-11 21:23:49,746 INFO L226 Difference]: Without dead ends: 300 [2019-01-11 21:23:49,747 INFO L631 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-01-11 21:23:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-11 21:23:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-01-11 21:23:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-11 21:23:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-01-11 21:23:49,758 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-01-11 21:23:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:49,758 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-01-11 21:23:49,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-01-11 21:23:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 21:23:49,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:49,760 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:23:49,760 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:49,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:49,761 INFO L82 PathProgramCache]: Analyzing trace with hash 169031718, now seen corresponding path program 1 times [2019-01-11 21:23:49,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:49,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:49,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-01-11 21:23:49,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:49,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:49,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:49,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:49,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:49,834 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-01-11 21:23:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:50,131 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-01-11 21:23:50,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:50,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-11 21:23:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:50,135 INFO L225 Difference]: With dead ends: 594 [2019-01-11 21:23:50,137 INFO L226 Difference]: Without dead ends: 305 [2019-01-11 21:23:50,138 INFO L631 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-01-11 21:23:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-11 21:23:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-01-11 21:23:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-11 21:23:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-01-11 21:23:50,163 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-01-11 21:23:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:50,163 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-01-11 21:23:50,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-01-11 21:23:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-11 21:23:50,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:50,167 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:23:50,167 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:50,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:50,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1117186876, now seen corresponding path program 1 times [2019-01-11 21:23:50,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:50,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:50,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:50,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:50,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:50,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:50,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:50,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:50,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:50,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:50,298 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-01-11 21:23:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:51,560 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-01-11 21:23:51,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:51,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-11 21:23:51,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:51,564 INFO L225 Difference]: With dead ends: 634 [2019-01-11 21:23:51,564 INFO L226 Difference]: Without dead ends: 336 [2019-01-11 21:23:51,565 INFO L631 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-01-11 21:23:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-11 21:23:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-11 21:23:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-11 21:23:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-01-11 21:23:51,579 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-01-11 21:23:51,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:51,579 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-01-11 21:23:51,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-01-11 21:23:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 21:23:51,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:51,581 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:23:51,581 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:51,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1355507800, now seen corresponding path program 1 times [2019-01-11 21:23:51,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:51,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:51,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:51,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:51,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:51,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:51,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:51,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:51,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:51,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:51,675 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-01-11 21:23:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:52,402 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-01-11 21:23:52,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:52,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-11 21:23:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:52,406 INFO L225 Difference]: With dead ends: 663 [2019-01-11 21:23:52,406 INFO L226 Difference]: Without dead ends: 336 [2019-01-11 21:23:52,407 INFO L631 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-01-11 21:23:52,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-11 21:23:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-11 21:23:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-11 21:23:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-01-11 21:23:52,418 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-01-11 21:23:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:52,418 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-01-11 21:23:52,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-01-11 21:23:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 21:23:52,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:52,425 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:23:52,425 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:52,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:52,425 INFO L82 PathProgramCache]: Analyzing trace with hash 106299532, now seen corresponding path program 1 times [2019-01-11 21:23:52,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:52,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:52,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:52,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:52,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:52,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:52,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:52,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:52,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:52,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:52,495 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-01-11 21:23:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:53,120 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-01-11 21:23:53,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:53,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-11 21:23:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:53,124 INFO L225 Difference]: With dead ends: 696 [2019-01-11 21:23:53,124 INFO L226 Difference]: Without dead ends: 369 [2019-01-11 21:23:53,125 INFO L631 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-01-11 21:23:53,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-11 21:23:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-01-11 21:23:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-11 21:23:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-01-11 21:23:53,137 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-01-11 21:23:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:53,137 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-01-11 21:23:53,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-01-11 21:23:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 21:23:53,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:53,139 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-01-11 21:23:53,139 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:53,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:53,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179864, now seen corresponding path program 1 times [2019-01-11 21:23:53,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:53,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:53,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:53,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:53,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:53,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:53,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:53,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:53,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:53,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:53,232 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-01-11 21:23:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:53,959 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-01-11 21:23:53,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:53,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-11 21:23:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:53,963 INFO L225 Difference]: With dead ends: 723 [2019-01-11 21:23:53,963 INFO L226 Difference]: Without dead ends: 369 [2019-01-11 21:23:53,964 INFO L631 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-01-11 21:23:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-11 21:23:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-01-11 21:23:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-11 21:23:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-01-11 21:23:53,976 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-01-11 21:23:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:53,976 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-01-11 21:23:53,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-01-11 21:23:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 21:23:53,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:53,978 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:53,978 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:53,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:53,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1408209639, now seen corresponding path program 1 times [2019-01-11 21:23:53,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:53,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:53,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:53,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:53,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:54,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:54,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:54,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:54,049 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-01-11 21:23:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:54,562 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-01-11 21:23:54,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:54,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-11 21:23:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:54,564 INFO L225 Difference]: With dead ends: 740 [2019-01-11 21:23:54,564 INFO L226 Difference]: Without dead ends: 386 [2019-01-11 21:23:54,566 INFO L631 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-01-11 21:23:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-11 21:23:54,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-01-11 21:23:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-11 21:23:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-01-11 21:23:54,585 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-01-11 21:23:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:54,586 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-01-11 21:23:54,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:54,586 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-01-11 21:23:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:23:54,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:54,589 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:54,590 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:54,591 INFO L82 PathProgramCache]: Analyzing trace with hash -628608595, now seen corresponding path program 1 times [2019-01-11 21:23:54,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:54,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:54,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:54,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:54,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:54,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:54,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:54,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:54,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:54,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:54,680 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-01-11 21:23:55,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:55,370 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-01-11 21:23:55,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:55,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:23:55,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:55,373 INFO L225 Difference]: With dead ends: 761 [2019-01-11 21:23:55,373 INFO L226 Difference]: Without dead ends: 386 [2019-01-11 21:23:55,374 INFO L631 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-01-11 21:23:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-11 21:23:55,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-01-11 21:23:55,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-11 21:23:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-01-11 21:23:55,387 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-01-11 21:23:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:55,388 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-01-11 21:23:55,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-01-11 21:23:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-11 21:23:55,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:55,390 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-01-11 21:23:55,390 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:55,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:55,390 INFO L82 PathProgramCache]: Analyzing trace with hash 543915161, now seen corresponding path program 1 times [2019-01-11 21:23:55,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:55,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:55,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:55,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:55,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-11 21:23:55,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:55,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:55,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:55,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:55,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:55,505 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-01-11 21:23:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:55,832 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-01-11 21:23:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:55,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-01-11 21:23:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:55,840 INFO L225 Difference]: With dead ends: 757 [2019-01-11 21:23:55,841 INFO L226 Difference]: Without dead ends: 755 [2019-01-11 21:23:55,841 INFO L631 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-01-11 21:23:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-01-11 21:23:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-01-11 21:23:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-01-11 21:23:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-01-11 21:23:55,870 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-01-11 21:23:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:55,870 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-01-11 21:23:55,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-01-11 21:23:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 21:23:55,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:55,873 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:23:55,873 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:55,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1286959367, now seen corresponding path program 1 times [2019-01-11 21:23:55,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:55,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:55,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:55,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:55,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:55,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:55,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:55,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:55,957 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-01-11 21:23:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:56,700 INFO L93 Difference]: Finished difference Result 1587 states and 2515 transitions. [2019-01-11 21:23:56,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:56,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-11 21:23:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:56,705 INFO L225 Difference]: With dead ends: 1587 [2019-01-11 21:23:56,705 INFO L226 Difference]: Without dead ends: 839 [2019-01-11 21:23:56,707 INFO L631 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-01-11 21:23:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-01-11 21:23:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 831. [2019-01-11 21:23:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-01-11 21:23:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1313 transitions. [2019-01-11 21:23:56,732 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1313 transitions. Word has length 121 [2019-01-11 21:23:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:56,732 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1313 transitions. [2019-01-11 21:23:56,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1313 transitions. [2019-01-11 21:23:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-11 21:23:56,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:56,735 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:23:56,736 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:56,736 INFO L82 PathProgramCache]: Analyzing trace with hash 203437824, now seen corresponding path program 1 times [2019-01-11 21:23:56,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:56,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:56,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:56,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:56,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:56,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:56,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:56,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:56,813 INFO L87 Difference]: Start difference. First operand 831 states and 1313 transitions. Second operand 3 states. [2019-01-11 21:23:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:57,719 INFO L93 Difference]: Finished difference Result 1663 states and 2627 transitions. [2019-01-11 21:23:57,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:57,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-01-11 21:23:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:57,723 INFO L225 Difference]: With dead ends: 1663 [2019-01-11 21:23:57,724 INFO L226 Difference]: Without dead ends: 835 [2019-01-11 21:23:57,725 INFO L631 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-01-11 21:23:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-01-11 21:23:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 827. [2019-01-11 21:23:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-01-11 21:23:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1301 transitions. [2019-01-11 21:23:57,750 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1301 transitions. Word has length 122 [2019-01-11 21:23:57,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:57,750 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1301 transitions. [2019-01-11 21:23:57,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1301 transitions. [2019-01-11 21:23:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-11 21:23:57,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:57,752 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-11 21:23:57,753 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:57,753 INFO L82 PathProgramCache]: Analyzing trace with hash -431636595, now seen corresponding path program 1 times [2019-01-11 21:23:57,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:57,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:57,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:57,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:57,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-01-11 21:23:57,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:57,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:57,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:57,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:57,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:57,823 INFO L87 Difference]: Start difference. First operand 827 states and 1301 transitions. Second operand 3 states. [2019-01-11 21:23:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:58,118 INFO L93 Difference]: Finished difference Result 1723 states and 2711 transitions. [2019-01-11 21:23:58,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:58,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-01-11 21:23:58,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:58,124 INFO L225 Difference]: With dead ends: 1723 [2019-01-11 21:23:58,124 INFO L226 Difference]: Without dead ends: 903 [2019-01-11 21:23:58,126 INFO L631 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-01-11 21:23:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-01-11 21:23:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 899. [2019-01-11 21:23:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-01-11 21:23:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1409 transitions. [2019-01-11 21:23:58,153 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1409 transitions. Word has length 154 [2019-01-11 21:23:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:58,153 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1409 transitions. [2019-01-11 21:23:58,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1409 transitions. [2019-01-11 21:23:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-11 21:23:58,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:58,158 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-11 21:23:58,158 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash 579021766, now seen corresponding path program 1 times [2019-01-11 21:23:58,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:58,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:58,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:58,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:58,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-01-11 21:23:58,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:58,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:58,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:58,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:58,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:58,246 INFO L87 Difference]: Start difference. First operand 899 states and 1409 transitions. Second operand 3 states. [2019-01-11 21:23:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:59,276 INFO L93 Difference]: Finished difference Result 1795 states and 2811 transitions. [2019-01-11 21:23:59,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:59,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-01-11 21:23:59,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:59,282 INFO L225 Difference]: With dead ends: 1795 [2019-01-11 21:23:59,283 INFO L226 Difference]: Without dead ends: 899 [2019-01-11 21:23:59,284 INFO L631 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-01-11 21:23:59,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-01-11 21:23:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 895. [2019-01-11 21:23:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-01-11 21:23:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1395 transitions. [2019-01-11 21:23:59,311 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1395 transitions. Word has length 155 [2019-01-11 21:23:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:59,312 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1395 transitions. [2019-01-11 21:23:59,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1395 transitions. [2019-01-11 21:23:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-11 21:23:59,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:59,316 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-01-11 21:23:59,316 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1624823262, now seen corresponding path program 1 times [2019-01-11 21:23:59,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:59,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:59,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-01-11 21:23:59,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:59,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:59,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:59,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:59,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:59,417 INFO L87 Difference]: Start difference. First operand 895 states and 1395 transitions. Second operand 3 states. [2019-01-11 21:23:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:59,634 INFO L93 Difference]: Finished difference Result 1855 states and 2891 transitions. [2019-01-11 21:23:59,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:59,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-01-11 21:23:59,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:59,638 INFO L225 Difference]: With dead ends: 1855 [2019-01-11 21:23:59,638 INFO L226 Difference]: Without dead ends: 967 [2019-01-11 21:23:59,640 INFO L631 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-01-11 21:23:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-01-11 21:23:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 963. [2019-01-11 21:23:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-01-11 21:23:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1493 transitions. [2019-01-11 21:23:59,665 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1493 transitions. Word has length 185 [2019-01-11 21:23:59,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:59,666 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 1493 transitions. [2019-01-11 21:23:59,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:59,666 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1493 transitions. [2019-01-11 21:23:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-11 21:23:59,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:59,668 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-01-11 21:23:59,669 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:59,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:59,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1103681317, now seen corresponding path program 1 times [2019-01-11 21:23:59,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:59,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:59,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:59,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:59,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-01-11 21:23:59,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:59,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:59,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:59,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:59,727 INFO L87 Difference]: Start difference. First operand 963 states and 1493 transitions. Second operand 3 states. [2019-01-11 21:23:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:59,925 INFO L93 Difference]: Finished difference Result 1923 states and 2979 transitions. [2019-01-11 21:23:59,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:59,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-01-11 21:23:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:59,932 INFO L225 Difference]: With dead ends: 1923 [2019-01-11 21:23:59,932 INFO L226 Difference]: Without dead ends: 963 [2019-01-11 21:23:59,934 INFO L631 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-01-11 21:23:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-01-11 21:23:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 959. [2019-01-11 21:23:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-01-11 21:23:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1477 transitions. [2019-01-11 21:23:59,963 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1477 transitions. Word has length 186 [2019-01-11 21:23:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:59,964 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1477 transitions. [2019-01-11 21:23:59,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1477 transitions. [2019-01-11 21:23:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-01-11 21:23:59,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:59,968 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:59,968 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:59,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash 550080402, now seen corresponding path program 1 times [2019-01-11 21:23:59,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:59,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:59,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:59,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:59,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-01-11 21:24:00,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:00,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:00,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:00,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:00,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:00,063 INFO L87 Difference]: Start difference. First operand 959 states and 1477 transitions. Second operand 3 states. [2019-01-11 21:24:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:00,808 INFO L93 Difference]: Finished difference Result 1987 states and 3067 transitions. [2019-01-11 21:24:00,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:00,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-01-11 21:24:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:00,815 INFO L225 Difference]: With dead ends: 1987 [2019-01-11 21:24:00,815 INFO L226 Difference]: Without dead ends: 1035 [2019-01-11 21:24:00,816 INFO L631 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-01-11 21:24:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-01-11 21:24:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-01-11 21:24:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-01-11 21:24:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1541 transitions. [2019-01-11 21:24:00,844 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1541 transitions. Word has length 203 [2019-01-11 21:24:00,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:00,845 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 1541 transitions. [2019-01-11 21:24:00,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1541 transitions. [2019-01-11 21:24:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-11 21:24:00,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:00,848 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:00,848 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:00,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:00,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1613413310, now seen corresponding path program 1 times [2019-01-11 21:24:00,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:00,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:00,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:00,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:00,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-01-11 21:24:00,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:00,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:00,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:00,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:00,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:00,946 INFO L87 Difference]: Start difference. First operand 1009 states and 1541 transitions. Second operand 3 states. [2019-01-11 21:24:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:01,284 INFO L93 Difference]: Finished difference Result 2037 states and 3113 transitions. [2019-01-11 21:24:01,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:01,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-01-11 21:24:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:01,290 INFO L225 Difference]: With dead ends: 2037 [2019-01-11 21:24:01,291 INFO L226 Difference]: Without dead ends: 1035 [2019-01-11 21:24:01,293 INFO L631 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-01-11 21:24:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-01-11 21:24:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-01-11 21:24:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-01-11 21:24:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1523 transitions. [2019-01-11 21:24:01,323 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1523 transitions. Word has length 204 [2019-01-11 21:24:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:01,323 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 1523 transitions. [2019-01-11 21:24:01,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1523 transitions. [2019-01-11 21:24:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-11 21:24:01,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:01,327 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-01-11 21:24:01,328 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:01,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:01,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1583018131, now seen corresponding path program 1 times [2019-01-11 21:24:01,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:01,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:01,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:01,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:01,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-01-11 21:24:01,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:01,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:01,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:01,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:01,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:01,424 INFO L87 Difference]: Start difference. First operand 1009 states and 1523 transitions. Second operand 3 states. [2019-01-11 21:24:01,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:01,935 INFO L93 Difference]: Finished difference Result 2019 states and 3045 transitions. [2019-01-11 21:24:01,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:01,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-01-11 21:24:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:01,945 INFO L225 Difference]: With dead ends: 2019 [2019-01-11 21:24:01,946 INFO L226 Difference]: Without dead ends: 1017 [2019-01-11 21:24:01,948 INFO L631 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-01-11 21:24:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-01-11 21:24:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1009. [2019-01-11 21:24:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-01-11 21:24:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1511 transitions. [2019-01-11 21:24:01,977 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1511 transitions. Word has length 216 [2019-01-11 21:24:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:01,979 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 1511 transitions. [2019-01-11 21:24:01,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1511 transitions. [2019-01-11 21:24:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-11 21:24:01,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:01,983 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-01-11 21:24:01,983 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:01,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1099234138, now seen corresponding path program 1 times [2019-01-11 21:24:01,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:01,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:01,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:01,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:01,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-01-11 21:24:02,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:02,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:02,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:02,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:02,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:02,112 INFO L87 Difference]: Start difference. First operand 1009 states and 1511 transitions. Second operand 3 states. [2019-01-11 21:24:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:02,346 INFO L93 Difference]: Finished difference Result 2019 states and 3021 transitions. [2019-01-11 21:24:02,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:02,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-01-11 21:24:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:02,353 INFO L225 Difference]: With dead ends: 2019 [2019-01-11 21:24:02,354 INFO L226 Difference]: Without dead ends: 999 [2019-01-11 21:24:02,356 INFO L631 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-01-11 21:24:02,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-01-11 21:24:02,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 991. [2019-01-11 21:24:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-01-11 21:24:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1473 transitions. [2019-01-11 21:24:02,387 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1473 transitions. Word has length 217 [2019-01-11 21:24:02,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:02,388 INFO L480 AbstractCegarLoop]: Abstraction has 991 states and 1473 transitions. [2019-01-11 21:24:02,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1473 transitions. [2019-01-11 21:24:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-01-11 21:24:02,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:02,392 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:02,393 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:02,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:02,395 INFO L82 PathProgramCache]: Analyzing trace with hash -30789295, now seen corresponding path program 1 times [2019-01-11 21:24:02,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:02,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:02,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:02,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:02,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-01-11 21:24:02,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:02,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:02,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:02,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:02,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:02,506 INFO L87 Difference]: Start difference. First operand 991 states and 1473 transitions. Second operand 3 states. [2019-01-11 21:24:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:03,515 INFO L93 Difference]: Finished difference Result 2029 states and 3019 transitions. [2019-01-11 21:24:03,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:03,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-01-11 21:24:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:03,520 INFO L225 Difference]: With dead ends: 2029 [2019-01-11 21:24:03,520 INFO L226 Difference]: Without dead ends: 1045 [2019-01-11 21:24:03,521 INFO L631 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-01-11 21:24:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-01-11 21:24:03,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1037. [2019-01-11 21:24:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-01-11 21:24:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1527 transitions. [2019-01-11 21:24:03,553 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1527 transitions. Word has length 224 [2019-01-11 21:24:03,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:03,553 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1527 transitions. [2019-01-11 21:24:03,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1527 transitions. [2019-01-11 21:24:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-11 21:24:03,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:03,557 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:03,558 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:03,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:03,558 INFO L82 PathProgramCache]: Analyzing trace with hash 812836165, now seen corresponding path program 1 times [2019-01-11 21:24:03,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:03,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:03,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:03,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:03,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-01-11 21:24:03,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:03,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:03,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:03,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:03,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:03,653 INFO L87 Difference]: Start difference. First operand 1037 states and 1527 transitions. Second operand 3 states. [2019-01-11 21:24:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:03,869 INFO L93 Difference]: Finished difference Result 2075 states and 3053 transitions. [2019-01-11 21:24:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:03,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-01-11 21:24:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:03,873 INFO L225 Difference]: With dead ends: 2075 [2019-01-11 21:24:03,873 INFO L226 Difference]: Without dead ends: 1037 [2019-01-11 21:24:03,875 INFO L631 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-01-11 21:24:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-01-11 21:24:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1029. [2019-01-11 21:24:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-01-11 21:24:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1495 transitions. [2019-01-11 21:24:03,905 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1495 transitions. Word has length 225 [2019-01-11 21:24:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:03,905 INFO L480 AbstractCegarLoop]: Abstraction has 1029 states and 1495 transitions. [2019-01-11 21:24:03,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1495 transitions. [2019-01-11 21:24:03,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-11 21:24:03,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:03,910 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:03,910 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:03,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:03,911 INFO L82 PathProgramCache]: Analyzing trace with hash 497301888, now seen corresponding path program 1 times [2019-01-11 21:24:03,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:03,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:03,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:03,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:03,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-01-11 21:24:04,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:04,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:24:04,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:04,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-01-11 21:24:04,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:24:04,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:24:04,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:24:04,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:24:04,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:04,515 INFO L87 Difference]: Start difference. First operand 1029 states and 1495 transitions. Second operand 5 states. [2019-01-11 21:24:07,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:07,636 INFO L93 Difference]: Finished difference Result 4090 states and 5918 transitions. [2019-01-11 21:24:07,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:24:07,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2019-01-11 21:24:07,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:07,652 INFO L225 Difference]: With dead ends: 4090 [2019-01-11 21:24:07,652 INFO L226 Difference]: Without dead ends: 3035 [2019-01-11 21:24:07,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:24:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2019-01-11 21:24:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 1740. [2019-01-11 21:24:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1740 states. [2019-01-11 21:24:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2496 transitions. [2019-01-11 21:24:07,734 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2496 transitions. Word has length 261 [2019-01-11 21:24:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:07,735 INFO L480 AbstractCegarLoop]: Abstraction has 1740 states and 2496 transitions. [2019-01-11 21:24:07,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:24:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2496 transitions. [2019-01-11 21:24:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-11 21:24:07,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:07,743 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-01-11 21:24:07,743 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:07,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1933393930, now seen corresponding path program 1 times [2019-01-11 21:24:07,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:07,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:07,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:07,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:07,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-01-11 21:24:07,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:07,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:07,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:07,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:07,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:07,926 INFO L87 Difference]: Start difference. First operand 1740 states and 2496 transitions. Second operand 3 states. [2019-01-11 21:24:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:08,172 INFO L93 Difference]: Finished difference Result 4813 states and 6857 transitions. [2019-01-11 21:24:08,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:08,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-01-11 21:24:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:08,188 INFO L225 Difference]: With dead ends: 4813 [2019-01-11 21:24:08,188 INFO L226 Difference]: Without dead ends: 3080 [2019-01-11 21:24:08,191 INFO L631 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-01-11 21:24:08,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3080 states. [2019-01-11 21:24:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3080 to 3078. [2019-01-11 21:24:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3078 states. [2019-01-11 21:24:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4362 transitions. [2019-01-11 21:24:08,317 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4362 transitions. Word has length 268 [2019-01-11 21:24:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:08,317 INFO L480 AbstractCegarLoop]: Abstraction has 3078 states and 4362 transitions. [2019-01-11 21:24:08,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4362 transitions. [2019-01-11 21:24:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-11 21:24:08,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:08,325 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-01-11 21:24:08,326 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:08,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:08,327 INFO L82 PathProgramCache]: Analyzing trace with hash -333999477, now seen corresponding path program 1 times [2019-01-11 21:24:08,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:08,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:08,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:08,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-01-11 21:24:08,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:08,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:08,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:08,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:08,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:08,462 INFO L87 Difference]: Start difference. First operand 3078 states and 4362 transitions. Second operand 3 states. [2019-01-11 21:24:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:08,916 INFO L93 Difference]: Finished difference Result 6269 states and 8893 transitions. [2019-01-11 21:24:08,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:08,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-01-11 21:24:08,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:08,925 INFO L225 Difference]: With dead ends: 6269 [2019-01-11 21:24:08,926 INFO L226 Difference]: Without dead ends: 1949 [2019-01-11 21:24:08,931 INFO L631 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-01-11 21:24:08,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2019-01-11 21:24:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1942. [2019-01-11 21:24:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-01-11 21:24:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-01-11 21:24:08,997 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 305 [2019-01-11 21:24:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:08,997 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-01-11 21:24:08,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-01-11 21:24:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-01-11 21:24:09,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:09,005 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2019-01-11 21:24:09,005 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash -722402039, now seen corresponding path program 1 times [2019-01-11 21:24:09,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:09,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:09,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:09,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:09,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-01-11 21:24:09,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:09,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:24:09,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:09,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-01-11 21:24:10,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:24:10,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:24:10,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:24:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:24:10,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:24:10,044 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 4 states. [2019-01-11 21:24:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:11,062 INFO L93 Difference]: Finished difference Result 4797 states and 6654 transitions. [2019-01-11 21:24:11,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:24:11,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2019-01-11 21:24:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:11,073 INFO L225 Difference]: With dead ends: 4797 [2019-01-11 21:24:11,073 INFO L226 Difference]: Without dead ends: 2724 [2019-01-11 21:24:11,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2019-01-11 21:24:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 1942. [2019-01-11 21:24:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-01-11 21:24:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-01-11 21:24:11,152 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 599 [2019-01-11 21:24:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:11,153 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-01-11 21:24:11,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:24:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-01-11 21:24:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-01-11 21:24:11,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:11,161 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 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, 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] [2019-01-11 21:24:11,161 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:11,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:11,164 INFO L82 PathProgramCache]: Analyzing trace with hash 914135564, now seen corresponding path program 1 times [2019-01-11 21:24:11,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:11,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:11,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:11,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:11,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-01-11 21:24:11,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:11,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:11,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:11,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:11,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:11,688 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 3 states. [2019-01-11 21:24:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:12,149 INFO L93 Difference]: Finished difference Result 3917 states and 5403 transitions. [2019-01-11 21:24:12,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:12,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 669 [2019-01-11 21:24:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:12,157 INFO L225 Difference]: With dead ends: 3917 [2019-01-11 21:24:12,157 INFO L226 Difference]: Without dead ends: 1982 [2019-01-11 21:24:12,160 INFO L631 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-01-11 21:24:12,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-01-11 21:24:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1942. [2019-01-11 21:24:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-01-11 21:24:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2663 transitions. [2019-01-11 21:24:12,221 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2663 transitions. Word has length 669 [2019-01-11 21:24:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:12,221 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 2663 transitions. [2019-01-11 21:24:12,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2663 transitions. [2019-01-11 21:24:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-01-11 21:24:12,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:12,229 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 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, 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] [2019-01-11 21:24:12,230 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash 551234930, now seen corresponding path program 1 times [2019-01-11 21:24:12,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:12,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:12,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:12,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:12,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-01-11 21:24:12,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:12,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:12,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:12,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:12,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:12,555 INFO L87 Difference]: Start difference. First operand 1942 states and 2663 transitions. Second operand 3 states. [2019-01-11 21:24:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:12,774 INFO L93 Difference]: Finished difference Result 3892 states and 5332 transitions. [2019-01-11 21:24:12,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:12,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2019-01-11 21:24:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:12,779 INFO L225 Difference]: With dead ends: 3892 [2019-01-11 21:24:12,779 INFO L226 Difference]: Without dead ends: 1957 [2019-01-11 21:24:12,782 INFO L631 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-01-11 21:24:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2019-01-11 21:24:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1929. [2019-01-11 21:24:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2019-01-11 21:24:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2604 transitions. [2019-01-11 21:24:12,843 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2604 transitions. Word has length 683 [2019-01-11 21:24:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:12,844 INFO L480 AbstractCegarLoop]: Abstraction has 1929 states and 2604 transitions. [2019-01-11 21:24:12,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2604 transitions. [2019-01-11 21:24:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-01-11 21:24:12,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:12,850 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 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] [2019-01-11 21:24:12,850 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:12,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1986025501, now seen corresponding path program 1 times [2019-01-11 21:24:12,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:12,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:12,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-01-11 21:24:13,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:13,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:13,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:13,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:13,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:13,166 INFO L87 Difference]: Start difference. First operand 1929 states and 2604 transitions. Second operand 3 states. [2019-01-11 21:24:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:13,380 INFO L93 Difference]: Finished difference Result 3921 states and 5296 transitions. [2019-01-11 21:24:13,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:13,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 711 [2019-01-11 21:24:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:13,386 INFO L225 Difference]: With dead ends: 3921 [2019-01-11 21:24:13,386 INFO L226 Difference]: Without dead ends: 1981 [2019-01-11 21:24:13,389 INFO L631 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-01-11 21:24:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-01-11 21:24:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-01-11 21:24:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-01-11 21:24:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2649 transitions. [2019-01-11 21:24:13,458 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2649 transitions. Word has length 711 [2019-01-11 21:24:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:13,459 INFO L480 AbstractCegarLoop]: Abstraction has 1971 states and 2649 transitions. [2019-01-11 21:24:13,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2649 transitions. [2019-01-11 21:24:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2019-01-11 21:24:13,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:13,468 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 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] [2019-01-11 21:24:13,468 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash -120199639, now seen corresponding path program 1 times [2019-01-11 21:24:13,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:13,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:13,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:13,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:13,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-01-11 21:24:14,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:14,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:14,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:14,036 INFO L87 Difference]: Start difference. First operand 1971 states and 2649 transitions. Second operand 3 states. [2019-01-11 21:24:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:14,569 INFO L93 Difference]: Finished difference Result 2519 states and 3369 transitions. [2019-01-11 21:24:14,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:14,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 726 [2019-01-11 21:24:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:14,571 INFO L225 Difference]: With dead ends: 2519 [2019-01-11 21:24:14,571 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:24:14,573 INFO L631 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-01-11 21:24:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:24:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:24:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:24:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:24:14,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 726 [2019-01-11 21:24:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:14,574 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:24:14,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:24:14,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:24:14,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:24:14,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:14,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:15,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:15,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:15,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:15,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:15,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:15,611 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 141 [2019-01-11 21:24:15,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:15,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:15,977 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 141 [2019-01-11 21:24:16,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:16,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:16,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:16,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:16,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:17,295 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2019-01-11 21:24:18,104 WARN L181 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-01-11 21:24:19,892 WARN L181 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-01-11 21:24:20,219 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-01-11 21:24:20,601 WARN L181 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-01-11 21:24:20,885 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-01-11 21:24:21,230 WARN L181 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-01-11 21:24:21,900 WARN L181 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-01-11 21:24:22,211 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-01-11 21:24:22,505 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-01-11 21:24:22,977 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2019-01-11 21:24:23,300 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 90 [2019-01-11 21:24:23,588 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-01-11 21:24:24,231 WARN L181 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 69 [2019-01-11 21:24:24,518 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-01-11 21:24:25,142 WARN L181 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 69 [2019-01-11 21:24:25,808 WARN L181 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-01-11 21:24:26,170 WARN L181 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2019-01-11 21:24:26,543 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-01-11 21:24:27,645 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2019-01-11 21:24:27,648 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 367) no Hoare annotation was computed. [2019-01-11 21:24:27,648 INFO L448 ceAbstractionStarter]: For program point L333-1(lines 333 367) no Hoare annotation was computed. [2019-01-11 21:24:27,649 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 545) no Hoare annotation was computed. [2019-01-11 21:24:27,649 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 556) no Hoare annotation was computed. [2019-01-11 21:24:27,649 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 567) no Hoare annotation was computed. [2019-01-11 21:24:27,649 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 578) no Hoare annotation was computed. [2019-01-11 21:24:27,649 INFO L451 ceAbstractionStarter]: At program point L598(lines 98 599) the Hoare annotation is: true [2019-01-11 21:24:27,649 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-01-11 21:24:27,650 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-01-11 21:24:27,650 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2019-01-11 21:24:27,650 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 364) no Hoare annotation was computed. [2019-01-11 21:24:27,650 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 546) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) [2019-01-11 21:24:27,651 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 578) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) [2019-01-11 21:24:27,651 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 544) no Hoare annotation was computed. [2019-01-11 21:24:27,651 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 555) no Hoare annotation was computed. [2019-01-11 21:24:27,651 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 566) no Hoare annotation was computed. [2019-01-11 21:24:27,651 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 577) no Hoare annotation was computed. [2019-01-11 21:24:27,652 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 311) no Hoare annotation was computed. [2019-01-11 21:24:27,652 INFO L448 ceAbstractionStarter]: For program point L304-2(lines 304 311) no Hoare annotation was computed. [2019-01-11 21:24:27,652 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 544) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:24:27,652 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 556) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse17 .cse18 .cse19 .cse20 .cse21) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2019-01-11 21:24:27,653 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 567) the Hoare annotation is: (let ((.cse0 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:27,653 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-01-11 21:24:27,653 INFO L448 ceAbstractionStarter]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-01-11 21:24:27,653 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-01-11 21:24:27,653 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 362) no Hoare annotation was computed. [2019-01-11 21:24:27,653 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 544) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:24:27,653 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 554) no Hoare annotation was computed. [2019-01-11 21:24:27,654 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 565) no Hoare annotation was computed. [2019-01-11 21:24:27,654 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 576) no Hoare annotation was computed. [2019-01-11 21:24:27,654 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-01-11 21:24:27,654 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 541) no Hoare annotation was computed. [2019-01-11 21:24:27,654 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2019-01-11 21:24:27,654 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-01-11 21:24:27,654 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 346) no Hoare annotation was computed. [2019-01-11 21:24:27,654 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 346) no Hoare annotation was computed. [2019-01-11 21:24:27,655 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-01-11 21:24:27,655 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 553) no Hoare annotation was computed. [2019-01-11 21:24:27,655 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 564) no Hoare annotation was computed. [2019-01-11 21:24:27,655 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 575) no Hoare annotation was computed. [2019-01-11 21:24:27,655 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2019-01-11 21:24:27,655 INFO L448 ceAbstractionStarter]: For program point L475-2(lines 208 541) no Hoare annotation was computed. [2019-01-11 21:24:27,655 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 408) no Hoare annotation was computed. [2019-01-11 21:24:27,655 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-01-11 21:24:27,656 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 577) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0)) (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:27,656 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 554) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:27,657 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 565) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2019-01-11 21:24:27,657 INFO L451 ceAbstractionStarter]: At program point L608(lines 11 610) the Hoare annotation is: true [2019-01-11 21:24:27,657 INFO L444 ceAbstractionStarter]: At program point L542(lines 99 597) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:24:27,657 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2019-01-11 21:24:27,657 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 383) no Hoare annotation was computed. [2019-01-11 21:24:27,657 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 552) no Hoare annotation was computed. [2019-01-11 21:24:27,657 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 563) no Hoare annotation was computed. [2019-01-11 21:24:27,658 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 574) no Hoare annotation was computed. [2019-01-11 21:24:27,658 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-01-11 21:24:27,658 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-01-11 21:24:27,658 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-01-11 21:24:27,658 INFO L444 ceAbstractionStarter]: At program point L513(lines 72 609) the Hoare annotation is: false [2019-01-11 21:24:27,658 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-01-11 21:24:27,658 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-01-11 21:24:27,658 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 551) no Hoare annotation was computed. [2019-01-11 21:24:27,659 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 562) no Hoare annotation was computed. [2019-01-11 21:24:27,659 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-01-11 21:24:27,659 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 573) no Hoare annotation was computed. [2019-01-11 21:24:27,659 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-01-11 21:24:27,659 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 485) no Hoare annotation was computed. [2019-01-11 21:24:27,659 INFO L448 ceAbstractionStarter]: For program point L481-2(lines 481 485) no Hoare annotation was computed. [2019-01-11 21:24:27,660 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 552) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse17 .cse18 .cse19 .cse20 .cse21) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2019-01-11 21:24:27,660 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 563) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-01-11 21:24:27,660 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-01-11 21:24:27,660 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-01-11 21:24:27,660 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-01-11 21:24:27,660 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-01-11 21:24:27,661 INFO L448 ceAbstractionStarter]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-01-11 21:24:27,661 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 358) no Hoare annotation was computed. [2019-01-11 21:24:27,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:24:27,661 INFO L444 ceAbstractionStarter]: At program point L351(lines 327 369) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-01-11 21:24:27,661 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 550) no Hoare annotation was computed. [2019-01-11 21:24:27,661 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 561) no Hoare annotation was computed. [2019-01-11 21:24:27,662 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 572) no Hoare annotation was computed. [2019-01-11 21:24:27,662 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-01-11 21:24:27,662 INFO L448 ceAbstractionStarter]: For program point L418(lines 418 420) no Hoare annotation was computed. [2019-01-11 21:24:27,662 INFO L444 ceAbstractionStarter]: At program point L385(lines 376 408) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2019-01-11 21:24:27,662 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 573) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:27,663 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 355) no Hoare annotation was computed. [2019-01-11 21:24:27,663 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-01-11 21:24:27,663 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-01-11 21:24:27,663 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 208 541) no Hoare annotation was computed. [2019-01-11 21:24:27,663 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-01-11 21:24:27,663 INFO L448 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-01-11 21:24:27,663 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 325) no Hoare annotation was computed. [2019-01-11 21:24:27,663 INFO L448 ceAbstractionStarter]: For program point L321-2(lines 208 541) no Hoare annotation was computed. [2019-01-11 21:24:27,663 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 549) no Hoare annotation was computed. [2019-01-11 21:24:27,664 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 560) no Hoare annotation was computed. [2019-01-11 21:24:27,664 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 571) no Hoare annotation was computed. [2019-01-11 21:24:27,664 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-01-11 21:24:27,664 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 609) no Hoare annotation was computed. [2019-01-11 21:24:27,664 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 406) no Hoare annotation was computed. [2019-01-11 21:24:27,664 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:24:27,664 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 550) the Hoare annotation is: (let ((.cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse3 .cse2 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2019-01-11 21:24:27,665 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 561) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2019-01-11 21:24:27,665 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 571) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) [2019-01-11 21:24:27,665 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-01-11 21:24:27,665 INFO L451 ceAbstractionStarter]: At program point L620(lines 611 622) the Hoare annotation is: true [2019-01-11 21:24:27,665 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-01-11 21:24:27,666 INFO L448 ceAbstractionStarter]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-01-11 21:24:27,666 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 548) no Hoare annotation was computed. [2019-01-11 21:24:27,666 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 559) no Hoare annotation was computed. [2019-01-11 21:24:27,666 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 570) no Hoare annotation was computed. [2019-01-11 21:24:27,666 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2019-01-11 21:24:27,666 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-01-11 21:24:27,666 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-01-11 21:24:27,666 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 541) no Hoare annotation was computed. [2019-01-11 21:24:27,666 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:24:27,667 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 494) no Hoare annotation was computed. [2019-01-11 21:24:27,667 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-01-11 21:24:27,667 INFO L448 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-01-11 21:24:27,667 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 426 434) no Hoare annotation was computed. [2019-01-11 21:24:27,667 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-01-11 21:24:27,667 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 547) no Hoare annotation was computed. [2019-01-11 21:24:27,667 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 558) no Hoare annotation was computed. [2019-01-11 21:24:27,667 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 569) no Hoare annotation was computed. [2019-01-11 21:24:27,668 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 548) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:27,668 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 559) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2019-01-11 21:24:27,668 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2019-01-11 21:24:27,668 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 368) no Hoare annotation was computed. [2019-01-11 21:24:27,668 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 546) no Hoare annotation was computed. [2019-01-11 21:24:27,668 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 557) no Hoare annotation was computed. [2019-01-11 21:24:27,669 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 568) no Hoare annotation was computed. [2019-01-11 21:24:27,669 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 597) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:24:27,669 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-01-11 21:24:27,669 INFO L448 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-01-11 21:24:27,669 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-01-11 21:24:27,669 INFO L448 ceAbstractionStarter]: For program point L496-2(lines 208 541) no Hoare annotation was computed. [2019-01-11 21:24:27,670 INFO L444 ceAbstractionStarter]: At program point L397(lines 388 406) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2019-01-11 21:24:27,670 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-01-11 21:24:27,670 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 557) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11 .cse12 .cse13) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:27,670 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 570) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:27,671 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-11 21:24:27,671 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-01-11 21:24:27,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:24:27 BoogieIcfgContainer [2019-01-11 21:24:27,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:24:27,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:24:27,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:24:27,723 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:24:27,723 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:44" (3/4) ... [2019-01-11 21:24:27,727 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:24:27,766 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:24:27,767 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:24:27,963 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:24:27,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:24:27,965 INFO L168 Benchmark]: Toolchain (without parser) took 45174.32 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 938.0 MB). Free memory was 948.7 MB in the beginning and 1.9 GB in the end (delta: -970.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-01-11 21:24:27,965 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:24:27,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.29 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:27,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:27,967 INFO L168 Benchmark]: Boogie Preprocessor took 47.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:24:27,968 INFO L168 Benchmark]: RCFGBuilder took 1274.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:27,968 INFO L168 Benchmark]: TraceAbstraction took 42938.56 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 775.4 MB). Free memory was 1.1 GB in the beginning and 798.2 MB in the end (delta: 265.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-01-11 21:24:27,968 INFO L168 Benchmark]: Witness Printer took 240.30 ms. Allocated memory was 1.9 GB in the beginning and 2.0 GB in the end (delta: 34.6 MB). Free memory was 798.2 MB in the beginning and 1.9 GB in the end (delta: -1.1 GB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:27,971 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 534.29 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1274.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42938.56 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 775.4 MB). Free memory was 1.1 GB in the beginning and 798.2 MB in the end (delta: 265.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 240.30 ms. Allocated memory was 1.9 GB in the beginning and 2.0 GB in the end (delta: 34.6 MB). Free memory was 798.2 MB in the beginning and 1.9 GB in the end (delta: -1.1 GB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: 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: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8576 == s__state)) && s__s3__tmp__next_state___0 <= 3) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || (((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8544 == s__state)) && !(8545 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(8609 == s__state) && !(8497 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8592 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((((((((((((((((((((((((blastFlag <= 2 && !(8609 == s__state)) && !(8497 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((s__state <= 8672 && 8448 <= s__state) && (((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (s__state <= 8448 && blastFlag <= 2 && !(8448 == s__state)) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || ((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672)) || s__state <= 3) || (blastFlag <= 3 && !(s__hit == 0))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((blastFlag <= 3 && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || ((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672)) || s__state <= 3) || (blastFlag <= 3 && !(s__hit == 0))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((s__state <= 8672 && 8448 <= s__state) && (((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. SAFE Result, 42.8s OverallTime, 35 OverallIterations, 25 TraceHistogramMax, 21.8s AutomataDifference, 0.0s DeadEndRemovalTime, 13.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5377 SDtfs, 5141 SDslu, 2062 SDs, 0 SdLazy, 3586 SolverSat, 1406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 949 GetRequests, 906 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3078occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 2330 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 217 NumberOfFragments, 2993 HoareAnnotationTreeSize, 28 FomulaSimplifications, 50067 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 28 FomulaSimplificationsInter, 8865 FormulaSimplificationTreeSizeReductionInter, 11.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 8605 NumberOfCodeBlocks, 8605 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 8568 ConstructedInterpolants, 0 QuantifiedInterpolants, 4199413 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1341 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 37 InterpolantComputations, 34 PerfectInterpolantSequences, 37743/37821 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...