./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1_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_1_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 bb8d19eba9f796d5d2cd9125ad944b1aceff9e2d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:23:27,683 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:23:27,684 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:23:27,695 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:23:27,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:23:27,697 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:23:27,698 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:23:27,701 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:23:27,706 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:23:27,707 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:23:27,710 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:23:27,710 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:23:27,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:23:27,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:23:27,714 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:23:27,715 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:23:27,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:23:27,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:23:27,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:23:27,732 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:23:27,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:23:27,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:23:27,740 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:23:27,740 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:23:27,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:23:27,743 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:23:27,744 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:23:27,745 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:23:27,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:23:27,749 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:23:27,749 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:23:27,750 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:23:27,750 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:23:27,750 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:23:27,753 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:23:27,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:23:27,754 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:23:27,783 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:23:27,783 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:23:27,784 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:23:27,784 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:23:27,785 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:23:27,785 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:23:27,785 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:23:27,785 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:23:27,785 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:23:27,785 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:23:27,786 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:23:27,786 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:23:27,786 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:23:27,787 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:23:27,787 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:23:27,787 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:23:27,787 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:23:27,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:23:27,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:23:27,788 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:23:27,788 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:23:27,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:23:27,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:23:27,788 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:23:27,789 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:23:27,790 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:23:27,790 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:23:27,790 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:23:27,790 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 -> bb8d19eba9f796d5d2cd9125ad944b1aceff9e2d [2019-01-11 21:23:27,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:23:27,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:23:27,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:23:27,862 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:23:27,862 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:23:27,863 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1_true-unreach-call_false-termination.cil.c [2019-01-11 21:23:27,917 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00458038/6931e1a98b824ca48d735f19216f64e7/FLAG537885962 [2019-01-11 21:23:28,383 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:23:28,384 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1_true-unreach-call_false-termination.cil.c [2019-01-11 21:23:28,396 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00458038/6931e1a98b824ca48d735f19216f64e7/FLAG537885962 [2019-01-11 21:23:28,696 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00458038/6931e1a98b824ca48d735f19216f64e7 [2019-01-11 21:23:28,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:23:28,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:23:28,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:23:28,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:23:28,706 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:23:28,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:23:28" (1/1) ... [2019-01-11 21:23:28,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0eeec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:28, skipping insertion in model container [2019-01-11 21:23:28,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:23:28" (1/1) ... [2019-01-11 21:23:28,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:23:28,774 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:23:29,049 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:23:29,053 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:23:29,115 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:23:29,134 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:23:29,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:29 WrapperNode [2019-01-11 21:23:29,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:23:29,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:23:29,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:23:29,137 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:23:29,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:29" (1/1) ... [2019-01-11 21:23:29,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:29" (1/1) ... [2019-01-11 21:23:29,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:23:29,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:23:29,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:23:29,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:23:29,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:29" (1/1) ... [2019-01-11 21:23:29,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:29" (1/1) ... [2019-01-11 21:23:29,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:29" (1/1) ... [2019-01-11 21:23:29,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:29" (1/1) ... [2019-01-11 21:23:29,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:29" (1/1) ... [2019-01-11 21:23:29,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:29" (1/1) ... [2019-01-11 21:23:29,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:29" (1/1) ... [2019-01-11 21:23:29,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:23:29,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:23:29,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:23:29,308 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:23:29,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:23:29,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:23:29,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:23:29,490 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:23:30,547 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:23:30,548 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:23:30,549 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:23:30,549 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-11 21:23:30,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:30 BoogieIcfgContainer [2019-01-11 21:23:30,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:23:30,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:23:30,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:23:30,554 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:23:30,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:23:28" (1/3) ... [2019-01-11 21:23:30,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363d31cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:23:30, skipping insertion in model container [2019-01-11 21:23:30,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:23:29" (2/3) ... [2019-01-11 21:23:30,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363d31cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:23:30, skipping insertion in model container [2019-01-11 21:23:30,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:30" (3/3) ... [2019-01-11 21:23:30,557 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1_true-unreach-call_false-termination.cil.c [2019-01-11 21:23:30,564 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:23:30,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:23:30,585 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:23:30,615 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:23:30,616 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:23:30,616 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:23:30,616 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:23:30,616 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:23:30,616 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:23:30,616 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:23:30,617 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:23:30,617 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:23:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-01-11 21:23:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 21:23:30,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:30,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:30,647 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:30,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126418, now seen corresponding path program 1 times [2019-01-11 21:23:30,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:30,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:30,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:30,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:30,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:30,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:30,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:30,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:30,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:30,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:30,939 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2019-01-11 21:23:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:31,692 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-01-11 21:23:31,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:31,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-11 21:23:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:31,720 INFO L225 Difference]: With dead ends: 332 [2019-01-11 21:23:31,720 INFO L226 Difference]: Without dead ends: 177 [2019-01-11 21:23:31,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:31,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-11 21:23:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2019-01-11 21:23:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-11 21:23:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2019-01-11 21:23:31,779 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2019-01-11 21:23:31,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:31,780 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2019-01-11 21:23:31,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2019-01-11 21:23:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-11 21:23:31,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:31,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:31,783 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:31,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:31,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296619, now seen corresponding path program 1 times [2019-01-11 21:23:31,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:31,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:31,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:31,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:31,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:31,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:31,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:31,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:31,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:31,925 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2019-01-11 21:23:32,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:32,347 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2019-01-11 21:23:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:32,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-01-11 21:23:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:32,355 INFO L225 Difference]: With dead ends: 384 [2019-01-11 21:23:32,355 INFO L226 Difference]: Without dead ends: 218 [2019-01-11 21:23:32,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-01-11 21:23:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2019-01-11 21:23:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-11 21:23:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2019-01-11 21:23:32,378 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2019-01-11 21:23:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:32,379 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2019-01-11 21:23:32,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2019-01-11 21:23:32,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-11 21:23:32,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:32,383 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:32,384 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:32,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:32,385 INFO L82 PathProgramCache]: Analyzing trace with hash -128378241, now seen corresponding path program 1 times [2019-01-11 21:23:32,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:32,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:32,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:32,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:32,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:32,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:32,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:32,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:32,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:32,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:32,496 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2019-01-11 21:23:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:32,854 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2019-01-11 21:23:32,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:32,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-11 21:23:32,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:32,858 INFO L225 Difference]: With dead ends: 448 [2019-01-11 21:23:32,858 INFO L226 Difference]: Without dead ends: 243 [2019-01-11 21:23:32,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-11 21:23:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-01-11 21:23:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-11 21:23:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2019-01-11 21:23:32,884 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2019-01-11 21:23:32,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:32,885 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2019-01-11 21:23:32,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2019-01-11 21:23:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:23:32,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:32,889 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:32,889 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:32,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:32,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1989171317, now seen corresponding path program 1 times [2019-01-11 21:23:32,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:32,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:32,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:32,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:32,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:32,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:32,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:32,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:32,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:32,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:32,988 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2019-01-11 21:23:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:33,303 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2019-01-11 21:23:33,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:33,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:23:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:33,309 INFO L225 Difference]: With dead ends: 525 [2019-01-11 21:23:33,309 INFO L226 Difference]: Without dead ends: 289 [2019-01-11 21:23:33,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-11 21:23:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-01-11 21:23:33,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-11 21:23:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2019-01-11 21:23:33,326 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2019-01-11 21:23:33,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:33,326 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2019-01-11 21:23:33,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2019-01-11 21:23:33,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-11 21:23:33,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:33,330 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:33,330 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:33,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:33,330 INFO L82 PathProgramCache]: Analyzing trace with hash -575477867, now seen corresponding path program 1 times [2019-01-11 21:23:33,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:33,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:33,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:33,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:33,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:33,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:33,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:33,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:33,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:33,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:33,405 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2019-01-11 21:23:33,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:33,618 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2019-01-11 21:23:33,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:33,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-01-11 21:23:33,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:33,621 INFO L225 Difference]: With dead ends: 580 [2019-01-11 21:23:33,621 INFO L226 Difference]: Without dead ends: 302 [2019-01-11 21:23:33,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-11 21:23:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-01-11 21:23:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-11 21:23:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2019-01-11 21:23:33,641 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2019-01-11 21:23:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:33,643 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2019-01-11 21:23:33,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2019-01-11 21:23:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-11 21:23:33,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:33,646 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:33,647 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:33,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1339419474, now seen corresponding path program 1 times [2019-01-11 21:23:33,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:33,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:33,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:33,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:33,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:33,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:33,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:33,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:33,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:33,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:33,746 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2019-01-11 21:23:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:34,322 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2019-01-11 21:23:34,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:34,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-01-11 21:23:34,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:34,325 INFO L225 Difference]: With dead ends: 597 [2019-01-11 21:23:34,326 INFO L226 Difference]: Without dead ends: 302 [2019-01-11 21:23:34,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-11 21:23:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-01-11 21:23:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-11 21:23:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2019-01-11 21:23:34,337 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2019-01-11 21:23:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:34,338 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2019-01-11 21:23:34,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2019-01-11 21:23:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 21:23:34,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:34,339 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:34,340 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:34,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:34,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1069928865, now seen corresponding path program 1 times [2019-01-11 21:23:34,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:34,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:34,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:34,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:34,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:34,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:34,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:34,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:34,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:34,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:34,422 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2019-01-11 21:23:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:34,979 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2019-01-11 21:23:34,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:34,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-01-11 21:23:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:34,985 INFO L225 Difference]: With dead ends: 591 [2019-01-11 21:23:34,986 INFO L226 Difference]: Without dead ends: 300 [2019-01-11 21:23:34,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-11 21:23:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-01-11 21:23:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-11 21:23:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-01-11 21:23:35,004 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2019-01-11 21:23:35,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:35,004 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-01-11 21:23:35,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-01-11 21:23:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 21:23:35,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:35,006 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:35,006 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:35,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:35,006 INFO L82 PathProgramCache]: Analyzing trace with hash 608007676, now seen corresponding path program 1 times [2019-01-11 21:23:35,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:35,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:35,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-01-11 21:23:35,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:35,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:35,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:35,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:35,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:35,101 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2019-01-11 21:23:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:35,433 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2019-01-11 21:23:35,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:35,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-11 21:23:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:35,438 INFO L225 Difference]: With dead ends: 598 [2019-01-11 21:23:35,438 INFO L226 Difference]: Without dead ends: 307 [2019-01-11 21:23:35,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-01-11 21:23:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-01-11 21:23:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-01-11 21:23:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2019-01-11 21:23:35,454 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2019-01-11 21:23:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:35,455 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2019-01-11 21:23:35,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2019-01-11 21:23:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 21:23:35,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:35,460 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:35,460 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:35,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:35,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1349389816, now seen corresponding path program 1 times [2019-01-11 21:23:35,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:35,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:35,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:35,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:35,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:35,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:35,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:35,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:35,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:35,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:35,555 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2019-01-11 21:23:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:36,427 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2019-01-11 21:23:36,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:36,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-11 21:23:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:36,434 INFO L225 Difference]: With dead ends: 638 [2019-01-11 21:23:36,434 INFO L226 Difference]: Without dead ends: 338 [2019-01-11 21:23:36,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-11 21:23:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-01-11 21:23:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-11 21:23:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2019-01-11 21:23:36,452 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2019-01-11 21:23:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:36,452 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2019-01-11 21:23:36,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2019-01-11 21:23:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 21:23:36,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:36,455 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:36,455 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:36,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash 206720868, now seen corresponding path program 1 times [2019-01-11 21:23:36,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:36,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:36,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:36,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:36,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:36,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:36,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:36,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:36,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:36,545 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2019-01-11 21:23:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:37,109 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2019-01-11 21:23:37,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:37,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-11 21:23:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:37,111 INFO L225 Difference]: With dead ends: 667 [2019-01-11 21:23:37,111 INFO L226 Difference]: Without dead ends: 338 [2019-01-11 21:23:37,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:37,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-11 21:23:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-01-11 21:23:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-11 21:23:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-01-11 21:23:37,123 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2019-01-11 21:23:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:37,123 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-01-11 21:23:37,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-01-11 21:23:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-11 21:23:37,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:37,125 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:37,125 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:37,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:37,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1011601848, now seen corresponding path program 1 times [2019-01-11 21:23:37,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:37,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:37,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:37,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:37,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:37,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:37,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:37,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:37,187 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2019-01-11 21:23:37,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:37,830 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2019-01-11 21:23:37,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:37,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-11 21:23:37,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:37,835 INFO L225 Difference]: With dead ends: 700 [2019-01-11 21:23:37,835 INFO L226 Difference]: Without dead ends: 371 [2019-01-11 21:23:37,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-01-11 21:23:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-01-11 21:23:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-01-11 21:23:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2019-01-11 21:23:37,851 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2019-01-11 21:23:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:37,852 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2019-01-11 21:23:37,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2019-01-11 21:23:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-11 21:23:37,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:37,853 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:37,854 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:37,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash -894235628, now seen corresponding path program 1 times [2019-01-11 21:23:37,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:37,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:37,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:37,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:37,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:37,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:37,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:37,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:37,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:37,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:37,935 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2019-01-11 21:23:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:38,358 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2019-01-11 21:23:38,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:38,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-01-11 21:23:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:38,362 INFO L225 Difference]: With dead ends: 727 [2019-01-11 21:23:38,362 INFO L226 Difference]: Without dead ends: 371 [2019-01-11 21:23:38,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-01-11 21:23:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-01-11 21:23:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-01-11 21:23:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2019-01-11 21:23:38,376 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2019-01-11 21:23:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:38,376 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2019-01-11 21:23:38,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2019-01-11 21:23:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:23:38,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:38,380 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:38,380 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1360340166, now seen corresponding path program 1 times [2019-01-11 21:23:38,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:38,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:38,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:38,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:38,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:38,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:38,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:38,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:38,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:38,480 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2019-01-11 21:23:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:39,262 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2019-01-11 21:23:39,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:39,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:23:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:39,264 INFO L225 Difference]: With dead ends: 744 [2019-01-11 21:23:39,265 INFO L226 Difference]: Without dead ends: 388 [2019-01-11 21:23:39,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-11 21:23:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-01-11 21:23:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-01-11 21:23:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2019-01-11 21:23:39,282 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2019-01-11 21:23:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:39,282 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2019-01-11 21:23:39,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2019-01-11 21:23:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 21:23:39,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:39,285 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:39,286 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:39,286 INFO L82 PathProgramCache]: Analyzing trace with hash -241831246, now seen corresponding path program 1 times [2019-01-11 21:23:39,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:39,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:39,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:39,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:39,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:39,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:39,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:39,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:39,375 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2019-01-11 21:23:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:39,830 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2019-01-11 21:23:39,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:39,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-11 21:23:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:39,834 INFO L225 Difference]: With dead ends: 765 [2019-01-11 21:23:39,834 INFO L226 Difference]: Without dead ends: 388 [2019-01-11 21:23:39,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-11 21:23:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-01-11 21:23:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-01-11 21:23:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2019-01-11 21:23:39,847 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2019-01-11 21:23:39,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:39,847 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2019-01-11 21:23:39,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2019-01-11 21:23:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 21:23:39,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:39,851 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:39,851 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:39,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1868043870, now seen corresponding path program 1 times [2019-01-11 21:23:39,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:39,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:39,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-11 21:23:39,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:39,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:39,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:39,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:39,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:39,946 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2019-01-11 21:23:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:40,090 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2019-01-11 21:23:40,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:40,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-11 21:23:40,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:40,094 INFO L225 Difference]: With dead ends: 1092 [2019-01-11 21:23:40,094 INFO L226 Difference]: Without dead ends: 715 [2019-01-11 21:23:40,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-01-11 21:23:40,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-01-11 21:23:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-01-11 21:23:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2019-01-11 21:23:40,118 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2019-01-11 21:23:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:40,118 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2019-01-11 21:23:40,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2019-01-11 21:23:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 21:23:40,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:40,122 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:40,122 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash 181343972, now seen corresponding path program 1 times [2019-01-11 21:23:40,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:40,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:40,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:40,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:40,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-11 21:23:40,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:40,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:40,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:40,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:40,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:40,209 INFO L87 Difference]: Start difference. First operand 715 states and 1127 transitions. Second operand 3 states. [2019-01-11 21:23:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:40,377 INFO L93 Difference]: Finished difference Result 1798 states and 2838 transitions. [2019-01-11 21:23:40,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:40,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-11 21:23:40,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:40,385 INFO L225 Difference]: With dead ends: 1798 [2019-01-11 21:23:40,386 INFO L226 Difference]: Without dead ends: 1090 [2019-01-11 21:23:40,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-01-11 21:23:40,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2019-01-11 21:23:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-01-11 21:23:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1720 transitions. [2019-01-11 21:23:40,421 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1720 transitions. Word has length 121 [2019-01-11 21:23:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:40,422 INFO L480 AbstractCegarLoop]: Abstraction has 1090 states and 1720 transitions. [2019-01-11 21:23:40,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1720 transitions. [2019-01-11 21:23:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-11 21:23:40,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:40,426 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:40,427 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:40,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash -956252537, now seen corresponding path program 1 times [2019-01-11 21:23:40,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:40,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:40,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:40,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:40,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:40,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:40,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:40,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:40,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:40,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:40,524 INFO L87 Difference]: Start difference. First operand 1090 states and 1720 transitions. Second operand 3 states. [2019-01-11 21:23:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:41,289 INFO L93 Difference]: Finished difference Result 2299 states and 3632 transitions. [2019-01-11 21:23:41,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:41,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-01-11 21:23:41,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:41,295 INFO L225 Difference]: With dead ends: 2299 [2019-01-11 21:23:41,295 INFO L226 Difference]: Without dead ends: 1216 [2019-01-11 21:23:41,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-01-11 21:23:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1204. [2019-01-11 21:23:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-01-11 21:23:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1898 transitions. [2019-01-11 21:23:41,331 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1898 transitions. Word has length 122 [2019-01-11 21:23:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:41,331 INFO L480 AbstractCegarLoop]: Abstraction has 1204 states and 1898 transitions. [2019-01-11 21:23:41,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1898 transitions. [2019-01-11 21:23:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-11 21:23:41,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:41,336 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:41,336 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:41,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:41,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1998579872, now seen corresponding path program 1 times [2019-01-11 21:23:41,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:41,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:41,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:41,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:41,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:41,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:41,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:41,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:41,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:41,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:41,410 INFO L87 Difference]: Start difference. First operand 1204 states and 1898 transitions. Second operand 3 states. [2019-01-11 21:23:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:41,719 INFO L93 Difference]: Finished difference Result 2413 states and 3802 transitions. [2019-01-11 21:23:41,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:41,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-01-11 21:23:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:41,726 INFO L225 Difference]: With dead ends: 2413 [2019-01-11 21:23:41,726 INFO L226 Difference]: Without dead ends: 1210 [2019-01-11 21:23:41,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-01-11 21:23:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1198. [2019-01-11 21:23:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-01-11 21:23:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1881 transitions. [2019-01-11 21:23:41,761 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1881 transitions. Word has length 123 [2019-01-11 21:23:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:41,762 INFO L480 AbstractCegarLoop]: Abstraction has 1198 states and 1881 transitions. [2019-01-11 21:23:41,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1881 transitions. [2019-01-11 21:23:41,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-11 21:23:41,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:41,767 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:41,767 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:41,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:41,767 INFO L82 PathProgramCache]: Analyzing trace with hash 496982003, now seen corresponding path program 1 times [2019-01-11 21:23:41,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:41,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:41,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:41,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:41,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-01-11 21:23:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:41,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:41,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:41,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:41,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:41,847 INFO L87 Difference]: Start difference. First operand 1198 states and 1881 transitions. Second operand 3 states. [2019-01-11 21:23:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:42,068 INFO L93 Difference]: Finished difference Result 2503 states and 3931 transitions. [2019-01-11 21:23:42,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:42,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-01-11 21:23:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:42,073 INFO L225 Difference]: With dead ends: 2503 [2019-01-11 21:23:42,073 INFO L226 Difference]: Without dead ends: 1312 [2019-01-11 21:23:42,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-01-11 21:23:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1306. [2019-01-11 21:23:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-01-11 21:23:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 2044 transitions. [2019-01-11 21:23:42,110 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 2044 transitions. Word has length 155 [2019-01-11 21:23:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:42,111 INFO L480 AbstractCegarLoop]: Abstraction has 1306 states and 2044 transitions. [2019-01-11 21:23:42,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2044 transitions. [2019-01-11 21:23:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-11 21:23:42,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:42,116 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:42,116 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1762620122, now seen corresponding path program 1 times [2019-01-11 21:23:42,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:42,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:42,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:42,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:42,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-01-11 21:23:42,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:42,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:42,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:42,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:42,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:42,221 INFO L87 Difference]: Start difference. First operand 1306 states and 2044 transitions. Second operand 3 states. [2019-01-11 21:23:42,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:42,927 INFO L93 Difference]: Finished difference Result 2611 states and 4083 transitions. [2019-01-11 21:23:42,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:42,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-01-11 21:23:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:42,932 INFO L225 Difference]: With dead ends: 2611 [2019-01-11 21:23:42,932 INFO L226 Difference]: Without dead ends: 1306 [2019-01-11 21:23:42,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-01-11 21:23:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1300. [2019-01-11 21:23:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-01-11 21:23:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2024 transitions. [2019-01-11 21:23:42,968 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2024 transitions. Word has length 156 [2019-01-11 21:23:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:42,969 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 2024 transitions. [2019-01-11 21:23:42,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2024 transitions. [2019-01-11 21:23:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-11 21:23:42,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:42,974 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:42,974 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:42,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:42,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1655718978, now seen corresponding path program 1 times [2019-01-11 21:23:42,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:42,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:42,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-01-11 21:23:43,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:43,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:43,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:43,071 INFO L87 Difference]: Start difference. First operand 1300 states and 2024 transitions. Second operand 3 states. [2019-01-11 21:23:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:43,868 INFO L93 Difference]: Finished difference Result 2701 states and 4205 transitions. [2019-01-11 21:23:43,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:43,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-01-11 21:23:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:43,873 INFO L225 Difference]: With dead ends: 2701 [2019-01-11 21:23:43,873 INFO L226 Difference]: Without dead ends: 1408 [2019-01-11 21:23:43,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2019-01-11 21:23:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1402. [2019-01-11 21:23:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-01-11 21:23:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2172 transitions. [2019-01-11 21:23:43,913 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2172 transitions. Word has length 186 [2019-01-11 21:23:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:43,913 INFO L480 AbstractCegarLoop]: Abstraction has 1402 states and 2172 transitions. [2019-01-11 21:23:43,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2172 transitions. [2019-01-11 21:23:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-11 21:23:43,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:43,919 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:43,919 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:43,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:43,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1614779429, now seen corresponding path program 1 times [2019-01-11 21:23:43,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:43,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:43,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:43,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-01-11 21:23:44,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:44,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:44,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:44,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:44,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:44,017 INFO L87 Difference]: Start difference. First operand 1402 states and 2172 transitions. Second operand 3 states. [2019-01-11 21:23:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:44,262 INFO L93 Difference]: Finished difference Result 2803 states and 4339 transitions. [2019-01-11 21:23:44,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:44,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-01-11 21:23:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:44,269 INFO L225 Difference]: With dead ends: 2803 [2019-01-11 21:23:44,269 INFO L226 Difference]: Without dead ends: 1402 [2019-01-11 21:23:44,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-01-11 21:23:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1396. [2019-01-11 21:23:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2019-01-11 21:23:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2149 transitions. [2019-01-11 21:23:44,309 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2149 transitions. Word has length 187 [2019-01-11 21:23:44,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:44,309 INFO L480 AbstractCegarLoop]: Abstraction has 1396 states and 2149 transitions. [2019-01-11 21:23:44,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2149 transitions. [2019-01-11 21:23:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-11 21:23:44,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:44,314 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:44,314 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:44,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:44,314 INFO L82 PathProgramCache]: Analyzing trace with hash -848280398, now seen corresponding path program 1 times [2019-01-11 21:23:44,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:44,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:44,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:44,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:44,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-01-11 21:23:44,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:44,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:44,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:44,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:44,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:44,403 INFO L87 Difference]: Start difference. First operand 1396 states and 2149 transitions. Second operand 3 states. [2019-01-11 21:23:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:44,646 INFO L93 Difference]: Finished difference Result 2899 states and 4473 transitions. [2019-01-11 21:23:44,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:44,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-01-11 21:23:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:44,654 INFO L225 Difference]: With dead ends: 2899 [2019-01-11 21:23:44,655 INFO L226 Difference]: Without dead ends: 1510 [2019-01-11 21:23:44,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-01-11 21:23:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2019-01-11 21:23:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-01-11 21:23:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2246 transitions. [2019-01-11 21:23:44,696 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2246 transitions. Word has length 205 [2019-01-11 21:23:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:44,697 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 2246 transitions. [2019-01-11 21:23:44,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2246 transitions. [2019-01-11 21:23:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-11 21:23:44,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:44,701 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:44,701 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:44,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1187572258, now seen corresponding path program 1 times [2019-01-11 21:23:44,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:44,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:44,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:44,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:44,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-01-11 21:23:44,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:44,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:44,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:44,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:44,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:44,763 INFO L87 Difference]: Start difference. First operand 1471 states and 2246 transitions. Second operand 3 states. [2019-01-11 21:23:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:44,955 INFO L93 Difference]: Finished difference Result 2974 states and 4544 transitions. [2019-01-11 21:23:44,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:44,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-01-11 21:23:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:44,961 INFO L225 Difference]: With dead ends: 2974 [2019-01-11 21:23:44,961 INFO L226 Difference]: Without dead ends: 1510 [2019-01-11 21:23:44,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-01-11 21:23:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1471. [2019-01-11 21:23:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-01-11 21:23:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2220 transitions. [2019-01-11 21:23:44,997 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2220 transitions. Word has length 206 [2019-01-11 21:23:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:44,997 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 2220 transitions. [2019-01-11 21:23:44,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2220 transitions. [2019-01-11 21:23:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-11 21:23:45,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:45,002 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:45,002 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:45,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:45,002 INFO L82 PathProgramCache]: Analyzing trace with hash -778811277, now seen corresponding path program 1 times [2019-01-11 21:23:45,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:45,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:45,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:45,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:45,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-01-11 21:23:45,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:45,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:45,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:45,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:45,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:45,098 INFO L87 Difference]: Start difference. First operand 1471 states and 2220 transitions. Second operand 3 states. [2019-01-11 21:23:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:45,651 INFO L93 Difference]: Finished difference Result 2947 states and 4444 transitions. [2019-01-11 21:23:45,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:45,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-01-11 21:23:45,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:45,660 INFO L225 Difference]: With dead ends: 2947 [2019-01-11 21:23:45,660 INFO L226 Difference]: Without dead ends: 1483 [2019-01-11 21:23:45,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2019-01-11 21:23:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1471. [2019-01-11 21:23:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-01-11 21:23:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2203 transitions. [2019-01-11 21:23:45,703 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2203 transitions. Word has length 217 [2019-01-11 21:23:45,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:45,703 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 2203 transitions. [2019-01-11 21:23:45,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2203 transitions. [2019-01-11 21:23:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-01-11 21:23:45,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:45,708 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:45,708 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:45,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1333590618, now seen corresponding path program 1 times [2019-01-11 21:23:45,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:45,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:45,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:45,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:45,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-01-11 21:23:45,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:45,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:45,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:45,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:45,798 INFO L87 Difference]: Start difference. First operand 1471 states and 2203 transitions. Second operand 3 states. [2019-01-11 21:23:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:45,981 INFO L93 Difference]: Finished difference Result 2947 states and 4410 transitions. [2019-01-11 21:23:45,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:45,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-01-11 21:23:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:45,986 INFO L225 Difference]: With dead ends: 2947 [2019-01-11 21:23:45,987 INFO L226 Difference]: Without dead ends: 1456 [2019-01-11 21:23:45,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-01-11 21:23:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1444. [2019-01-11 21:23:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-01-11 21:23:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2147 transitions. [2019-01-11 21:23:46,019 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2147 transitions. Word has length 218 [2019-01-11 21:23:46,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:46,020 INFO L480 AbstractCegarLoop]: Abstraction has 1444 states and 2147 transitions. [2019-01-11 21:23:46,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2147 transitions. [2019-01-11 21:23:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-11 21:23:46,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:46,024 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:46,024 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:46,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:46,024 INFO L82 PathProgramCache]: Analyzing trace with hash 193493261, now seen corresponding path program 1 times [2019-01-11 21:23:46,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:46,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:46,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:46,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:46,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-01-11 21:23:46,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:46,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:46,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:46,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:46,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:46,119 INFO L87 Difference]: Start difference. First operand 1444 states and 2147 transitions. Second operand 3 states. [2019-01-11 21:23:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:46,543 INFO L93 Difference]: Finished difference Result 2962 states and 4409 transitions. [2019-01-11 21:23:46,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:46,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-01-11 21:23:46,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:46,549 INFO L225 Difference]: With dead ends: 2962 [2019-01-11 21:23:46,549 INFO L226 Difference]: Without dead ends: 1525 [2019-01-11 21:23:46,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2019-01-11 21:23:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1513. [2019-01-11 21:23:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-01-11 21:23:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2229 transitions. [2019-01-11 21:23:46,578 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2229 transitions. Word has length 226 [2019-01-11 21:23:46,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:46,579 INFO L480 AbstractCegarLoop]: Abstraction has 1513 states and 2229 transitions. [2019-01-11 21:23:46,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2229 transitions. [2019-01-11 21:23:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-01-11 21:23:46,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:46,583 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:46,583 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:46,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:46,584 INFO L82 PathProgramCache]: Analyzing trace with hash -831258623, now seen corresponding path program 1 times [2019-01-11 21:23:46,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:46,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:46,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:46,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:46,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-01-11 21:23:46,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:46,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:46,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:46,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:46,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:46,690 INFO L87 Difference]: Start difference. First operand 1513 states and 2229 transitions. Second operand 3 states. [2019-01-11 21:23:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:46,952 INFO L93 Difference]: Finished difference Result 3031 states and 4462 transitions. [2019-01-11 21:23:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:46,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-01-11 21:23:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:46,958 INFO L225 Difference]: With dead ends: 3031 [2019-01-11 21:23:46,959 INFO L226 Difference]: Without dead ends: 1513 [2019-01-11 21:23:46,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-01-11 21:23:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1501. [2019-01-11 21:23:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-01-11 21:23:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2182 transitions. [2019-01-11 21:23:46,988 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2182 transitions. Word has length 227 [2019-01-11 21:23:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:46,989 INFO L480 AbstractCegarLoop]: Abstraction has 1501 states and 2182 transitions. [2019-01-11 21:23:46,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2182 transitions. [2019-01-11 21:23:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-01-11 21:23:46,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:46,991 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:46,991 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash 225623806, now seen corresponding path program 1 times [2019-01-11 21:23:46,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:46,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:46,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-01-11 21:23:47,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:47,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:47,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:47,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:47,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:47,098 INFO L87 Difference]: Start difference. First operand 1501 states and 2182 transitions. Second operand 3 states. [2019-01-11 21:23:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:47,351 INFO L93 Difference]: Finished difference Result 3052 states and 4439 transitions. [2019-01-11 21:23:47,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:47,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-01-11 21:23:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:47,362 INFO L225 Difference]: With dead ends: 3052 [2019-01-11 21:23:47,362 INFO L226 Difference]: Without dead ends: 1558 [2019-01-11 21:23:47,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-01-11 21:23:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2019-01-11 21:23:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-01-11 21:23:47,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2266 transitions. [2019-01-11 21:23:47,426 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2266 transitions. Word has length 263 [2019-01-11 21:23:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:47,426 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2266 transitions. [2019-01-11 21:23:47,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:47,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2266 transitions. [2019-01-11 21:23:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-01-11 21:23:47,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:47,434 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:47,434 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:47,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1710298052, now seen corresponding path program 1 times [2019-01-11 21:23:47,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:47,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:47,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:47,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:47,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2019-01-11 21:23:47,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:47,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:47,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:47,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:47,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:47,563 INFO L87 Difference]: Start difference. First operand 1558 states and 2266 transitions. Second operand 3 states. [2019-01-11 21:23:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:47,773 INFO L93 Difference]: Finished difference Result 3142 states and 4569 transitions. [2019-01-11 21:23:47,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:47,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-01-11 21:23:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:47,785 INFO L225 Difference]: With dead ends: 3142 [2019-01-11 21:23:47,790 INFO L226 Difference]: Without dead ends: 1591 [2019-01-11 21:23:47,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-01-11 21:23:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2019-01-11 21:23:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2019-01-11 21:23:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2313 transitions. [2019-01-11 21:23:47,841 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2313 transitions. Word has length 263 [2019-01-11 21:23:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:47,841 INFO L480 AbstractCegarLoop]: Abstraction has 1591 states and 2313 transitions. [2019-01-11 21:23:47,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2313 transitions. [2019-01-11 21:23:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-01-11 21:23:47,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:47,847 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:23:47,848 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:47,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1900040589, now seen corresponding path program 1 times [2019-01-11 21:23:47,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:47,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:47,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:47,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:47,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-01-11 21:23:47,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:47,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:47,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:47,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:47,956 INFO L87 Difference]: Start difference. First operand 1591 states and 2313 transitions. Second operand 3 states. [2019-01-11 21:23:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:48,035 INFO L93 Difference]: Finished difference Result 4612 states and 6703 transitions. [2019-01-11 21:23:48,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:48,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-01-11 21:23:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:48,041 INFO L225 Difference]: With dead ends: 4612 [2019-01-11 21:23:48,041 INFO L226 Difference]: Without dead ends: 3061 [2019-01-11 21:23:48,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2019-01-11 21:23:48,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3059. [2019-01-11 21:23:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2019-01-11 21:23:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 4438 transitions. [2019-01-11 21:23:48,112 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 4438 transitions. Word has length 271 [2019-01-11 21:23:48,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:48,112 INFO L480 AbstractCegarLoop]: Abstraction has 3059 states and 4438 transitions. [2019-01-11 21:23:48,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 4438 transitions. [2019-01-11 21:23:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-01-11 21:23:48,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:48,117 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:48,117 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:48,118 INFO L82 PathProgramCache]: Analyzing trace with hash 999895398, now seen corresponding path program 1 times [2019-01-11 21:23:48,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:48,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:48,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:48,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-01-11 21:23:48,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:48,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:48,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:48,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:48,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:48,306 INFO L87 Difference]: Start difference. First operand 3059 states and 4438 transitions. Second operand 3 states. [2019-01-11 21:23:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:49,756 INFO L93 Difference]: Finished difference Result 6291 states and 9153 transitions. [2019-01-11 21:23:49,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:49,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-01-11 21:23:49,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:49,762 INFO L225 Difference]: With dead ends: 6291 [2019-01-11 21:23:49,762 INFO L226 Difference]: Without dead ends: 2043 [2019-01-11 21:23:49,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2019-01-11 21:23:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2023. [2019-01-11 21:23:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2023 states. [2019-01-11 21:23:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2884 transitions. [2019-01-11 21:23:49,829 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2884 transitions. Word has length 308 [2019-01-11 21:23:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:49,831 INFO L480 AbstractCegarLoop]: Abstraction has 2023 states and 2884 transitions. [2019-01-11 21:23:49,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2884 transitions. [2019-01-11 21:23:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-01-11 21:23:49,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:49,836 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:49,836 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:49,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:49,837 INFO L82 PathProgramCache]: Analyzing trace with hash -531219143, now seen corresponding path program 1 times [2019-01-11 21:23:49,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:49,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:49,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:49,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:49,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-01-11 21:23:50,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:23:50,052 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:23:50,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:50,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:23:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-01-11 21:23:50,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:23:50,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:23:50,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:23:50,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:23:50,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:23:50,420 INFO L87 Difference]: Start difference. First operand 2023 states and 2884 transitions. Second operand 5 states. [2019-01-11 21:23:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:51,735 INFO L93 Difference]: Finished difference Result 5365 states and 7620 transitions. [2019-01-11 21:23:51,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 21:23:51,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 375 [2019-01-11 21:23:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:51,743 INFO L225 Difference]: With dead ends: 5365 [2019-01-11 21:23:51,743 INFO L226 Difference]: Without dead ends: 3294 [2019-01-11 21:23:51,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-11 21:23:51,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-01-11 21:23:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 2606. [2019-01-11 21:23:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2606 states. [2019-01-11 21:23:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 3582 transitions. [2019-01-11 21:23:51,844 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 3582 transitions. Word has length 375 [2019-01-11 21:23:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:51,845 INFO L480 AbstractCegarLoop]: Abstraction has 2606 states and 3582 transitions. [2019-01-11 21:23:51,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:23:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3582 transitions. [2019-01-11 21:23:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2019-01-11 21:23:51,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:51,857 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, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:51,860 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:51,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:51,860 INFO L82 PathProgramCache]: Analyzing trace with hash 306967968, now seen corresponding path program 1 times [2019-01-11 21:23:51,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:51,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:51,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:51,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:51,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5025 backedges. 3008 proven. 26 refuted. 0 times theorem prover too weak. 1991 trivial. 0 not checked. [2019-01-11 21:23:52,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:23:52,201 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:23:52,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:52,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:23:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5025 backedges. 1445 proven. 0 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2019-01-11 21:23:52,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:23:52,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:23:52,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:23:52,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:23:52,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:23:52,774 INFO L87 Difference]: Start difference. First operand 2606 states and 3582 transitions. Second operand 5 states. [2019-01-11 21:23:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:53,173 INFO L93 Difference]: Finished difference Result 5320 states and 7337 transitions. [2019-01-11 21:23:53,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:23:53,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 674 [2019-01-11 21:23:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:53,178 INFO L225 Difference]: With dead ends: 5320 [2019-01-11 21:23:53,178 INFO L226 Difference]: Without dead ends: 2659 [2019-01-11 21:23:53,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 676 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:23:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2019-01-11 21:23:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 1935. [2019-01-11 21:23:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-01-11 21:23:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2648 transitions. [2019-01-11 21:23:53,251 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2648 transitions. Word has length 674 [2019-01-11 21:23:53,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:53,252 INFO L480 AbstractCegarLoop]: Abstraction has 1935 states and 2648 transitions. [2019-01-11 21:23:53,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:23:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2648 transitions. [2019-01-11 21:23:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2019-01-11 21:23:53,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:53,270 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:53,270 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:53,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1537607748, now seen corresponding path program 1 times [2019-01-11 21:23:53,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:53,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:53,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:53,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:53,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-01-11 21:23:53,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:53,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:53,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:53,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:53,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:53,717 INFO L87 Difference]: Start difference. First operand 1935 states and 2648 transitions. Second operand 3 states. [2019-01-11 21:23:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:53,932 INFO L93 Difference]: Finished difference Result 3871 states and 5290 transitions. [2019-01-11 21:23:53,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:53,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1028 [2019-01-11 21:23:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:53,936 INFO L225 Difference]: With dead ends: 3871 [2019-01-11 21:23:53,936 INFO L226 Difference]: Without dead ends: 1975 [2019-01-11 21:23:53,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2019-01-11 21:23:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1935. [2019-01-11 21:23:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-01-11 21:23:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2633 transitions. [2019-01-11 21:23:54,015 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2633 transitions. Word has length 1028 [2019-01-11 21:23:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:54,016 INFO L480 AbstractCegarLoop]: Abstraction has 1935 states and 2633 transitions. [2019-01-11 21:23:54,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2633 transitions. [2019-01-11 21:23:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2019-01-11 21:23:54,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:54,039 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:54,039 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:54,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:54,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1152424720, now seen corresponding path program 1 times [2019-01-11 21:23:54,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:54,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:54,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:54,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:54,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2019-01-11 21:23:54,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:54,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:54,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:54,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:54,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:54,843 INFO L87 Difference]: Start difference. First operand 1935 states and 2633 transitions. Second operand 3 states. [2019-01-11 21:23:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:55,190 INFO L93 Difference]: Finished difference Result 3831 states and 5212 transitions. [2019-01-11 21:23:55,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:55,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1043 [2019-01-11 21:23:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:55,195 INFO L225 Difference]: With dead ends: 3831 [2019-01-11 21:23:55,195 INFO L226 Difference]: Without dead ends: 1935 [2019-01-11 21:23:55,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:55,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-01-11 21:23:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-01-11 21:23:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-01-11 21:23:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2595 transitions. [2019-01-11 21:23:55,264 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2595 transitions. Word has length 1043 [2019-01-11 21:23:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:55,266 INFO L480 AbstractCegarLoop]: Abstraction has 1935 states and 2595 transitions. [2019-01-11 21:23:55,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2595 transitions. [2019-01-11 21:23:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2019-01-11 21:23:55,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:55,281 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:55,282 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:55,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:55,284 INFO L82 PathProgramCache]: Analyzing trace with hash -529516007, now seen corresponding path program 1 times [2019-01-11 21:23:55,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:55,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:55,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:55,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:55,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2019-01-11 21:23:55,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:55,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:55,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:55,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:55,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:55,848 INFO L87 Difference]: Start difference. First operand 1935 states and 2595 transitions. Second operand 3 states. [2019-01-11 21:23:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:56,016 INFO L93 Difference]: Finished difference Result 3871 states and 5194 transitions. [2019-01-11 21:23:56,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:56,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1071 [2019-01-11 21:23:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:56,019 INFO L225 Difference]: With dead ends: 3871 [2019-01-11 21:23:56,019 INFO L226 Difference]: Without dead ends: 1963 [2019-01-11 21:23:56,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-01-11 21:23:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2019-01-11 21:23:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-01-11 21:23:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2623 transitions. [2019-01-11 21:23:56,088 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2623 transitions. Word has length 1071 [2019-01-11 21:23:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:56,089 INFO L480 AbstractCegarLoop]: Abstraction has 1963 states and 2623 transitions. [2019-01-11 21:23:56,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2623 transitions. [2019-01-11 21:23:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2019-01-11 21:23:56,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:56,109 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:23:56,109 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:56,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash -503398519, now seen corresponding path program 1 times [2019-01-11 21:23:56,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:56,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2019-01-11 21:23:56,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:56,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:23:56,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:56,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:56,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:56,677 INFO L87 Difference]: Start difference. First operand 1963 states and 2623 transitions. Second operand 3 states. [2019-01-11 21:23:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:56,849 INFO L93 Difference]: Finished difference Result 2491 states and 3323 transitions. [2019-01-11 21:23:56,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:56,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1103 [2019-01-11 21:23:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:56,851 INFO L225 Difference]: With dead ends: 2491 [2019-01-11 21:23:56,851 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:23:56,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:23:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:23:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:23:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:23:56,853 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1103 [2019-01-11 21:23:56,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:56,854 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:23:56,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:56,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:23:56,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:23:56,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:23:57,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,171 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 131 [2019-01-11 21:23:57,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,933 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 133 [2019-01-11 21:23:57,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:57,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:58,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:23:58,748 WARN L181 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-01-11 21:23:59,920 WARN L181 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 120 DAG size of output: 84 [2019-01-11 21:24:01,757 WARN L181 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-01-11 21:24:02,192 WARN L181 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 97 [2019-01-11 21:24:02,595 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-01-11 21:24:02,928 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-01-11 21:24:03,318 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-01-11 21:24:03,597 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-01-11 21:24:03,925 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-01-11 21:24:04,327 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-01-11 21:24:04,751 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2019-01-11 21:24:05,234 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-01-11 21:24:05,587 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-01-11 21:24:05,957 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-01-11 21:24:06,314 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-01-11 21:24:06,865 WARN L181 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-01-11 21:24:07,665 WARN L181 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2019-01-11 21:24:08,013 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-01-11 21:24:08,793 WARN L181 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-01-11 21:24:09,147 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-01-11 21:24:09,550 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-01-11 21:24:09,553 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2019-01-11 21:24:09,553 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-01-11 21:24:09,553 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 551) no Hoare annotation was computed. [2019-01-11 21:24:09,553 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 562) no Hoare annotation was computed. [2019-01-11 21:24:09,554 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 573) no Hoare annotation was computed. [2019-01-11 21:24:09,554 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 584) no Hoare annotation was computed. [2019-01-11 21:24:09,554 INFO L451 ceAbstractionStarter]: At program point L631(lines 622 633) the Hoare annotation is: true [2019-01-11 21:24:09,554 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-01-11 21:24:09,554 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 238) no Hoare annotation was computed. [2019-01-11 21:24:09,555 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 552) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-01-11 21:24:09,558 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 584) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) [2019-01-11 21:24:09,558 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 309) no Hoare annotation was computed. [2019-01-11 21:24:09,558 INFO L448 ceAbstractionStarter]: For program point L302-2(lines 302 309) no Hoare annotation was computed. [2019-01-11 21:24:09,558 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 550) no Hoare annotation was computed. [2019-01-11 21:24:09,558 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 561) no Hoare annotation was computed. [2019-01-11 21:24:09,558 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 572) no Hoare annotation was computed. [2019-01-11 21:24:09,559 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 583) no Hoare annotation was computed. [2019-01-11 21:24:09,559 INFO L448 ceAbstractionStarter]: For program point L535(lines 535 541) no Hoare annotation was computed. [2019-01-11 21:24:09,559 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 535 541) no Hoare annotation was computed. [2019-01-11 21:24:09,559 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 361) no Hoare annotation was computed. [2019-01-11 21:24:09,559 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 550) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:24:09,559 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 562) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 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)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:09,559 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 573) the Hoare annotation is: (let ((.cse0 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5 .cse6 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse12 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse13)) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) .cse12))) [2019-01-11 21:24:09,560 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 274) no Hoare annotation was computed. [2019-01-11 21:24:09,560 INFO L448 ceAbstractionStarter]: For program point L272-2(lines 208 547) no Hoare annotation was computed. [2019-01-11 21:24:09,560 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2019-01-11 21:24:09,560 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 251) no Hoare annotation was computed. [2019-01-11 21:24:09,560 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 550) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:24:09,560 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 560) no Hoare annotation was computed. [2019-01-11 21:24:09,560 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 571) no Hoare annotation was computed. [2019-01-11 21:24:09,560 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 582) no Hoare annotation was computed. [2019-01-11 21:24:09,560 INFO L451 ceAbstractionStarter]: At program point L604(lines 98 605) the Hoare annotation is: true [2019-01-11 21:24:09,560 INFO L448 ceAbstractionStarter]: For program point L538(lines 538 540) no Hoare annotation was computed. [2019-01-11 21:24:09,560 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 509) no Hoare annotation was computed. [2019-01-11 21:24:09,561 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2019-01-11 21:24:09,561 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-01-11 21:24:09,561 INFO L448 ceAbstractionStarter]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2019-01-11 21:24:09,561 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2019-01-11 21:24:09,561 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 407) no Hoare annotation was computed. [2019-01-11 21:24:09,561 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 559) no Hoare annotation was computed. [2019-01-11 21:24:09,561 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 570) no Hoare annotation was computed. [2019-01-11 21:24:09,561 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 581) no Hoare annotation was computed. [2019-01-11 21:24:09,561 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2019-01-11 21:24:09,561 INFO L448 ceAbstractionStarter]: For program point L475-2(lines 208 547) no Hoare annotation was computed. [2019-01-11 21:24:09,561 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-01-11 21:24:09,562 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 583) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:09,562 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 560) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse17 .cse18 .cse19 .cse20 .cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:09,562 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 571) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:09,562 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2019-01-11 21:24:09,562 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 611) no Hoare annotation was computed. [2019-01-11 21:24:09,563 INFO L448 ceAbstractionStarter]: For program point L609-2(lines 609 611) no Hoare annotation was computed. [2019-01-11 21:24:09,563 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 558) no Hoare annotation was computed. [2019-01-11 21:24:09,563 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 569) no Hoare annotation was computed. [2019-01-11 21:24:09,563 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 580) no Hoare annotation was computed. [2019-01-11 21:24:09,563 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-01-11 21:24:09,563 INFO L451 ceAbstractionStarter]: At program point L612(lines 12 616) the Hoare annotation is: true [2019-01-11 21:24:09,563 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-01-11 21:24:09,563 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-01-11 21:24:09,563 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 557) no Hoare annotation was computed. [2019-01-11 21:24:09,563 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 568) no Hoare annotation was computed. [2019-01-11 21:24:09,563 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-01-11 21:24:09,563 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 579) no Hoare annotation was computed. [2019-01-11 21:24:09,564 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 520) no Hoare annotation was computed. [2019-01-11 21:24:09,564 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 485) no Hoare annotation was computed. [2019-01-11 21:24:09,564 INFO L448 ceAbstractionStarter]: For program point L481-2(lines 481 485) no Hoare annotation was computed. [2019-01-11 21:24:09,564 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 357) no Hoare annotation was computed. [2019-01-11 21:24:09,564 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 558) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)))) [2019-01-11 21:24:09,564 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 569) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:09,565 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-01-11 21:24:09,565 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-01-11 21:24:09,566 INFO L444 ceAbstractionStarter]: At program point L548(lines 99 603) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse14 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11 .cse12) (and (and .cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2019-01-11 21:24:09,566 INFO L444 ceAbstractionStarter]: At program point L350(lines 325 368) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:09,566 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:24:09,567 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 419) no Hoare annotation was computed. [2019-01-11 21:24:09,567 INFO L444 ceAbstractionStarter]: At program point L384(lines 375 407) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:09,567 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 287) no Hoare annotation was computed. [2019-01-11 21:24:09,567 INFO L448 ceAbstractionStarter]: For program point L285-2(lines 208 547) no Hoare annotation was computed. [2019-01-11 21:24:09,567 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 556) no Hoare annotation was computed. [2019-01-11 21:24:09,568 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 567) no Hoare annotation was computed. [2019-01-11 21:24:09,568 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 578) no Hoare annotation was computed. [2019-01-11 21:24:09,568 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 519) no Hoare annotation was computed. [2019-01-11 21:24:09,568 INFO L444 ceAbstractionStarter]: At program point L517-1(lines 208 547) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-01-11 21:24:09,568 INFO L448 ceAbstractionStarter]: For program point L352(lines 352 354) no Hoare annotation was computed. [2019-01-11 21:24:09,568 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 323) no Hoare annotation was computed. [2019-01-11 21:24:09,568 INFO L448 ceAbstractionStarter]: For program point L319-2(lines 208 547) no Hoare annotation was computed. [2019-01-11 21:24:09,569 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 579) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:24:09,569 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-01-11 21:24:09,569 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 601) no Hoare annotation was computed. [2019-01-11 21:24:09,569 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 405) no Hoare annotation was computed. [2019-01-11 21:24:09,569 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 555) no Hoare annotation was computed. [2019-01-11 21:24:09,569 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 566) no Hoare annotation was computed. [2019-01-11 21:24:09,569 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 577) no Hoare annotation was computed. [2019-01-11 21:24:09,569 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-01-11 21:24:09,569 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 73 615) no Hoare annotation was computed. [2019-01-11 21:24:09,569 INFO L448 ceAbstractionStarter]: For program point L619(line 619) no Hoare annotation was computed. [2019-01-11 21:24:09,569 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 600) no Hoare annotation was computed. [2019-01-11 21:24:09,569 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-01-11 21:24:09,570 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:24:09,572 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 556) the Hoare annotation is: (let ((.cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse3 .cse2 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)))) [2019-01-11 21:24:09,572 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 567) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:09,573 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 577) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) [2019-01-11 21:24:09,573 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-01-11 21:24:09,573 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 592) no Hoare annotation was computed. [2019-01-11 21:24:09,573 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 586 600) no Hoare annotation was computed. [2019-01-11 21:24:09,573 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2019-01-11 21:24:09,573 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 295) no Hoare annotation was computed. [2019-01-11 21:24:09,573 INFO L448 ceAbstractionStarter]: For program point L291-2(lines 291 295) no Hoare annotation was computed. [2019-01-11 21:24:09,573 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 554) no Hoare annotation was computed. [2019-01-11 21:24:09,573 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 565) no Hoare annotation was computed. [2019-01-11 21:24:09,573 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 576) no Hoare annotation was computed. [2019-01-11 21:24:09,573 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 591) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 233) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 226 233) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point L492(lines 492 495) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point L525-2(lines 525 529) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 434) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point L426-2(lines 426 434) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 553) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 564) no Hoare annotation was computed. [2019-01-11 21:24:09,574 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 575) no Hoare annotation was computed. [2019-01-11 21:24:09,575 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 367) no Hoare annotation was computed. [2019-01-11 21:24:09,575 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 554) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse17 .cse18 .cse19 .cse20 .cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)))) [2019-01-11 21:24:09,575 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 565) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:24:09,575 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 598) no Hoare annotation was computed. [2019-01-11 21:24:09,575 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2019-01-11 21:24:09,576 INFO L444 ceAbstractionStarter]: At program point L396(lines 387 405) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:24:09,576 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 552) no Hoare annotation was computed. [2019-01-11 21:24:09,576 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 563) no Hoare annotation was computed. [2019-01-11 21:24:09,576 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 574) no Hoare annotation was computed. [2019-01-11 21:24:09,576 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 603) the Hoare annotation is: (let ((.cse17 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse18 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse18 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse15 .cse16) (and (and .cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2019-01-11 21:24:09,576 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 366) no Hoare annotation was computed. [2019-01-11 21:24:09,576 INFO L448 ceAbstractionStarter]: For program point L331-1(lines 331 366) no Hoare annotation was computed. [2019-01-11 21:24:09,577 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 563) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:24:09,580 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 576) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 .cse3 .cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse15))) [2019-01-11 21:24:09,580 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-11 21:24:09,580 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2019-01-11 21:24:09,580 INFO L448 ceAbstractionStarter]: For program point L497-2(lines 208 547) no Hoare annotation was computed. [2019-01-11 21:24:09,580 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 363) no Hoare annotation was computed. [2019-01-11 21:24:09,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:24:09 BoogieIcfgContainer [2019-01-11 21:24:09,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:24:09,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:24:09,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:24:09,649 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:24:09,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:23:30" (3/4) ... [2019-01-11 21:24:09,652 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:24:09,676 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:24:09,677 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:24:09,880 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:24:09,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:24:09,881 INFO L168 Benchmark]: Toolchain (without parser) took 41181.13 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 946.0 MB in the beginning and 858.4 MB in the end (delta: 87.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-01-11 21:24:09,885 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:24:09,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.98 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:09,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:09,886 INFO L168 Benchmark]: Boogie Preprocessor took 40.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:09,887 INFO L168 Benchmark]: RCFGBuilder took 1243.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:09,890 INFO L168 Benchmark]: TraceAbstraction took 39096.73 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 858.4 MB in the end (delta: 210.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-01-11 21:24:09,891 INFO L168 Benchmark]: Witness Printer took 232.31 ms. Allocated memory is still 2.3 GB. Free memory is still 858.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:24:09,895 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 433.98 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 129.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -203.6 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1243.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39096.73 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 858.4 MB in the end (delta: 210.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 232.31 ms. Allocated memory is still 2.3 GB. Free memory is still 858.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 619]: 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: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8497 == 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)) && blastFlag == 1) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || (((((((!(8609 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8641 == s__state)) && !(8577 == s__state)) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2)) || (((((((((((!(8497 == s__state) && 8448 <= s__state) && !(8481 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576)) || (blastFlag <= 3 && !(s__hit == 0))) || s__state <= 3) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(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) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576)) || ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(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)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((8448 <= s__state && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 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)) && 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) - InvariantResult [Line: 123]: 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)) && !(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: 387]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(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)) && !(s__hit == 0)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(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)) && !(s__hit == 0)) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(8609 == s__state) && !(8497 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8592 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((((((((((((((((((((((((!(8609 == s__state) && !(8497 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && !(8448 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == 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)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((((((((((((((((((((((((!(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)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8448 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (8448 <= s__state && ((((((((((((!(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)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == 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)) && !(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: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(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)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((!(8448 == s__state) && blastFlag == 2) && s__state <= 8448) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(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)) && !(s__hit == 0)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == 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)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(8609 == s__state) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == 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)) && !(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 == 2) && s__state <= 8576)) || ((((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 8448 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(8497 == 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)) && blastFlag == 1) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || (((((((!(8609 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8641 == s__state)) && !(8577 == s__state)) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2)) || (((((((((((!(8497 == s__state) && 8448 <= s__state) && !(8481 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576)) || ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || (blastFlag <= 3 && !(s__hit == 0))) || s__state <= 3) || (((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) - InvariantResult [Line: 168]: 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)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(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)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && !(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)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(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)) && !(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) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8673 == 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)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. SAFE Result, 38.9s OverallTime, 38 OverallIterations, 38 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 12.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 6343 SDtfs, 5182 SDslu, 2550 SDs, 0 SdLazy, 3595 SolverSat, 1368 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1146 GetRequests, 1099 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3059occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 1700 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 222 NumberOfFragments, 4018 HoareAnnotationTreeSize, 28 FomulaSimplifications, 34754 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 6460 FormulaSimplificationTreeSizeReductionInter, 11.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 11132 NumberOfCodeBlocks, 11132 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 11092 ConstructedInterpolants, 0 QuantifiedInterpolants, 8032549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1606 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 40 InterpolantComputations, 38 PerfectInterpolantSequences, 72841/72893 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...