./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_8_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_8_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 0e3531ca2da4bd0098c9a389bd0b7db6a2819ab0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:24:12,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:24:12,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:24:12,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:24:12,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:24:12,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:24:12,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:24:12,796 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:24:12,798 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:24:12,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:24:12,804 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:24:12,804 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:24:12,805 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:24:12,806 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:24:12,809 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:24:12,810 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:24:12,811 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:24:12,812 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:24:12,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:24:12,825 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:24:12,826 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:24:12,828 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:24:12,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:24:12,835 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:24:12,835 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:24:12,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:24:12,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:24:12,838 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:24:12,841 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:24:12,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:24:12,843 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:24:12,845 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:24:12,845 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:24:12,845 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:24:12,847 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:24:12,848 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:24:12,848 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:24:12,867 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:24:12,867 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:24:12,868 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:24:12,868 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:24:12,869 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:24:12,869 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:24:12,870 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:24:12,870 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:24:12,870 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:24:12,870 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:24:12,870 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:24:12,870 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:24:12,871 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:24:12,871 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:24:12,871 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:24:12,871 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:24:12,871 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:24:12,871 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:24:12,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:24:12,872 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:24:12,873 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:24:12,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:24:12,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:24:12,874 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:24:12,874 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:24:12,874 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:24:12,875 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:24:12,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:24:12,875 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 -> 0e3531ca2da4bd0098c9a389bd0b7db6a2819ab0 [2019-01-11 21:24:12,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:24:12,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:24:12,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:24:12,943 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:24:12,943 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:24:12,944 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_8_true-unreach-call_false-termination.cil.c [2019-01-11 21:24:12,994 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac067f5d6/45e341030a674b248e045f0720444c15/FLAGc4577391b [2019-01-11 21:24:13,468 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:24:13,469 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_8_true-unreach-call_false-termination.cil.c [2019-01-11 21:24:13,480 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac067f5d6/45e341030a674b248e045f0720444c15/FLAGc4577391b [2019-01-11 21:24:13,795 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac067f5d6/45e341030a674b248e045f0720444c15 [2019-01-11 21:24:13,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:24:13,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:24:13,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:24:13,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:24:13,805 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:24:13,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:24:13" (1/1) ... [2019-01-11 21:24:13,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0e8c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:13, skipping insertion in model container [2019-01-11 21:24:13,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:24:13" (1/1) ... [2019-01-11 21:24:13,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:24:13,879 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:24:14,174 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:24:14,181 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:24:14,269 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:24:14,284 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:24:14,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:14 WrapperNode [2019-01-11 21:24:14,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:24:14,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:24:14,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:24:14,290 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:24:14,365 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:24:14" (1/1) ... [2019-01-11 21:24:14,385 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:24:14" (1/1) ... [2019-01-11 21:24:14,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:24:14,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:24:14,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:24:14,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:24:14,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:14" (1/1) ... [2019-01-11 21:24:14,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:14" (1/1) ... [2019-01-11 21:24:14,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:14" (1/1) ... [2019-01-11 21:24:14,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:14" (1/1) ... [2019-01-11 21:24:14,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:14" (1/1) ... [2019-01-11 21:24:14,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:14" (1/1) ... [2019-01-11 21:24:14,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:14" (1/1) ... [2019-01-11 21:24:14,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:24:14,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:24:14,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:24:14,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:24:14,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:14" (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:24:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:24:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:24:14,650 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:24:15,789 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:24:15,790 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:24:15,791 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:24:15,791 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:24:15,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:24:15 BoogieIcfgContainer [2019-01-11 21:24:15,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:24:15,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:24:15,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:24:15,797 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:24:15,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:24:13" (1/3) ... [2019-01-11 21:24:15,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea61cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:24:15, skipping insertion in model container [2019-01-11 21:24:15,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:14" (2/3) ... [2019-01-11 21:24:15,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea61cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:24:15, skipping insertion in model container [2019-01-11 21:24:15,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:24:15" (3/3) ... [2019-01-11 21:24:15,800 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_8_true-unreach-call_false-termination.cil.c [2019-01-11 21:24:15,809 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:24:15,818 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:24:15,834 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:24:15,866 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:24:15,866 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:24:15,867 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:24:15,867 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:24:15,867 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:24:15,867 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:24:15,868 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:24:15,868 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:24:15,868 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:24:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-01-11 21:24:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-11 21:24:15,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:15,898 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] [2019-01-11 21:24:15,901 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:15,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:15,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707020, now seen corresponding path program 1 times [2019-01-11 21:24:15,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:15,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:15,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:15,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:15,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:16,238 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:24:16,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:16,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:16,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:16,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:16,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:16,263 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-01-11 21:24:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:17,018 INFO L93 Difference]: Finished difference Result 338 states and 585 transitions. [2019-01-11 21:24:17,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:17,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-01-11 21:24:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:17,033 INFO L225 Difference]: With dead ends: 338 [2019-01-11 21:24:17,033 INFO L226 Difference]: Without dead ends: 179 [2019-01-11 21:24:17,037 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:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-11 21:24:17,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2019-01-11 21:24:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-11 21:24:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 278 transitions. [2019-01-11 21:24:17,090 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 278 transitions. Word has length 41 [2019-01-11 21:24:17,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:17,091 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 278 transitions. [2019-01-11 21:24:17,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:17,091 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 278 transitions. [2019-01-11 21:24:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-11 21:24:17,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:17,094 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] [2019-01-11 21:24:17,094 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:17,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:17,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716333, now seen corresponding path program 1 times [2019-01-11 21:24:17,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:17,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:17,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:17,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:17,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:17,178 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:24:17,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:17,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:17,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:17,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:17,181 INFO L87 Difference]: Start difference. First operand 171 states and 278 transitions. Second operand 3 states. [2019-01-11 21:24:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:17,546 INFO L93 Difference]: Finished difference Result 382 states and 630 transitions. [2019-01-11 21:24:17,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:17,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-01-11 21:24:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:17,556 INFO L225 Difference]: With dead ends: 382 [2019-01-11 21:24:17,556 INFO L226 Difference]: Without dead ends: 218 [2019-01-11 21:24:17,558 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:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-01-11 21:24:17,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2019-01-11 21:24:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-11 21:24:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-01-11 21:24:17,588 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 42 [2019-01-11 21:24:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:17,589 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-01-11 21:24:17,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-01-11 21:24:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-11 21:24:17,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:17,596 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] [2019-01-11 21:24:17,597 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:17,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1839414983, now seen corresponding path program 1 times [2019-01-11 21:24:17,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:17,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:17,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:17,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:17,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:17,732 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:24:17,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:17,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:17,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:17,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:17,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:17,734 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-01-11 21:24:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:18,051 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-01-11 21:24:18,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:18,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-01-11 21:24:18,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:18,056 INFO L225 Difference]: With dead ends: 444 [2019-01-11 21:24:18,056 INFO L226 Difference]: Without dead ends: 241 [2019-01-11 21:24:18,059 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:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-11 21:24:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-01-11 21:24:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-11 21:24:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-01-11 21:24:18,076 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 69 [2019-01-11 21:24:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:18,077 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-01-11 21:24:18,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-01-11 21:24:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-11 21:24:18,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:18,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:18,080 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1554149248, now seen corresponding path program 1 times [2019-01-11 21:24:18,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:18,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:18,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:18,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:24:18,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:18,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:18,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:18,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:18,159 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-01-11 21:24:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:18,550 INFO L93 Difference]: Finished difference Result 513 states and 872 transitions. [2019-01-11 21:24:18,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:18,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-01-11 21:24:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:18,554 INFO L225 Difference]: With dead ends: 513 [2019-01-11 21:24:18,554 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 21:24:18,555 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:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 21:24:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-01-11 21:24:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-11 21:24:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 472 transitions. [2019-01-11 21:24:18,569 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 472 transitions. Word has length 74 [2019-01-11 21:24:18,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:18,570 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 472 transitions. [2019-01-11 21:24:18,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 472 transitions. [2019-01-11 21:24:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-11 21:24:18,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:18,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:18,572 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:18,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1571310151, now seen corresponding path program 1 times [2019-01-11 21:24:18,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:18,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:18,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:18,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:18,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:24:18,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:18,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:18,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:18,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:18,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:18,658 INFO L87 Difference]: Start difference. First operand 277 states and 472 transitions. Second operand 3 states. [2019-01-11 21:24:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:19,066 INFO L93 Difference]: Finished difference Result 549 states and 935 transitions. [2019-01-11 21:24:19,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:19,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-01-11 21:24:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:19,068 INFO L225 Difference]: With dead ends: 549 [2019-01-11 21:24:19,069 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 21:24:19,070 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:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 21:24:19,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-01-11 21:24:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-11 21:24:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 470 transitions. [2019-01-11 21:24:19,083 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 470 transitions. Word has length 75 [2019-01-11 21:24:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:19,084 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 470 transitions. [2019-01-11 21:24:19,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:19,084 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 470 transitions. [2019-01-11 21:24:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-11 21:24:19,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:19,089 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] [2019-01-11 21:24:19,089 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:19,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:19,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1779493469, now seen corresponding path program 1 times [2019-01-11 21:24:19,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:19,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:19,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:19,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:19,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:19,188 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:24:19,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:19,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:19,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:19,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:19,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:19,190 INFO L87 Difference]: Start difference. First operand 277 states and 470 transitions. Second operand 3 states. [2019-01-11 21:24:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:19,379 INFO L93 Difference]: Finished difference Result 564 states and 957 transitions. [2019-01-11 21:24:19,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:19,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-01-11 21:24:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:19,389 INFO L225 Difference]: With dead ends: 564 [2019-01-11 21:24:19,389 INFO L226 Difference]: Without dead ends: 294 [2019-01-11 21:24:19,391 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:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-11 21:24:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-01-11 21:24:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-11 21:24:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 492 transitions. [2019-01-11 21:24:19,405 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 492 transitions. Word has length 81 [2019-01-11 21:24:19,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:19,406 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 492 transitions. [2019-01-11 21:24:19,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 492 transitions. [2019-01-11 21:24:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-11 21:24:19,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:19,408 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] [2019-01-11 21:24:19,410 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash 685947497, now seen corresponding path program 1 times [2019-01-11 21:24:19,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:19,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:19,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:19,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:19,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:19,518 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:24:19,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:19,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:19,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:19,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:19,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:19,521 INFO L87 Difference]: Start difference. First operand 292 states and 492 transitions. Second operand 3 states. [2019-01-11 21:24:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:20,014 INFO L93 Difference]: Finished difference Result 579 states and 975 transitions. [2019-01-11 21:24:20,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:20,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-01-11 21:24:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:20,022 INFO L225 Difference]: With dead ends: 579 [2019-01-11 21:24:20,022 INFO L226 Difference]: Without dead ends: 294 [2019-01-11 21:24:20,023 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:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-11 21:24:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-01-11 21:24:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-11 21:24:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 488 transitions. [2019-01-11 21:24:20,040 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 488 transitions. Word has length 82 [2019-01-11 21:24:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:20,041 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 488 transitions. [2019-01-11 21:24:20,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 488 transitions. [2019-01-11 21:24:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-11 21:24:20,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:20,044 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] [2019-01-11 21:24:20,044 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:20,045 INFO L82 PathProgramCache]: Analyzing trace with hash -166367862, now seen corresponding path program 1 times [2019-01-11 21:24:20,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:20,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:20,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:20,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:20,152 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:24:20,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:20,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:20,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:20,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:20,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:20,156 INFO L87 Difference]: Start difference. First operand 292 states and 488 transitions. Second operand 3 states. [2019-01-11 21:24:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:20,663 INFO L93 Difference]: Finished difference Result 586 states and 977 transitions. [2019-01-11 21:24:20,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:20,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-01-11 21:24:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:20,668 INFO L225 Difference]: With dead ends: 586 [2019-01-11 21:24:20,668 INFO L226 Difference]: Without dead ends: 301 [2019-01-11 21:24:20,670 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:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-01-11 21:24:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-01-11 21:24:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-11 21:24:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 494 transitions. [2019-01-11 21:24:20,685 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 494 transitions. Word has length 94 [2019-01-11 21:24:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:20,687 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 494 transitions. [2019-01-11 21:24:20,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 494 transitions. [2019-01-11 21:24:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-11 21:24:20,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:20,690 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] [2019-01-11 21:24:20,691 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:20,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1087158848, now seen corresponding path program 1 times [2019-01-11 21:24:20,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:20,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:20,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:20,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:20,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:20,767 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:24:20,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:20,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:20,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:20,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:20,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:20,771 INFO L87 Difference]: Start difference. First operand 301 states and 494 transitions. Second operand 3 states. [2019-01-11 21:24:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:21,344 INFO L93 Difference]: Finished difference Result 626 states and 1030 transitions. [2019-01-11 21:24:21,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:21,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-01-11 21:24:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:21,346 INFO L225 Difference]: With dead ends: 626 [2019-01-11 21:24:21,346 INFO L226 Difference]: Without dead ends: 332 [2019-01-11 21:24:21,348 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:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-01-11 21:24:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-01-11 21:24:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-01-11 21:24:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 541 transitions. [2019-01-11 21:24:21,359 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 541 transitions. Word has length 95 [2019-01-11 21:24:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:21,359 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 541 transitions. [2019-01-11 21:24:21,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 541 transitions. [2019-01-11 21:24:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 21:24:21,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:21,361 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] [2019-01-11 21:24:21,361 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:21,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:21,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2088595028, now seen corresponding path program 1 times [2019-01-11 21:24:21,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:21,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:21,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:21,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:21,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:21,413 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:24:21,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:21,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:21,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:21,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:21,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:21,414 INFO L87 Difference]: Start difference. First operand 330 states and 541 transitions. Second operand 3 states. [2019-01-11 21:24:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:21,937 INFO L93 Difference]: Finished difference Result 655 states and 1073 transitions. [2019-01-11 21:24:21,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:21,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-11 21:24:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:21,941 INFO L225 Difference]: With dead ends: 655 [2019-01-11 21:24:21,941 INFO L226 Difference]: Without dead ends: 332 [2019-01-11 21:24:21,942 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:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-01-11 21:24:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-01-11 21:24:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-01-11 21:24:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 537 transitions. [2019-01-11 21:24:21,952 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 537 transitions. Word has length 96 [2019-01-11 21:24:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:21,953 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 537 transitions. [2019-01-11 21:24:21,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 537 transitions. [2019-01-11 21:24:21,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-11 21:24:21,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:21,955 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] [2019-01-11 21:24:21,955 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:21,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2096161680, now seen corresponding path program 1 times [2019-01-11 21:24:21,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:21,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:21,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:21,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:21,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:22,045 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:24:22,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:22,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:22,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:22,048 INFO L87 Difference]: Start difference. First operand 330 states and 537 transitions. Second operand 3 states. [2019-01-11 21:24:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:22,714 INFO L93 Difference]: Finished difference Result 688 states and 1123 transitions. [2019-01-11 21:24:22,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:22,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-11 21:24:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:22,717 INFO L225 Difference]: With dead ends: 688 [2019-01-11 21:24:22,717 INFO L226 Difference]: Without dead ends: 365 [2019-01-11 21:24:22,718 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:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-01-11 21:24:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2019-01-11 21:24:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-11 21:24:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 579 transitions. [2019-01-11 21:24:22,734 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 579 transitions. Word has length 97 [2019-01-11 21:24:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:22,734 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 579 transitions. [2019-01-11 21:24:22,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 579 transitions. [2019-01-11 21:24:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 21:24:22,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:22,736 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] [2019-01-11 21:24:22,737 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:22,737 INFO L82 PathProgramCache]: Analyzing trace with hash -297892004, now seen corresponding path program 1 times [2019-01-11 21:24:22,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:22,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:22,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:22,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:22,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:22,826 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:24:22,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:22,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:22,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:22,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:22,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:22,828 INFO L87 Difference]: Start difference. First operand 357 states and 579 transitions. Second operand 3 states. [2019-01-11 21:24:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:23,378 INFO L93 Difference]: Finished difference Result 715 states and 1160 transitions. [2019-01-11 21:24:23,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:23,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-11 21:24:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:23,381 INFO L225 Difference]: With dead ends: 715 [2019-01-11 21:24:23,381 INFO L226 Difference]: Without dead ends: 365 [2019-01-11 21:24:23,382 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:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-01-11 21:24:23,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2019-01-11 21:24:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-11 21:24:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 574 transitions. [2019-01-11 21:24:23,393 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 574 transitions. Word has length 98 [2019-01-11 21:24:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:23,393 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 574 transitions. [2019-01-11 21:24:23,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 574 transitions. [2019-01-11 21:24:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:24:23,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:23,395 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, 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:23,395 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:23,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash 386381809, now seen corresponding path program 1 times [2019-01-11 21:24:23,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:23,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:23,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-11 21:24:23,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:23,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:23,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:23,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:23,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:23,494 INFO L87 Difference]: Start difference. First operand 357 states and 574 transitions. Second operand 3 states. [2019-01-11 21:24:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:23,939 INFO L93 Difference]: Finished difference Result 743 states and 1195 transitions. [2019-01-11 21:24:23,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:23,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:24:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:23,944 INFO L225 Difference]: With dead ends: 743 [2019-01-11 21:24:23,944 INFO L226 Difference]: Without dead ends: 393 [2019-01-11 21:24:23,945 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:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-11 21:24:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2019-01-11 21:24:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-01-11 21:24:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 627 transitions. [2019-01-11 21:24:23,960 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 627 transitions. Word has length 105 [2019-01-11 21:24:23,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:23,960 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 627 transitions. [2019-01-11 21:24:23,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 627 transitions. [2019-01-11 21:24:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 21:24:23,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:23,962 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, 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:23,962 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:23,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1882644280, now seen corresponding path program 1 times [2019-01-11 21:24:23,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:23,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:23,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-11 21:24:24,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:24,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:24,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:24,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:24,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:24,058 INFO L87 Difference]: Start difference. First operand 391 states and 627 transitions. Second operand 3 states. [2019-01-11 21:24:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:24,800 INFO L93 Difference]: Finished difference Result 777 states and 1245 transitions. [2019-01-11 21:24:24,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:24,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-11 21:24:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:24,804 INFO L225 Difference]: With dead ends: 777 [2019-01-11 21:24:24,804 INFO L226 Difference]: Without dead ends: 393 [2019-01-11 21:24:24,805 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:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-11 21:24:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2019-01-11 21:24:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-01-11 21:24:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 624 transitions. [2019-01-11 21:24:24,816 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 624 transitions. Word has length 106 [2019-01-11 21:24:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:24,817 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 624 transitions. [2019-01-11 21:24:24,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 624 transitions. [2019-01-11 21:24:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-11 21:24:24,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:24,818 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, 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] [2019-01-11 21:24:24,818 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:24,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:24,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1260059449, now seen corresponding path program 1 times [2019-01-11 21:24:24,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:24,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:24,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:24,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:24,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:24:24,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:24,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:24,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:24,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:24,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:24,919 INFO L87 Difference]: Start difference. First operand 391 states and 624 transitions. Second operand 3 states. [2019-01-11 21:24:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:25,319 INFO L93 Difference]: Finished difference Result 822 states and 1311 transitions. [2019-01-11 21:24:25,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:25,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-01-11 21:24:25,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:25,322 INFO L225 Difference]: With dead ends: 822 [2019-01-11 21:24:25,322 INFO L226 Difference]: Without dead ends: 438 [2019-01-11 21:24:25,323 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:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-01-11 21:24:25,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 433. [2019-01-11 21:24:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-01-11 21:24:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 689 transitions. [2019-01-11 21:24:25,335 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 689 transitions. Word has length 111 [2019-01-11 21:24:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:25,335 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 689 transitions. [2019-01-11 21:24:25,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 689 transitions. [2019-01-11 21:24:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-11 21:24:25,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:25,337 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, 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:24:25,337 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1753706176, now seen corresponding path program 1 times [2019-01-11 21:24:25,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:25,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:25,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:25,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:24:25,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:25,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:25,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:25,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:25,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:25,417 INFO L87 Difference]: Start difference. First operand 433 states and 689 transitions. Second operand 3 states. [2019-01-11 21:24:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:25,685 INFO L93 Difference]: Finished difference Result 868 states and 1382 transitions. [2019-01-11 21:24:25,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:25,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-01-11 21:24:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:25,689 INFO L225 Difference]: With dead ends: 868 [2019-01-11 21:24:25,689 INFO L226 Difference]: Without dead ends: 440 [2019-01-11 21:24:25,690 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:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-01-11 21:24:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 435. [2019-01-11 21:24:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-01-11 21:24:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 692 transitions. [2019-01-11 21:24:25,704 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 692 transitions. Word has length 112 [2019-01-11 21:24:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:25,705 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 692 transitions. [2019-01-11 21:24:25,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 692 transitions. [2019-01-11 21:24:25,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-11 21:24:25,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:25,708 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:25,708 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:25,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:25,708 INFO L82 PathProgramCache]: Analyzing trace with hash 793971013, now seen corresponding path program 1 times [2019-01-11 21:24:25,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:25,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:25,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-11 21:24:25,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:25,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:25,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:25,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:25,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:25,765 INFO L87 Difference]: Start difference. First operand 435 states and 692 transitions. Second operand 3 states. [2019-01-11 21:24:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:25,920 INFO L93 Difference]: Finished difference Result 901 states and 1437 transitions. [2019-01-11 21:24:25,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:25,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-01-11 21:24:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:25,924 INFO L225 Difference]: With dead ends: 901 [2019-01-11 21:24:25,925 INFO L226 Difference]: Without dead ends: 473 [2019-01-11 21:24:25,926 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:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-11 21:24:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2019-01-11 21:24:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-01-11 21:24:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 727 transitions. [2019-01-11 21:24:25,939 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 727 transitions. Word has length 123 [2019-01-11 21:24:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:25,939 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 727 transitions. [2019-01-11 21:24:25,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 727 transitions. [2019-01-11 21:24:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-11 21:24:25,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:25,941 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:25,941 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:25,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2143195791, now seen corresponding path program 1 times [2019-01-11 21:24:25,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:25,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:25,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:25,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:25,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-11 21:24:26,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:26,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:26,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:26,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:26,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:26,018 INFO L87 Difference]: Start difference. First operand 460 states and 727 transitions. Second operand 3 states. [2019-01-11 21:24:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:26,457 INFO L93 Difference]: Finished difference Result 926 states and 1464 transitions. [2019-01-11 21:24:26,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:26,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-01-11 21:24:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:26,461 INFO L225 Difference]: With dead ends: 926 [2019-01-11 21:24:26,461 INFO L226 Difference]: Without dead ends: 473 [2019-01-11 21:24:26,462 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:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-11 21:24:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2019-01-11 21:24:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-01-11 21:24:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 719 transitions. [2019-01-11 21:24:26,475 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 719 transitions. Word has length 124 [2019-01-11 21:24:26,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:26,475 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 719 transitions. [2019-01-11 21:24:26,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 719 transitions. [2019-01-11 21:24:26,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-11 21:24:26,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:26,478 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, 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] [2019-01-11 21:24:26,478 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:26,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:26,480 INFO L82 PathProgramCache]: Analyzing trace with hash -418940064, now seen corresponding path program 1 times [2019-01-11 21:24:26,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:26,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:26,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:26,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:26,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-01-11 21:24:26,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:26,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:26,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:26,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:26,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:26,557 INFO L87 Difference]: Start difference. First operand 460 states and 719 transitions. Second operand 3 states. [2019-01-11 21:24:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:27,884 INFO L93 Difference]: Finished difference Result 917 states and 1432 transitions. [2019-01-11 21:24:27,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:27,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-01-11 21:24:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:27,889 INFO L225 Difference]: With dead ends: 917 [2019-01-11 21:24:27,889 INFO L226 Difference]: Without dead ends: 464 [2019-01-11 21:24:27,890 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:27,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-01-11 21:24:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2019-01-11 21:24:27,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-01-11 21:24:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 714 transitions. [2019-01-11 21:24:27,904 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 714 transitions. Word has length 136 [2019-01-11 21:24:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:27,905 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 714 transitions. [2019-01-11 21:24:27,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 714 transitions. [2019-01-11 21:24:27,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-11 21:24:27,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:27,907 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, 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] [2019-01-11 21:24:27,907 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:27,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:27,907 INFO L82 PathProgramCache]: Analyzing trace with hash 307186329, now seen corresponding path program 1 times [2019-01-11 21:24:27,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:27,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:27,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:27,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:27,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-01-11 21:24:27,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:27,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:27,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:27,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:27,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:27,992 INFO L87 Difference]: Start difference. First operand 460 states and 714 transitions. Second operand 3 states. [2019-01-11 21:24:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:28,233 INFO L93 Difference]: Finished difference Result 917 states and 1422 transitions. [2019-01-11 21:24:28,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:28,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-01-11 21:24:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:28,237 INFO L225 Difference]: With dead ends: 917 [2019-01-11 21:24:28,237 INFO L226 Difference]: Without dead ends: 464 [2019-01-11 21:24:28,238 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:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-01-11 21:24:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2019-01-11 21:24:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-01-11 21:24:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 709 transitions. [2019-01-11 21:24:28,251 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 709 transitions. Word has length 137 [2019-01-11 21:24:28,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:28,251 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 709 transitions. [2019-01-11 21:24:28,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 709 transitions. [2019-01-11 21:24:28,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-11 21:24:28,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:28,255 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:28,256 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:28,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:28,256 INFO L82 PathProgramCache]: Analyzing trace with hash 791534820, now seen corresponding path program 1 times [2019-01-11 21:24:28,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:28,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:28,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:28,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:28,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-01-11 21:24:28,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:28,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:28,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:28,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:28,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:28,366 INFO L87 Difference]: Start difference. First operand 460 states and 709 transitions. Second operand 3 states. [2019-01-11 21:24:28,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:28,583 INFO L93 Difference]: Finished difference Result 941 states and 1452 transitions. [2019-01-11 21:24:28,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:28,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-01-11 21:24:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:28,588 INFO L225 Difference]: With dead ends: 941 [2019-01-11 21:24:28,588 INFO L226 Difference]: Without dead ends: 488 [2019-01-11 21:24:28,589 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:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-01-11 21:24:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2019-01-11 21:24:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-01-11 21:24:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 740 transitions. [2019-01-11 21:24:28,607 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 740 transitions. Word has length 144 [2019-01-11 21:24:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:28,608 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 740 transitions. [2019-01-11 21:24:28,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 740 transitions. [2019-01-11 21:24:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-11 21:24:28,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:28,611 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:28,612 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:28,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:28,612 INFO L82 PathProgramCache]: Analyzing trace with hash -335636264, now seen corresponding path program 1 times [2019-01-11 21:24:28,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:28,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:28,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:28,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:28,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-01-11 21:24:28,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:28,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:28,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:28,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:28,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:28,705 INFO L87 Difference]: Start difference. First operand 484 states and 740 transitions. Second operand 3 states. [2019-01-11 21:24:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:28,852 INFO L93 Difference]: Finished difference Result 965 states and 1474 transitions. [2019-01-11 21:24:28,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:28,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-01-11 21:24:28,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:28,857 INFO L225 Difference]: With dead ends: 965 [2019-01-11 21:24:28,857 INFO L226 Difference]: Without dead ends: 488 [2019-01-11 21:24:28,858 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:28,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-01-11 21:24:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2019-01-11 21:24:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-01-11 21:24:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 731 transitions. [2019-01-11 21:24:28,871 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 731 transitions. Word has length 145 [2019-01-11 21:24:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:28,871 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 731 transitions. [2019-01-11 21:24:28,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 731 transitions. [2019-01-11 21:24:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-11 21:24:28,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:28,874 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, 3, 3, 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] [2019-01-11 21:24:28,875 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:28,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:28,875 INFO L82 PathProgramCache]: Analyzing trace with hash -122343295, now seen corresponding path program 1 times [2019-01-11 21:24:28,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:28,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:28,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:28,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:28,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-01-11 21:24:28,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:28,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:28,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:28,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:28,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:28,968 INFO L87 Difference]: Start difference. First operand 484 states and 731 transitions. Second operand 3 states. [2019-01-11 21:24:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:29,272 INFO L93 Difference]: Finished difference Result 1008 states and 1517 transitions. [2019-01-11 21:24:29,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:29,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-01-11 21:24:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:29,277 INFO L225 Difference]: With dead ends: 1008 [2019-01-11 21:24:29,277 INFO L226 Difference]: Without dead ends: 531 [2019-01-11 21:24:29,278 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:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-01-11 21:24:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 525. [2019-01-11 21:24:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-01-11 21:24:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 786 transitions. [2019-01-11 21:24:29,292 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 786 transitions. Word has length 151 [2019-01-11 21:24:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:29,292 INFO L480 AbstractCegarLoop]: Abstraction has 525 states and 786 transitions. [2019-01-11 21:24:29,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 786 transitions. [2019-01-11 21:24:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-11 21:24:29,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:29,297 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, 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, 1] [2019-01-11 21:24:29,297 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:29,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1907415640, now seen corresponding path program 1 times [2019-01-11 21:24:29,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:29,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:29,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-01-11 21:24:29,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:29,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:29,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:29,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:29,395 INFO L87 Difference]: Start difference. First operand 525 states and 786 transitions. Second operand 3 states. [2019-01-11 21:24:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:30,414 INFO L93 Difference]: Finished difference Result 1049 states and 1570 transitions. [2019-01-11 21:24:30,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:30,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-01-11 21:24:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:30,418 INFO L225 Difference]: With dead ends: 1049 [2019-01-11 21:24:30,418 INFO L226 Difference]: Without dead ends: 512 [2019-01-11 21:24:30,419 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:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-01-11 21:24:30,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2019-01-11 21:24:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-01-11 21:24:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 756 transitions. [2019-01-11 21:24:30,435 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 756 transitions. Word has length 152 [2019-01-11 21:24:30,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:30,436 INFO L480 AbstractCegarLoop]: Abstraction has 506 states and 756 transitions. [2019-01-11 21:24:30,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:30,436 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 756 transitions. [2019-01-11 21:24:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-11 21:24:30,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:30,437 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:30,438 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:30,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:30,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1249588557, now seen corresponding path program 1 times [2019-01-11 21:24:30,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:30,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:30,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:30,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:30,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-01-11 21:24:30,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:30,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:30,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:30,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:30,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:30,528 INFO L87 Difference]: Start difference. First operand 506 states and 756 transitions. Second operand 3 states. [2019-01-11 21:24:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:31,719 INFO L93 Difference]: Finished difference Result 1030 states and 1542 transitions. [2019-01-11 21:24:31,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:31,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-01-11 21:24:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:31,723 INFO L225 Difference]: With dead ends: 1030 [2019-01-11 21:24:31,723 INFO L226 Difference]: Without dead ends: 531 [2019-01-11 21:24:31,724 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:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-01-11 21:24:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2019-01-11 21:24:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-01-11 21:24:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 780 transitions. [2019-01-11 21:24:31,738 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 780 transitions. Word has length 165 [2019-01-11 21:24:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:31,739 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 780 transitions. [2019-01-11 21:24:31,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 780 transitions. [2019-01-11 21:24:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-11 21:24:31,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:31,742 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:31,743 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:31,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:31,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1409544545, now seen corresponding path program 1 times [2019-01-11 21:24:31,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:31,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:31,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-01-11 21:24:31,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:31,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:24:31,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:31,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:31,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:31,826 INFO L87 Difference]: Start difference. First operand 527 states and 780 transitions. Second operand 3 states. [2019-01-11 21:24:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:32,354 INFO L93 Difference]: Finished difference Result 1051 states and 1555 transitions. [2019-01-11 21:24:32,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:32,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-01-11 21:24:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:32,358 INFO L225 Difference]: With dead ends: 1051 [2019-01-11 21:24:32,358 INFO L226 Difference]: Without dead ends: 529 [2019-01-11 21:24:32,359 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:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-01-11 21:24:32,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 525. [2019-01-11 21:24:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-01-11 21:24:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 766 transitions. [2019-01-11 21:24:32,371 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 766 transitions. Word has length 166 [2019-01-11 21:24:32,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:32,371 INFO L480 AbstractCegarLoop]: Abstraction has 525 states and 766 transitions. [2019-01-11 21:24:32,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 766 transitions. [2019-01-11 21:24:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-11 21:24:32,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:32,375 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:32,375 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:32,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:32,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1453747987, now seen corresponding path program 1 times [2019-01-11 21:24:32,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:32,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:32,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-01-11 21:24:32,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:32,557 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:32,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:32,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-01-11 21:24:32,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:24:32,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:24:32,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:24:32,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:24:32,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:32,940 INFO L87 Difference]: Start difference. First operand 525 states and 766 transitions. Second operand 5 states. [2019-01-11 21:24:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:36,656 INFO L93 Difference]: Finished difference Result 2591 states and 3766 transitions. [2019-01-11 21:24:36,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:24:36,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-01-11 21:24:36,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:36,669 INFO L225 Difference]: With dead ends: 2591 [2019-01-11 21:24:36,669 INFO L226 Difference]: Without dead ends: 2051 [2019-01-11 21:24:36,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:24:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2019-01-11 21:24:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1175. [2019-01-11 21:24:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2019-01-11 21:24:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1686 transitions. [2019-01-11 21:24:36,722 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1686 transitions. Word has length 181 [2019-01-11 21:24:36,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:36,724 INFO L480 AbstractCegarLoop]: Abstraction has 1175 states and 1686 transitions. [2019-01-11 21:24:36,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:24:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1686 transitions. [2019-01-11 21:24:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-11 21:24:36,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:36,728 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-01-11 21:24:36,729 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:36,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:36,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1355676108, now seen corresponding path program 1 times [2019-01-11 21:24:36,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:36,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:36,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-11 21:24:36,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:36,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:36,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:36,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:36,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:36,849 INFO L87 Difference]: Start difference. First operand 1175 states and 1686 transitions. Second operand 3 states. [2019-01-11 21:24:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:37,382 INFO L93 Difference]: Finished difference Result 2920 states and 4193 transitions. [2019-01-11 21:24:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:37,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-01-11 21:24:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:37,392 INFO L225 Difference]: With dead ends: 2920 [2019-01-11 21:24:37,392 INFO L226 Difference]: Without dead ends: 1752 [2019-01-11 21:24:37,394 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:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-01-11 21:24:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2019-01-11 21:24:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-01-11 21:24:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2509 transitions. [2019-01-11 21:24:37,457 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2509 transitions. Word has length 188 [2019-01-11 21:24:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:37,459 INFO L480 AbstractCegarLoop]: Abstraction has 1752 states and 2509 transitions. [2019-01-11 21:24:37,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2509 transitions. [2019-01-11 21:24:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-01-11 21:24:37,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:37,467 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-01-11 21:24:37,468 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:37,468 INFO L82 PathProgramCache]: Analyzing trace with hash -373781024, now seen corresponding path program 1 times [2019-01-11 21:24:37,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:37,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:37,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:37,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:37,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-11 21:24:37,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:37,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:37,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:37,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:37,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:37,591 INFO L87 Difference]: Start difference. First operand 1752 states and 2509 transitions. Second operand 3 states. [2019-01-11 21:24:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:38,158 INFO L93 Difference]: Finished difference Result 3972 states and 5676 transitions. [2019-01-11 21:24:38,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:38,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-01-11 21:24:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:38,174 INFO L225 Difference]: With dead ends: 3972 [2019-01-11 21:24:38,174 INFO L226 Difference]: Without dead ends: 2227 [2019-01-11 21:24:38,177 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:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2019-01-11 21:24:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2227. [2019-01-11 21:24:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2227 states. [2019-01-11 21:24:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 3169 transitions. [2019-01-11 21:24:38,290 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 3169 transitions. Word has length 189 [2019-01-11 21:24:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:38,291 INFO L480 AbstractCegarLoop]: Abstraction has 2227 states and 3169 transitions. [2019-01-11 21:24:38,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:38,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 3169 transitions. [2019-01-11 21:24:38,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-01-11 21:24:38,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:38,302 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1] [2019-01-11 21:24:38,303 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:38,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:38,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1948421128, now seen corresponding path program 1 times [2019-01-11 21:24:38,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:38,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:38,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-01-11 21:24:38,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:38,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:38,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:38,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:38,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:38,568 INFO L87 Difference]: Start difference. First operand 2227 states and 3169 transitions. Second operand 3 states. [2019-01-11 21:24:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:38,815 INFO L93 Difference]: Finished difference Result 5858 states and 8299 transitions. [2019-01-11 21:24:38,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:38,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-01-11 21:24:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:38,832 INFO L225 Difference]: With dead ends: 5858 [2019-01-11 21:24:38,833 INFO L226 Difference]: Without dead ends: 3638 [2019-01-11 21:24:38,836 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:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2019-01-11 21:24:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 3636. [2019-01-11 21:24:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3636 states. [2019-01-11 21:24:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5131 transitions. [2019-01-11 21:24:38,966 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5131 transitions. Word has length 338 [2019-01-11 21:24:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:38,966 INFO L480 AbstractCegarLoop]: Abstraction has 3636 states and 5131 transitions. [2019-01-11 21:24:38,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5131 transitions. [2019-01-11 21:24:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-01-11 21:24:38,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:38,974 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 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, 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:38,975 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:38,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:38,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1969862083, now seen corresponding path program 1 times [2019-01-11 21:24:38,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:38,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:38,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:38,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:38,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-01-11 21:24:39,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:39,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:39,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:39,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:39,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:39,165 INFO L87 Difference]: Start difference. First operand 3636 states and 5131 transitions. Second operand 3 states. [2019-01-11 21:24:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:39,916 INFO L93 Difference]: Finished difference Result 7425 states and 10491 transitions. [2019-01-11 21:24:39,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:39,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-01-11 21:24:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:39,928 INFO L225 Difference]: With dead ends: 7425 [2019-01-11 21:24:39,928 INFO L226 Difference]: Without dead ends: 2367 [2019-01-11 21:24:39,934 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:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-01-11 21:24:40,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2019-01-11 21:24:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-01-11 21:24:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 3265 transitions. [2019-01-11 21:24:40,016 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 3265 transitions. Word has length 375 [2019-01-11 21:24:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:40,017 INFO L480 AbstractCegarLoop]: Abstraction has 2367 states and 3265 transitions. [2019-01-11 21:24:40,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 3265 transitions. [2019-01-11 21:24:40,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2019-01-11 21:24:40,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:40,026 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 13, 11, 11, 9, 9, 7, 7, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:40,027 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1778796496, now seen corresponding path program 1 times [2019-01-11 21:24:40,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:40,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:40,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:40,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:40,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5011 backedges. 3000 proven. 26 refuted. 0 times theorem prover too weak. 1985 trivial. 0 not checked. [2019-01-11 21:24:40,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:24:40,695 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:40,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:40,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:24:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5011 backedges. 1432 proven. 0 refuted. 0 times theorem prover too weak. 3579 trivial. 0 not checked. [2019-01-11 21:24:41,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:24:41,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:24:41,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:24:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:24:41,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:24:41,926 INFO L87 Difference]: Start difference. First operand 2367 states and 3265 transitions. Second operand 5 states. [2019-01-11 21:24:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:43,439 INFO L93 Difference]: Finished difference Result 5000 states and 6924 transitions. [2019-01-11 21:24:43,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:24:43,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 671 [2019-01-11 21:24:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:43,455 INFO L225 Difference]: With dead ends: 5000 [2019-01-11 21:24:43,456 INFO L226 Difference]: Without dead ends: 2502 [2019-01-11 21:24:43,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 673 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:24:43,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-01-11 21:24:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1814. [2019-01-11 21:24:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1814 states. [2019-01-11 21:24:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2487 transitions. [2019-01-11 21:24:43,528 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2487 transitions. Word has length 671 [2019-01-11 21:24:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:43,529 INFO L480 AbstractCegarLoop]: Abstraction has 1814 states and 2487 transitions. [2019-01-11 21:24:43,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:24:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2487 transitions. [2019-01-11 21:24:43,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2019-01-11 21:24:43,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:43,560 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 29, 29, 29, 26, 26, 23, 23, 20, 20, 17, 17, 17, 17, 14, 11, 11, 8, 8, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:24:43,561 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:43,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:43,562 INFO L82 PathProgramCache]: Analyzing trace with hash -37279638, now seen corresponding path program 1 times [2019-01-11 21:24:43,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:43,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:43,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:43,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:43,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10073 backedges. 5192 proven. 0 refuted. 0 times theorem prover too weak. 4881 trivial. 0 not checked. [2019-01-11 21:24:44,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:44,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:44,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:44,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:44,487 INFO L87 Difference]: Start difference. First operand 1814 states and 2487 transitions. Second operand 3 states. [2019-01-11 21:24:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:45,353 INFO L93 Difference]: Finished difference Result 3721 states and 5098 transitions. [2019-01-11 21:24:45,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:45,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 906 [2019-01-11 21:24:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:45,369 INFO L225 Difference]: With dead ends: 3721 [2019-01-11 21:24:45,371 INFO L226 Difference]: Without dead ends: 1896 [2019-01-11 21:24:45,374 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:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-11 21:24:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1856. [2019-01-11 21:24:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2019-01-11 21:24:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2535 transitions. [2019-01-11 21:24:45,444 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2535 transitions. Word has length 906 [2019-01-11 21:24:45,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:45,445 INFO L480 AbstractCegarLoop]: Abstraction has 1856 states and 2535 transitions. [2019-01-11 21:24:45,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2535 transitions. [2019-01-11 21:24:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2019-01-11 21:24:45,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:45,458 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 29, 29, 29, 26, 26, 23, 23, 20, 20, 17, 17, 17, 17, 14, 11, 11, 8, 8, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:24:45,458 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:45,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:45,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1785751454, now seen corresponding path program 1 times [2019-01-11 21:24:45,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:45,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:45,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10295 backedges. 5167 proven. 0 refuted. 0 times theorem prover too weak. 5128 trivial. 0 not checked. [2019-01-11 21:24:46,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:46,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:46,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:46,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:46,309 INFO L87 Difference]: Start difference. First operand 1856 states and 2535 transitions. Second operand 3 states. [2019-01-11 21:24:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:47,337 INFO L93 Difference]: Finished difference Result 2856 states and 3888 transitions. [2019-01-11 21:24:47,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:47,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 921 [2019-01-11 21:24:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:47,339 INFO L225 Difference]: With dead ends: 2856 [2019-01-11 21:24:47,339 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:24:47,343 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:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:24:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:24:47,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:24:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:24:47,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 921 [2019-01-11 21:24:47,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:47,344 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:24:47,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:24:47,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:24:47,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:24:47,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:47,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:47,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:47,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:47,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,020 WARN L181 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 165 [2019-01-11 21:24:48,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,917 WARN L181 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 165 [2019-01-11 21:24:48,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:48,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:49,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:49,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:49,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:24:50,936 WARN L181 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2019-01-11 21:24:52,709 WARN L181 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 101 DAG size of output: 65 [2019-01-11 21:24:54,535 WARN L181 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2019-01-11 21:24:55,580 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-01-11 21:24:56,973 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2019-01-11 21:24:57,498 WARN L181 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-01-11 21:24:58,207 WARN L181 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2019-01-11 21:24:59,080 WARN L181 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2019-01-11 21:24:59,572 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-01-11 21:25:00,300 WARN L181 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2019-01-11 21:25:00,807 WARN L181 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-01-11 21:25:01,313 WARN L181 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-01-11 21:25:01,514 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-01-11 21:25:02,291 WARN L181 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2019-01-11 21:25:04,854 WARN L181 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2019-01-11 21:25:05,352 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-01-11 21:25:05,931 WARN L181 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2019-01-11 21:25:07,268 WARN L181 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2019-01-11 21:25:08,103 WARN L181 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2019-01-11 21:25:08,644 WARN L181 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-01-11 21:25:09,140 WARN L181 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-01-11 21:25:10,000 WARN L181 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2019-01-11 21:25:10,004 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 537) no Hoare annotation was computed. [2019-01-11 21:25:10,004 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 367) no Hoare annotation was computed. [2019-01-11 21:25:10,004 INFO L448 ceAbstractionStarter]: For program point L333-1(lines 333 367) no Hoare annotation was computed. [2019-01-11 21:25:10,004 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 569) no Hoare annotation was computed. [2019-01-11 21:25:10,005 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 580) no Hoare annotation was computed. [2019-01-11 21:25:10,005 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 591) no Hoare annotation was computed. [2019-01-11 21:25:10,005 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 602) no Hoare annotation was computed. [2019-01-11 21:25:10,005 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 502) no Hoare annotation was computed. [2019-01-11 21:25:10,005 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-01-11 21:25:10,005 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2019-01-11 21:25:10,005 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 364) no Hoare annotation was computed. [2019-01-11 21:25:10,006 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 570) the Hoare annotation is: (let ((.cse6 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse25 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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 (= 8593 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))) (.cse7 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 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 (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse27))) [2019-01-11 21:25:10,007 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 602) 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 (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (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 .cse22 .cse23 .cse24 .cse25))) [2019-01-11 21:25:10,007 INFO L451 ceAbstractionStarter]: At program point L632(lines 11 634) the Hoare annotation is: true [2019-01-11 21:25:10,008 INFO L444 ceAbstractionStarter]: At program point L566(lines 99 621) the Hoare annotation is: (let ((.cse6 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse20 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse14 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (and (and .cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse21 .cse1) (and .cse2 .cse3 .cse4 .cse5 (not (= 8640 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)) .cse7 .cse8 .cse9 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse12 .cse13 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse1) (and .cse22 .cse20 .cse23 .cse14) (and .cse0 .cse22 .cse23))) [2019-01-11 21:25:10,008 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 536) no Hoare annotation was computed. [2019-01-11 21:25:10,008 INFO L448 ceAbstractionStarter]: For program point L534-2(lines 208 565) no Hoare annotation was computed. [2019-01-11 21:25:10,008 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 568) no Hoare annotation was computed. [2019-01-11 21:25:10,009 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 579) no Hoare annotation was computed. [2019-01-11 21:25:10,009 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 590) no Hoare annotation was computed. [2019-01-11 21:25:10,009 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 601) no Hoare annotation was computed. [2019-01-11 21:25:10,009 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 311) no Hoare annotation was computed. [2019-01-11 21:25:10,009 INFO L448 ceAbstractionStarter]: For program point L304-2(lines 304 311) no Hoare annotation was computed. [2019-01-11 21:25:10,009 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 568) the Hoare annotation is: (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:25:10,009 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 580) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse21 .cse22 .cse23 .cse24 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)))) [2019-01-11 21:25:10,010 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 591) the Hoare annotation is: (let ((.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))) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16) (and .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16)))) [2019-01-11 21:25:10,010 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 619) no Hoare annotation was computed. [2019-01-11 21:25:10,010 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 514) no Hoare annotation was computed. [2019-01-11 21:25:10,010 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 362) no Hoare annotation was computed. [2019-01-11 21:25:10,010 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 568) the Hoare annotation is: (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:25:10,010 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 578) no Hoare annotation was computed. [2019-01-11 21:25:10,010 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 589) no Hoare annotation was computed. [2019-01-11 21:25:10,010 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 600) no Hoare annotation was computed. [2019-01-11 21:25:10,011 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 618) no Hoare annotation was computed. [2019-01-11 21:25:10,011 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-01-11 21:25:10,011 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 565) no Hoare annotation was computed. [2019-01-11 21:25:10,011 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 610) no Hoare annotation was computed. [2019-01-11 21:25:10,011 INFO L448 ceAbstractionStarter]: For program point L605-2(lines 604 618) no Hoare annotation was computed. [2019-01-11 21:25:10,011 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2019-01-11 21:25:10,011 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-01-11 21:25:10,011 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 513) no Hoare annotation was computed. [2019-01-11 21:25:10,011 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 346) no Hoare annotation was computed. [2019-01-11 21:25:10,011 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 346) no Hoare annotation was computed. [2019-01-11 21:25:10,011 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-01-11 21:25:10,011 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 577) no Hoare annotation was computed. [2019-01-11 21:25:10,012 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 588) no Hoare annotation was computed. [2019-01-11 21:25:10,012 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 599) no Hoare annotation was computed. [2019-01-11 21:25:10,012 INFO L448 ceAbstractionStarter]: For program point L607(lines 607 609) no Hoare annotation was computed. [2019-01-11 21:25:10,012 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 485) no Hoare annotation was computed. [2019-01-11 21:25:10,012 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 408) no Hoare annotation was computed. [2019-01-11 21:25:10,012 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-01-11 21:25:10,012 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 601) the Hoare annotation is: (let ((.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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 (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse27 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)))) [2019-01-11 21:25:10,013 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 578) the Hoare annotation is: (let ((.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse25 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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))) (.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 (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse20 .cse21 .cse22 .cse23 .cse24 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26))) [2019-01-11 21:25:10,013 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 589) the Hoare annotation is: (let ((.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse15 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 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 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse13) (and .cse0 .cse1 .cse2 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse3))) [2019-01-11 21:25:10,013 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2019-01-11 21:25:10,013 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 383) no Hoare annotation was computed. [2019-01-11 21:25:10,013 INFO L448 ceAbstractionStarter]: For program point L543(lines 543 547) no Hoare annotation was computed. [2019-01-11 21:25:10,013 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2019-01-11 21:25:10,013 INFO L448 ceAbstractionStarter]: For program point L543-2(lines 543 547) no Hoare annotation was computed. [2019-01-11 21:25:10,013 INFO L448 ceAbstractionStarter]: For program point L510-2(lines 208 565) no Hoare annotation was computed. [2019-01-11 21:25:10,013 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 576) no Hoare annotation was computed. [2019-01-11 21:25:10,014 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 587) no Hoare annotation was computed. [2019-01-11 21:25:10,014 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 598) no Hoare annotation was computed. [2019-01-11 21:25:10,014 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 484) no Hoare annotation was computed. [2019-01-11 21:25:10,014 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 208 565) no Hoare annotation was computed. [2019-01-11 21:25:10,014 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-01-11 21:25:10,014 INFO L451 ceAbstractionStarter]: At program point L644(lines 635 646) the Hoare annotation is: true [2019-01-11 21:25:10,014 INFO L448 ceAbstractionStarter]: For program point L612(lines 612 616) no Hoare annotation was computed. [2019-01-11 21:25:10,014 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-01-11 21:25:10,014 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-01-11 21:25:10,014 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 575) no Hoare annotation was computed. [2019-01-11 21:25:10,014 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 586) no Hoare annotation was computed. [2019-01-11 21:25:10,015 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-01-11 21:25:10,015 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 597) no Hoare annotation was computed. [2019-01-11 21:25:10,015 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 483) no Hoare annotation was computed. [2019-01-11 21:25:10,015 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 576) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8497 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse25 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse21 .cse22 .cse23 .cse24 .cse25 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)))) [2019-01-11 21:25:10,015 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 587) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8576 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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse14))) [2019-01-11 21:25:10,015 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-01-11 21:25:10,016 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-01-11 21:25:10,016 INFO L444 ceAbstractionStarter]: At program point L482(lines 72 633) the Hoare annotation is: false [2019-01-11 21:25:10,016 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 358) no Hoare annotation was computed. [2019-01-11 21:25:10,016 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:25:10,016 INFO L444 ceAbstractionStarter]: At program point L351(lines 327 369) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8576 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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse14))) [2019-01-11 21:25:10,016 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 574) no Hoare annotation was computed. [2019-01-11 21:25:10,016 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 585) no Hoare annotation was computed. [2019-01-11 21:25:10,016 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 596) no Hoare annotation was computed. [2019-01-11 21:25:10,016 INFO L448 ceAbstractionStarter]: For program point L418(lines 418 420) no Hoare annotation was computed. [2019-01-11 21:25:10,017 INFO L444 ceAbstractionStarter]: At program point L385(lines 376 408) the Hoare annotation is: (let ((.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 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 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse13))) [2019-01-11 21:25:10,017 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 597) the Hoare annotation is: (let ((.cse14 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.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))) (.cse15 (<= 8448 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 .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse12))) [2019-01-11 21:25:10,017 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 355) no Hoare annotation was computed. [2019-01-11 21:25:10,017 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-01-11 21:25:10,017 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-01-11 21:25:10,017 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 208 565) no Hoare annotation was computed. [2019-01-11 21:25:10,017 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 325) no Hoare annotation was computed. [2019-01-11 21:25:10,017 INFO L448 ceAbstractionStarter]: For program point L321-2(lines 208 565) no Hoare annotation was computed. [2019-01-11 21:25:10,018 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 573) no Hoare annotation was computed. [2019-01-11 21:25:10,018 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 584) no Hoare annotation was computed. [2019-01-11 21:25:10,018 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 595) no Hoare annotation was computed. [2019-01-11 21:25:10,018 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-01-11 21:25:10,018 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 633) no Hoare annotation was computed. [2019-01-11 21:25:10,018 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 559) no Hoare annotation was computed. [2019-01-11 21:25:10,018 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 523) no Hoare annotation was computed. [2019-01-11 21:25:10,018 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 553 559) no Hoare annotation was computed. [2019-01-11 21:25:10,018 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 406) no Hoare annotation was computed. [2019-01-11 21:25:10,018 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:25:10,019 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 574) the Hoare annotation is: (let ((.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8657 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))) (.cse26 (<= 8448 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 (= 8673 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 (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse20 .cse21 .cse22 .cse23 .cse24 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) [2019-01-11 21:25:10,019 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 585) the Hoare annotation is: (let ((.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 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 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse13))) [2019-01-11 21:25:10,019 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 595) 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:25:10,019 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-01-11 21:25:10,019 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-01-11 21:25:10,019 INFO L448 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-01-11 21:25:10,019 INFO L448 ceAbstractionStarter]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2019-01-11 21:25:10,019 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 572) no Hoare annotation was computed. [2019-01-11 21:25:10,019 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 583) no Hoare annotation was computed. [2019-01-11 21:25:10,020 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 594) no Hoare annotation was computed. [2019-01-11 21:25:10,020 INFO L451 ceAbstractionStarter]: At program point L622(lines 98 623) the Hoare annotation is: true [2019-01-11 21:25:10,020 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2019-01-11 21:25:10,020 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2019-01-11 21:25:10,020 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-01-11 21:25:10,020 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-01-11 21:25:10,020 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 565) no Hoare annotation was computed. [2019-01-11 21:25:10,020 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:25:10,020 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-01-11 21:25:10,020 INFO L448 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-01-11 21:25:10,020 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 426 434) no Hoare annotation was computed. [2019-01-11 21:25:10,020 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-01-11 21:25:10,021 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 571) no Hoare annotation was computed. [2019-01-11 21:25:10,021 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 582) no Hoare annotation was computed. [2019-01-11 21:25:10,021 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 593) no Hoare annotation was computed. [2019-01-11 21:25:10,021 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 572) the Hoare annotation is: (let ((.cse27 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse25 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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 (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8592 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 (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse24) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) [2019-01-11 21:25:10,021 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 583) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8529 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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse14))) [2019-01-11 21:25:10,022 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 631) no Hoare annotation was computed. [2019-01-11 21:25:10,022 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 629) no Hoare annotation was computed. [2019-01-11 21:25:10,022 INFO L448 ceAbstractionStarter]: For program point L627-2(lines 627 629) no Hoare annotation was computed. [2019-01-11 21:25:10,022 INFO L448 ceAbstractionStarter]: For program point L528(lines 528 538) no Hoare annotation was computed. [2019-01-11 21:25:10,022 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2019-01-11 21:25:10,022 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 368) no Hoare annotation was computed. [2019-01-11 21:25:10,022 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 570) no Hoare annotation was computed. [2019-01-11 21:25:10,022 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 581) no Hoare annotation was computed. [2019-01-11 21:25:10,022 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 592) no Hoare annotation was computed. [2019-01-11 21:25:10,023 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 621) the Hoare annotation is: (let ((.cse6 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse20 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse14 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (and (and .cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse21 .cse1) (and .cse2 .cse3 .cse4 .cse5 (not (= 8640 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)) .cse7 .cse8 .cse9 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse12 .cse13 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse1) (and .cse22 .cse20 .cse23 .cse14) (and .cse0 .cse22 .cse23))) [2019-01-11 21:25:10,023 INFO L444 ceAbstractionStarter]: At program point L397(lines 388 406) the Hoare annotation is: (let ((.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 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 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse13))) [2019-01-11 21:25:10,030 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-01-11 21:25:10,031 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 581) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse4 .cse0 .cse1 .cse3) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse15 .cse16 .cse17 .cse18) (and .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2019-01-11 21:25:10,031 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 594) the Hoare annotation is: (let ((.cse15 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) [2019-01-11 21:25:10,032 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-11 21:25:10,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:25:10 BoogieIcfgContainer [2019-01-11 21:25:10,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:25:10,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:25:10,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:25:10,160 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:25:10,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:24:15" (3/4) ... [2019-01-11 21:25:10,167 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:25:10,224 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:25:10,225 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:25:10,419 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:25:10,422 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:25:10,423 INFO L168 Benchmark]: Toolchain (without parser) took 56623.58 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 950.0 MB in the beginning and 1.8 GB in the end (delta: -815.1 MB). Peak memory consumption was 291.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:10,423 INFO L168 Benchmark]: CDTParser took 0.16 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:25:10,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 488.05 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 932.6 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:10,424 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:10,427 INFO L168 Benchmark]: Boogie Preprocessor took 58.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:25:10,427 INFO L168 Benchmark]: RCFGBuilder took 1305.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:10,430 INFO L168 Benchmark]: TraceAbstraction took 54365.70 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 986.2 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -753.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-11 21:25:10,431 INFO L168 Benchmark]: Witness Printer took 262.16 ms. Allocated memory is still 2.1 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:10,435 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.16 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 488.05 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 932.6 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 139.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1305.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.8 MB). Peak memory consumption was 64.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 54365.70 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 986.2 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -753.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 262.16 ms. Allocated memory is still 2.1 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 631]: 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: (((((((((((((((((((!(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)) && blastFlag == 3) && s__state <= 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)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((((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) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(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))) || ((((((((((((((((blastFlag <= 2 && !(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)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((8448 <= s__state && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 3) || (((((((((((((((blastFlag <= 2 && !(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)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || (((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)) && 0 == s__hit) && !(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) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(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: 72]: Loop Invariant Derived loop invariant: 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: ((((((((((((((((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) && !(s__hit == 0)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(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))) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= 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)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__hit == 0)) || ((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3)) || s__state <= 3) || (((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state))) || (((blastFlag == 4 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (blastFlag == 4 && !(s__hit == 0))) || ((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == 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)) && blastFlag == 3) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 3) && s__state <= 8576) && 0 == s__hit)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((((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) && !(s__hit == 0)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(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))) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= 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)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == 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)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && blastFlag == 4) && !(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))) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == 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)) && !(12292 == s__state)) && !(8608 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3)) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == 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)) && !(12292 == s__state)) && !(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)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= 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)) && blastFlag == 3) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= 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))) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == 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)) && blastFlag == 3) && !(s__hit == 0))) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == 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))) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == 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)) && blastFlag == 4) && !(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: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((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) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(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))) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(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))) || (((((((((((((((!(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)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= 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)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((((((((((((((((((((((((!(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)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && blastFlag == 4) && !(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))) || (((((((((((((((((((((((((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)) && !(8673 == 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)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0))) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= 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)) && !(12292 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8640 == s__state) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((((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) && !(s__hit == 0)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(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))) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= 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)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(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))) || ((((((((((((((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) && !(s__hit == 0))) || ((((((((((((((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) && 8448 <= s__state) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(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)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && blastFlag == 4) && !(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)) || ((((((((((((((((((((((((((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)) && !(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: ((((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= 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)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= 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))) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == 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)) && !(8656 == s__state)) && blastFlag == 4) && !(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 && !(8497 == s__state)) && !(8609 == 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)) && !(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: 105]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(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)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && blastFlag == 4) && !(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)) || ((((((((((((((((((((((((((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)) && !(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))) || ((((((((((((((((((((((((((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)) && !(8673 == 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))) || ((((((((((((((((((((((((((!(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)) && !(8673 == 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)) && blastFlag == 3) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((((((((((((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) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(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))) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(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))) || (((((((((((((((!(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)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(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) && 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)) && blastFlag == 3) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((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)) && blastFlag == 3) && s__state <= 8576)) || ((((((((((((((blastFlag <= 2 && !(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))) || ((((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(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 && !(s__hit == 0)) || ((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3)) || s__state <= 3) || (((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state))) || (((blastFlag == 4 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (blastFlag == 4 && !(s__hit == 0))) || ((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == 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)) && blastFlag == 3) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 3) && s__state <= 8576) && 0 == s__hit)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(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)) && !(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)) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= 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))) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(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)) && !(8656 == s__state)) && blastFlag == 4) && !(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))) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == 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)) && !(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)) && 0 == s__hit) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8640 == s__state) - InvariantResult [Line: 159]: 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)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((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) && !(s__hit == 0))) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(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))) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && blastFlag == 4) && !(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)) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= 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)) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(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))) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(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)) && blastFlag == 4) && !(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)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(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)) && blastFlag == 3) && !(s__hit == 0))) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= 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))) || (((((((((((((((((((((((((!(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)) && !(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)) && blastFlag == 3)) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(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, 146 locations, 1 error locations. SAFE Result, 54.1s OverallTime, 34 OverallIterations, 33 TraceHistogramMax, 22.7s AutomataDifference, 0.0s DeadEndRemovalTime, 22.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 5960 SDtfs, 5473 SDslu, 2362 SDs, 0 SdLazy, 3455 SolverSat, 1364 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 896 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3636occurred in iteration=30, 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: 0.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 1726 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 278 NumberOfFragments, 6789 HoareAnnotationTreeSize, 28 FomulaSimplifications, 68259 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 28 FomulaSimplificationsInter, 11297 FormulaSimplificationTreeSizeReductionInter, 20.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 7442 NumberOfCodeBlocks, 7442 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 7406 ConstructedInterpolants, 0 QuantifiedInterpolants, 4654246 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1332 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 36 InterpolantComputations, 34 PerfectInterpolantSequences, 36814/36866 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...