./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_3_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_srvr_3_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb70094490cf46157ed6f1dc8c697227b983429d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:09:07,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:09:07,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:09:07,631 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:09:07,632 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:09:07,633 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:09:07,634 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:09:07,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:09:07,638 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:09:07,639 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:09:07,640 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:09:07,641 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:09:07,642 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:09:07,643 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:09:07,645 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:09:07,646 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:09:07,647 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:09:07,649 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:09:07,651 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:09:07,653 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:09:07,654 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:09:07,656 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:09:07,658 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:09:07,659 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:09:07,659 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:09:07,660 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:09:07,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:09:07,663 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:09:07,664 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:09:07,665 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:09:07,665 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:09:07,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:09:07,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:09:07,667 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:09:07,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:09:07,669 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:09:07,670 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:09:07,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:09:07,687 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:09:07,688 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:09:07,688 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:09:07,689 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:09:07,689 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:09:07,689 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:09:07,690 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:09:07,690 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:09:07,690 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:09:07,690 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:09:07,690 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:09:07,690 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:09:07,691 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:09:07,691 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:09:07,691 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:09:07,691 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:09:07,691 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:09:07,693 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:09:07,693 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:09:07,694 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:09:07,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:09:07,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:09:07,694 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:09:07,694 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:09:07,695 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:09:07,696 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:09:07,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:09:07,696 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb70094490cf46157ed6f1dc8c697227b983429d [2018-12-30 16:09:07,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:09:07,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:09:07,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:09:07,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:09:07,755 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:09:07,756 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_3_true-unreach-call_false-termination.cil.c [2018-12-30 16:09:07,821 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85937a872/407096765e9341af8b305ebb4c964f27/FLAG6ec53aee6 [2018-12-30 16:09:08,343 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:09:08,344 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_3_true-unreach-call_false-termination.cil.c [2018-12-30 16:09:08,364 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85937a872/407096765e9341af8b305ebb4c964f27/FLAG6ec53aee6 [2018-12-30 16:09:08,650 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85937a872/407096765e9341af8b305ebb4c964f27 [2018-12-30 16:09:08,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:09:08,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:09:08,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:09:08,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:09:08,664 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:09:08,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:09:08" (1/1) ... [2018-12-30 16:09:08,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c41972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:08, skipping insertion in model container [2018-12-30 16:09:08,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:09:08" (1/1) ... [2018-12-30 16:09:08,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:09:08,734 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:09:09,077 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:09:09,082 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:09:09,183 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:09:09,221 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:09:09,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09 WrapperNode [2018-12-30 16:09:09,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:09:09,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:09:09,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:09:09,223 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:09:09,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (1/1) ... [2018-12-30 16:09:09,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (1/1) ... [2018-12-30 16:09:09,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:09:09,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:09:09,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:09:09,397 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:09:09,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (1/1) ... [2018-12-30 16:09:09,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (1/1) ... [2018-12-30 16:09:09,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (1/1) ... [2018-12-30 16:09:09,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (1/1) ... [2018-12-30 16:09:09,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (1/1) ... [2018-12-30 16:09:09,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (1/1) ... [2018-12-30 16:09:09,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (1/1) ... [2018-12-30 16:09:09,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:09:09,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:09:09,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:09:09,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:09:09,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (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 [2018-12-30 16:09:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:09:09,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:09:09,673 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:09:09,673 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:09:10,913 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:09:10,913 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:09:10,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:09:10 BoogieIcfgContainer [2018-12-30 16:09:10,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:09:10,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:09:10,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:09:10,918 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:09:10,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:09:08" (1/3) ... [2018-12-30 16:09:10,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2998f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:09:10, skipping insertion in model container [2018-12-30 16:09:10,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (2/3) ... [2018-12-30 16:09:10,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2998f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:09:10, skipping insertion in model container [2018-12-30 16:09:10,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:09:10" (3/3) ... [2018-12-30 16:09:10,922 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_true-unreach-call_false-termination.cil.c [2018-12-30 16:09:10,931 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:09:10,939 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:09:10,957 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:09:10,994 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:09:10,995 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:09:10,995 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:09:10,996 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:09:10,996 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:09:10,996 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:09:10,996 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:09:10,996 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:09:10,996 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:09:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-12-30 16:09:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-30 16:09:11,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:11,029 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] [2018-12-30 16:09:11,031 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:11,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash -91604792, now seen corresponding path program 1 times [2018-12-30 16:09:11,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:11,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:11,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:11,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:11,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:11,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:11,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:11,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:11,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:11,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:11,343 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2018-12-30 16:09:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:12,212 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2018-12-30 16:09:12,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:12,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-30 16:09:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:12,232 INFO L225 Difference]: With dead ends: 327 [2018-12-30 16:09:12,232 INFO L226 Difference]: Without dead ends: 174 [2018-12-30 16:09:12,237 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 [2018-12-30 16:09:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-30 16:09:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2018-12-30 16:09:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-30 16:09:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2018-12-30 16:09:12,302 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2018-12-30 16:09:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:12,303 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2018-12-30 16:09:12,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2018-12-30 16:09:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-30 16:09:12,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:12,306 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] [2018-12-30 16:09:12,306 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:12,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:12,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1448034255, now seen corresponding path program 1 times [2018-12-30 16:09:12,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:12,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:12,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:12,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:12,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:12,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:12,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:12,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:12,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:12,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:12,486 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2018-12-30 16:09:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:13,059 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2018-12-30 16:09:13,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:13,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-30 16:09:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:13,071 INFO L225 Difference]: With dead ends: 379 [2018-12-30 16:09:13,071 INFO L226 Difference]: Without dead ends: 215 [2018-12-30 16:09:13,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 [2018-12-30 16:09:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-30 16:09:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2018-12-30 16:09:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-30 16:09:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2018-12-30 16:09:13,112 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2018-12-30 16:09:13,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:13,113 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2018-12-30 16:09:13,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:13,114 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2018-12-30 16:09:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-30 16:09:13,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:13,118 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] [2018-12-30 16:09:13,118 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:13,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:13,119 INFO L82 PathProgramCache]: Analyzing trace with hash 564000227, now seen corresponding path program 1 times [2018-12-30 16:09:13,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:13,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:13,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:13,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:13,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:13,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:13,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:13,229 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2018-12-30 16:09:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:13,563 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2018-12-30 16:09:13,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:13,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-12-30 16:09:13,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:13,568 INFO L225 Difference]: With dead ends: 444 [2018-12-30 16:09:13,568 INFO L226 Difference]: Without dead ends: 241 [2018-12-30 16:09:13,569 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 [2018-12-30 16:09:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-12-30 16:09:13,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-12-30 16:09:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-30 16:09:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2018-12-30 16:09:13,587 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2018-12-30 16:09:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:13,588 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2018-12-30 16:09:13,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2018-12-30 16:09:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-30 16:09:13,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:13,591 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] [2018-12-30 16:09:13,591 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:13,591 INFO L82 PathProgramCache]: Analyzing trace with hash 730826777, now seen corresponding path program 1 times [2018-12-30 16:09:13,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:13,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:13,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:13,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:13,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:13,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:13,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:13,692 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2018-12-30 16:09:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:14,053 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2018-12-30 16:09:14,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:14,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-30 16:09:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:14,055 INFO L225 Difference]: With dead ends: 492 [2018-12-30 16:09:14,056 INFO L226 Difference]: Without dead ends: 258 [2018-12-30 16:09:14,057 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 [2018-12-30 16:09:14,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-30 16:09:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-12-30 16:09:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-30 16:09:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2018-12-30 16:09:14,073 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2018-12-30 16:09:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:14,074 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2018-12-30 16:09:14,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2018-12-30 16:09:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-30 16:09:14,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:14,076 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] [2018-12-30 16:09:14,077 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:14,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1628760422, now seen corresponding path program 1 times [2018-12-30 16:09:14,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:14,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:14,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:14,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:14,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:14,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:14,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:14,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:14,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:14,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:14,205 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2018-12-30 16:09:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:14,737 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2018-12-30 16:09:14,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:14,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-30 16:09:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:14,741 INFO L225 Difference]: With dead ends: 551 [2018-12-30 16:09:14,741 INFO L226 Difference]: Without dead ends: 302 [2018-12-30 16:09:14,742 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 [2018-12-30 16:09:14,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-30 16:09:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2018-12-30 16:09:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-30 16:09:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2018-12-30 16:09:14,778 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2018-12-30 16:09:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:14,784 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2018-12-30 16:09:14,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2018-12-30 16:09:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:09:14,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:14,788 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] [2018-12-30 16:09:14,788 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:14,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2100135205, now seen corresponding path program 1 times [2018-12-30 16:09:14,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:14,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:14,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:14,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:14,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:14,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:14,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:14,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:14,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:14,921 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2018-12-30 16:09:15,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:15,171 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2018-12-30 16:09:15,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:15,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:09:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:15,176 INFO L225 Difference]: With dead ends: 591 [2018-12-30 16:09:15,176 INFO L226 Difference]: Without dead ends: 300 [2018-12-30 16:09:15,177 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 [2018-12-30 16:09:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-30 16:09:15,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2018-12-30 16:09:15,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-30 16:09:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2018-12-30 16:09:15,189 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2018-12-30 16:09:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:15,190 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2018-12-30 16:09:15,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2018-12-30 16:09:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:09:15,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:15,192 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] [2018-12-30 16:09:15,192 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:15,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:15,192 INFO L82 PathProgramCache]: Analyzing trace with hash 967197197, now seen corresponding path program 1 times [2018-12-30 16:09:15,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:15,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:15,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:15,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:15,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:15,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:15,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:15,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:15,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:15,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:15,299 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2018-12-30 16:09:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:16,204 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2018-12-30 16:09:16,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:16,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:09:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:16,207 INFO L225 Difference]: With dead ends: 593 [2018-12-30 16:09:16,207 INFO L226 Difference]: Without dead ends: 300 [2018-12-30 16:09:16,208 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 [2018-12-30 16:09:16,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-30 16:09:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2018-12-30 16:09:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-30 16:09:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2018-12-30 16:09:16,219 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2018-12-30 16:09:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:16,220 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2018-12-30 16:09:16,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2018-12-30 16:09:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-30 16:09:16,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:16,221 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] [2018-12-30 16:09:16,221 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:16,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:16,222 INFO L82 PathProgramCache]: Analyzing trace with hash 169031718, now seen corresponding path program 1 times [2018-12-30 16:09:16,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:16,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:16,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:16,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:16,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-30 16:09:16,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:16,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:16,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:16,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:16,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:16,270 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2018-12-30 16:09:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:16,555 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2018-12-30 16:09:16,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:16,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-12-30 16:09:16,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:16,558 INFO L225 Difference]: With dead ends: 594 [2018-12-30 16:09:16,558 INFO L226 Difference]: Without dead ends: 305 [2018-12-30 16:09:16,559 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 [2018-12-30 16:09:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-30 16:09:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-12-30 16:09:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-30 16:09:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2018-12-30 16:09:16,576 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2018-12-30 16:09:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:16,576 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2018-12-30 16:09:16,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2018-12-30 16:09:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-30 16:09:16,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:16,578 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] [2018-12-30 16:09:16,578 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:16,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:16,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1117186876, now seen corresponding path program 1 times [2018-12-30 16:09:16,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:16,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:16,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:16,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:16,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:16,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:16,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:16,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:16,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:16,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:16,706 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2018-12-30 16:09:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:18,150 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2018-12-30 16:09:18,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:18,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-12-30 16:09:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:18,152 INFO L225 Difference]: With dead ends: 634 [2018-12-30 16:09:18,153 INFO L226 Difference]: Without dead ends: 336 [2018-12-30 16:09:18,154 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 [2018-12-30 16:09:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-12-30 16:09:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2018-12-30 16:09:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-12-30 16:09:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2018-12-30 16:09:18,166 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2018-12-30 16:09:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:18,166 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2018-12-30 16:09:18,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2018-12-30 16:09:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-30 16:09:18,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:18,168 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] [2018-12-30 16:09:18,168 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:18,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:18,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1355507800, now seen corresponding path program 1 times [2018-12-30 16:09:18,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:18,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:18,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:18,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:18,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:18,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:18,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:18,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:18,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:18,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:18,255 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2018-12-30 16:09:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:19,008 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2018-12-30 16:09:19,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:19,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-30 16:09:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:19,012 INFO L225 Difference]: With dead ends: 663 [2018-12-30 16:09:19,012 INFO L226 Difference]: Without dead ends: 336 [2018-12-30 16:09:19,013 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 [2018-12-30 16:09:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-12-30 16:09:19,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2018-12-30 16:09:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-12-30 16:09:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2018-12-30 16:09:19,024 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2018-12-30 16:09:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:19,024 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2018-12-30 16:09:19,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2018-12-30 16:09:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-30 16:09:19,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:19,026 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] [2018-12-30 16:09:19,026 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash 106299532, now seen corresponding path program 1 times [2018-12-30 16:09:19,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:19,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:19,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:19,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:19,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:19,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:19,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:19,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:19,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:19,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:19,104 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2018-12-30 16:09:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:19,770 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2018-12-30 16:09:19,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:19,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-30 16:09:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:19,775 INFO L225 Difference]: With dead ends: 696 [2018-12-30 16:09:19,775 INFO L226 Difference]: Without dead ends: 369 [2018-12-30 16:09:19,777 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 [2018-12-30 16:09:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-30 16:09:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2018-12-30 16:09:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-30 16:09:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2018-12-30 16:09:19,790 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2018-12-30 16:09:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:19,791 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2018-12-30 16:09:19,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2018-12-30 16:09:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-30 16:09:19,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:19,794 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] [2018-12-30 16:09:19,794 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179864, now seen corresponding path program 1 times [2018-12-30 16:09:19,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:19,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:19,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:19,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:19,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:19,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:19,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:19,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:19,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:19,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:19,879 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2018-12-30 16:09:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:20,560 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2018-12-30 16:09:20,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:20,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-30 16:09:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:20,564 INFO L225 Difference]: With dead ends: 723 [2018-12-30 16:09:20,564 INFO L226 Difference]: Without dead ends: 369 [2018-12-30 16:09:20,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-30 16:09:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2018-12-30 16:09:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-30 16:09:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2018-12-30 16:09:20,577 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2018-12-30 16:09:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:20,577 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2018-12-30 16:09:20,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2018-12-30 16:09:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-30 16:09:20,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:20,579 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] [2018-12-30 16:09:20,579 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:20,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:20,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1408209639, now seen corresponding path program 1 times [2018-12-30 16:09:20,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:20,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:20,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:20,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:20,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:09:20,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:20,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:20,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:20,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:20,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:20,646 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2018-12-30 16:09:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:21,564 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2018-12-30 16:09:21,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:21,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-30 16:09:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:21,567 INFO L225 Difference]: With dead ends: 740 [2018-12-30 16:09:21,567 INFO L226 Difference]: Without dead ends: 386 [2018-12-30 16:09:21,568 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 [2018-12-30 16:09:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-30 16:09:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2018-12-30 16:09:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-30 16:09:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2018-12-30 16:09:21,584 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2018-12-30 16:09:21,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:21,584 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2018-12-30 16:09:21,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2018-12-30 16:09:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-30 16:09:21,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:21,586 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] [2018-12-30 16:09:21,586 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:21,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:21,587 INFO L82 PathProgramCache]: Analyzing trace with hash -628608595, now seen corresponding path program 1 times [2018-12-30 16:09:21,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:21,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:21,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:21,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:21,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:09:21,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:21,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:21,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:21,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:21,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:21,666 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2018-12-30 16:09:22,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:22,103 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2018-12-30 16:09:22,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:22,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-12-30 16:09:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:22,106 INFO L225 Difference]: With dead ends: 761 [2018-12-30 16:09:22,107 INFO L226 Difference]: Without dead ends: 386 [2018-12-30 16:09:22,108 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 [2018-12-30 16:09:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-30 16:09:22,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2018-12-30 16:09:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-30 16:09:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2018-12-30 16:09:22,123 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2018-12-30 16:09:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:22,124 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2018-12-30 16:09:22,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2018-12-30 16:09:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-30 16:09:22,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:22,128 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] [2018-12-30 16:09:22,129 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:22,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:22,129 INFO L82 PathProgramCache]: Analyzing trace with hash 543915161, now seen corresponding path program 1 times [2018-12-30 16:09:22,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:22,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:22,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:22,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-30 16:09:22,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:22,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:22,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:22,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:22,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:22,230 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2018-12-30 16:09:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:22,374 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2018-12-30 16:09:22,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:22,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-12-30 16:09:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:22,380 INFO L225 Difference]: With dead ends: 757 [2018-12-30 16:09:22,381 INFO L226 Difference]: Without dead ends: 755 [2018-12-30 16:09:22,381 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 [2018-12-30 16:09:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-12-30 16:09:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2018-12-30 16:09:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-12-30 16:09:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2018-12-30 16:09:22,407 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2018-12-30 16:09:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:22,408 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2018-12-30 16:09:22,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2018-12-30 16:09:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-30 16:09:22,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:22,412 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] [2018-12-30 16:09:22,412 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:22,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:22,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1286959367, now seen corresponding path program 1 times [2018-12-30 16:09:22,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:22,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:22,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:22,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:09:22,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:22,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:22,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:22,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:22,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:22,485 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2018-12-30 16:09:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:22,701 INFO L93 Difference]: Finished difference Result 1587 states and 2515 transitions. [2018-12-30 16:09:22,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:22,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-12-30 16:09:22,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:22,706 INFO L225 Difference]: With dead ends: 1587 [2018-12-30 16:09:22,706 INFO L226 Difference]: Without dead ends: 839 [2018-12-30 16:09:22,708 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 [2018-12-30 16:09:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-30 16:09:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 831. [2018-12-30 16:09:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-30 16:09:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1313 transitions. [2018-12-30 16:09:22,737 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1313 transitions. Word has length 121 [2018-12-30 16:09:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:22,738 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1313 transitions. [2018-12-30 16:09:22,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1313 transitions. [2018-12-30 16:09:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-30 16:09:22,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:22,742 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] [2018-12-30 16:09:22,742 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:22,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:22,743 INFO L82 PathProgramCache]: Analyzing trace with hash 203437824, now seen corresponding path program 1 times [2018-12-30 16:09:22,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:22,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:22,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:22,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:09:22,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:22,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:22,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:22,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:22,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:22,831 INFO L87 Difference]: Start difference. First operand 831 states and 1313 transitions. Second operand 3 states. [2018-12-30 16:09:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:24,145 INFO L93 Difference]: Finished difference Result 1663 states and 2627 transitions. [2018-12-30 16:09:24,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:24,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-12-30 16:09:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:24,152 INFO L225 Difference]: With dead ends: 1663 [2018-12-30 16:09:24,152 INFO L226 Difference]: Without dead ends: 835 [2018-12-30 16:09:24,153 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 [2018-12-30 16:09:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-12-30 16:09:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 827. [2018-12-30 16:09:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-12-30 16:09:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1301 transitions. [2018-12-30 16:09:24,181 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1301 transitions. Word has length 122 [2018-12-30 16:09:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:24,183 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1301 transitions. [2018-12-30 16:09:24,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1301 transitions. [2018-12-30 16:09:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-30 16:09:24,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:24,187 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] [2018-12-30 16:09:24,187 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:24,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:24,187 INFO L82 PathProgramCache]: Analyzing trace with hash -431636595, now seen corresponding path program 1 times [2018-12-30 16:09:24,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:24,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:24,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:24,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:24,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-30 16:09:24,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:24,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:24,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:24,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:24,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:24,276 INFO L87 Difference]: Start difference. First operand 827 states and 1301 transitions. Second operand 3 states. [2018-12-30 16:09:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:24,631 INFO L93 Difference]: Finished difference Result 1723 states and 2711 transitions. [2018-12-30 16:09:24,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:24,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-12-30 16:09:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:24,639 INFO L225 Difference]: With dead ends: 1723 [2018-12-30 16:09:24,640 INFO L226 Difference]: Without dead ends: 903 [2018-12-30 16:09:24,641 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 [2018-12-30 16:09:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-12-30 16:09:24,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 899. [2018-12-30 16:09:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-12-30 16:09:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1409 transitions. [2018-12-30 16:09:24,669 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1409 transitions. Word has length 154 [2018-12-30 16:09:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:24,669 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1409 transitions. [2018-12-30 16:09:24,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1409 transitions. [2018-12-30 16:09:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-30 16:09:24,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:24,673 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] [2018-12-30 16:09:24,674 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:24,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:24,675 INFO L82 PathProgramCache]: Analyzing trace with hash 579021766, now seen corresponding path program 1 times [2018-12-30 16:09:24,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:24,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:24,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:24,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:24,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-30 16:09:24,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:24,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:24,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:24,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:24,763 INFO L87 Difference]: Start difference. First operand 899 states and 1409 transitions. Second operand 3 states. [2018-12-30 16:09:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:24,989 INFO L93 Difference]: Finished difference Result 1795 states and 2811 transitions. [2018-12-30 16:09:24,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:24,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2018-12-30 16:09:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:24,995 INFO L225 Difference]: With dead ends: 1795 [2018-12-30 16:09:24,995 INFO L226 Difference]: Without dead ends: 899 [2018-12-30 16:09:24,996 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 [2018-12-30 16:09:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-12-30 16:09:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 895. [2018-12-30 16:09:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-30 16:09:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1395 transitions. [2018-12-30 16:09:25,024 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1395 transitions. Word has length 155 [2018-12-30 16:09:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:25,025 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1395 transitions. [2018-12-30 16:09:25,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1395 transitions. [2018-12-30 16:09:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-30 16:09:25,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:25,029 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] [2018-12-30 16:09:25,029 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:25,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1624823262, now seen corresponding path program 1 times [2018-12-30 16:09:25,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:25,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:25,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:25,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:25,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-12-30 16:09:25,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:25,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:25,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:25,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:25,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:25,118 INFO L87 Difference]: Start difference. First operand 895 states and 1395 transitions. Second operand 3 states. [2018-12-30 16:09:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:25,308 INFO L93 Difference]: Finished difference Result 1855 states and 2891 transitions. [2018-12-30 16:09:25,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:25,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2018-12-30 16:09:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:25,314 INFO L225 Difference]: With dead ends: 1855 [2018-12-30 16:09:25,315 INFO L226 Difference]: Without dead ends: 967 [2018-12-30 16:09:25,317 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 [2018-12-30 16:09:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-12-30 16:09:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 963. [2018-12-30 16:09:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-12-30 16:09:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1493 transitions. [2018-12-30 16:09:25,353 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1493 transitions. Word has length 185 [2018-12-30 16:09:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:25,353 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 1493 transitions. [2018-12-30 16:09:25,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1493 transitions. [2018-12-30 16:09:25,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-30 16:09:25,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:25,359 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] [2018-12-30 16:09:25,359 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:25,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1103681317, now seen corresponding path program 1 times [2018-12-30 16:09:25,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:25,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:25,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:25,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:25,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-12-30 16:09:25,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:25,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:25,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:25,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:25,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:25,473 INFO L87 Difference]: Start difference. First operand 963 states and 1493 transitions. Second operand 3 states. [2018-12-30 16:09:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:25,664 INFO L93 Difference]: Finished difference Result 1923 states and 2979 transitions. [2018-12-30 16:09:25,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:25,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-12-30 16:09:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:25,674 INFO L225 Difference]: With dead ends: 1923 [2018-12-30 16:09:25,674 INFO L226 Difference]: Without dead ends: 963 [2018-12-30 16:09:25,676 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 [2018-12-30 16:09:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-30 16:09:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 959. [2018-12-30 16:09:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-12-30 16:09:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1477 transitions. [2018-12-30 16:09:25,704 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1477 transitions. Word has length 186 [2018-12-30 16:09:25,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:25,705 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1477 transitions. [2018-12-30 16:09:25,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1477 transitions. [2018-12-30 16:09:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-30 16:09:25,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:25,709 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] [2018-12-30 16:09:25,709 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:25,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:25,709 INFO L82 PathProgramCache]: Analyzing trace with hash 550080402, now seen corresponding path program 1 times [2018-12-30 16:09:25,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:25,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:25,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:25,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:25,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-12-30 16:09:25,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:25,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:25,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:25,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:25,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:25,811 INFO L87 Difference]: Start difference. First operand 959 states and 1477 transitions. Second operand 3 states. [2018-12-30 16:09:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:26,994 INFO L93 Difference]: Finished difference Result 1987 states and 3067 transitions. [2018-12-30 16:09:26,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:26,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2018-12-30 16:09:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:27,000 INFO L225 Difference]: With dead ends: 1987 [2018-12-30 16:09:27,000 INFO L226 Difference]: Without dead ends: 1035 [2018-12-30 16:09:27,001 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 [2018-12-30 16:09:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-12-30 16:09:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2018-12-30 16:09:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2018-12-30 16:09:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1541 transitions. [2018-12-30 16:09:27,029 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1541 transitions. Word has length 203 [2018-12-30 16:09:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:27,030 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 1541 transitions. [2018-12-30 16:09:27,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1541 transitions. [2018-12-30 16:09:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-30 16:09:27,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:27,034 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] [2018-12-30 16:09:27,034 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:27,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:27,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1613413310, now seen corresponding path program 1 times [2018-12-30 16:09:27,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:27,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:27,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:27,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:27,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-12-30 16:09:27,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:27,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:27,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:27,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:27,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:27,140 INFO L87 Difference]: Start difference. First operand 1009 states and 1541 transitions. Second operand 3 states. [2018-12-30 16:09:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:27,470 INFO L93 Difference]: Finished difference Result 2037 states and 3113 transitions. [2018-12-30 16:09:27,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:27,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-12-30 16:09:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:27,478 INFO L225 Difference]: With dead ends: 2037 [2018-12-30 16:09:27,478 INFO L226 Difference]: Without dead ends: 1035 [2018-12-30 16:09:27,480 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 [2018-12-30 16:09:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-12-30 16:09:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2018-12-30 16:09:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2018-12-30 16:09:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1523 transitions. [2018-12-30 16:09:27,511 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1523 transitions. Word has length 204 [2018-12-30 16:09:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:27,511 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 1523 transitions. [2018-12-30 16:09:27,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1523 transitions. [2018-12-30 16:09:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-30 16:09:27,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:27,516 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] [2018-12-30 16:09:27,516 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:27,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:27,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1583018131, now seen corresponding path program 1 times [2018-12-30 16:09:27,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:27,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:27,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:27,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:27,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-12-30 16:09:27,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:27,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:27,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:27,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:27,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:27,587 INFO L87 Difference]: Start difference. First operand 1009 states and 1523 transitions. Second operand 3 states. [2018-12-30 16:09:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:27,861 INFO L93 Difference]: Finished difference Result 2019 states and 3045 transitions. [2018-12-30 16:09:27,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:27,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2018-12-30 16:09:27,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:27,866 INFO L225 Difference]: With dead ends: 2019 [2018-12-30 16:09:27,866 INFO L226 Difference]: Without dead ends: 1017 [2018-12-30 16:09:27,868 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 [2018-12-30 16:09:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-12-30 16:09:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1009. [2018-12-30 16:09:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2018-12-30 16:09:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1511 transitions. [2018-12-30 16:09:27,898 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1511 transitions. Word has length 216 [2018-12-30 16:09:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:27,898 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 1511 transitions. [2018-12-30 16:09:27,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1511 transitions. [2018-12-30 16:09:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-30 16:09:27,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:27,902 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] [2018-12-30 16:09:27,903 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:27,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1099234138, now seen corresponding path program 1 times [2018-12-30 16:09:27,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:27,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:27,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:27,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:27,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-12-30 16:09:28,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:28,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:28,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:28,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:28,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:28,013 INFO L87 Difference]: Start difference. First operand 1009 states and 1511 transitions. Second operand 3 states. [2018-12-30 16:09:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:28,601 INFO L93 Difference]: Finished difference Result 2019 states and 3021 transitions. [2018-12-30 16:09:28,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:28,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2018-12-30 16:09:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:28,609 INFO L225 Difference]: With dead ends: 2019 [2018-12-30 16:09:28,609 INFO L226 Difference]: Without dead ends: 999 [2018-12-30 16:09:28,611 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 [2018-12-30 16:09:28,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-12-30 16:09:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 991. [2018-12-30 16:09:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2018-12-30 16:09:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1473 transitions. [2018-12-30 16:09:28,644 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1473 transitions. Word has length 217 [2018-12-30 16:09:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:28,644 INFO L480 AbstractCegarLoop]: Abstraction has 991 states and 1473 transitions. [2018-12-30 16:09:28,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1473 transitions. [2018-12-30 16:09:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-30 16:09:28,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:28,649 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] [2018-12-30 16:09:28,649 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:28,650 INFO L82 PathProgramCache]: Analyzing trace with hash -30789295, now seen corresponding path program 1 times [2018-12-30 16:09:28,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:28,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:28,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:28,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:28,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-12-30 16:09:28,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:28,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:28,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:28,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:28,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:28,765 INFO L87 Difference]: Start difference. First operand 991 states and 1473 transitions. Second operand 3 states. [2018-12-30 16:09:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:29,619 INFO L93 Difference]: Finished difference Result 2029 states and 3019 transitions. [2018-12-30 16:09:29,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:29,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2018-12-30 16:09:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:29,625 INFO L225 Difference]: With dead ends: 2029 [2018-12-30 16:09:29,625 INFO L226 Difference]: Without dead ends: 1045 [2018-12-30 16:09:29,626 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 [2018-12-30 16:09:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2018-12-30 16:09:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1037. [2018-12-30 16:09:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-12-30 16:09:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1527 transitions. [2018-12-30 16:09:29,653 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1527 transitions. Word has length 224 [2018-12-30 16:09:29,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:29,653 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1527 transitions. [2018-12-30 16:09:29,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1527 transitions. [2018-12-30 16:09:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-30 16:09:29,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:29,659 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] [2018-12-30 16:09:29,659 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:29,659 INFO L82 PathProgramCache]: Analyzing trace with hash 812836165, now seen corresponding path program 1 times [2018-12-30 16:09:29,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:29,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:29,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:29,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:29,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2018-12-30 16:09:29,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:29,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:29,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:29,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:29,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:29,748 INFO L87 Difference]: Start difference. First operand 1037 states and 1527 transitions. Second operand 3 states. [2018-12-30 16:09:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:29,912 INFO L93 Difference]: Finished difference Result 2075 states and 3053 transitions. [2018-12-30 16:09:29,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:29,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-12-30 16:09:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:29,917 INFO L225 Difference]: With dead ends: 2075 [2018-12-30 16:09:29,917 INFO L226 Difference]: Without dead ends: 1037 [2018-12-30 16:09:29,918 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 [2018-12-30 16:09:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-12-30 16:09:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1029. [2018-12-30 16:09:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2018-12-30 16:09:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1495 transitions. [2018-12-30 16:09:29,941 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1495 transitions. Word has length 225 [2018-12-30 16:09:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:29,942 INFO L480 AbstractCegarLoop]: Abstraction has 1029 states and 1495 transitions. [2018-12-30 16:09:29,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1495 transitions. [2018-12-30 16:09:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-30 16:09:29,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:29,944 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] [2018-12-30 16:09:29,944 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:29,945 INFO L82 PathProgramCache]: Analyzing trace with hash 497301888, now seen corresponding path program 1 times [2018-12-30 16:09:29,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:29,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:29,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:29,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:29,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-30 16:09:30,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:09:30,139 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 [2018-12-30 16:09:30,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:30,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:09:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-30 16:09:30,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:09:30,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 16:09:30,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:09:30,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:09:30,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:09:30,544 INFO L87 Difference]: Start difference. First operand 1029 states and 1495 transitions. Second operand 5 states. [2018-12-30 16:09:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:33,437 INFO L93 Difference]: Finished difference Result 4090 states and 5918 transitions. [2018-12-30 16:09:33,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 16:09:33,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2018-12-30 16:09:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:33,454 INFO L225 Difference]: With dead ends: 4090 [2018-12-30 16:09:33,455 INFO L226 Difference]: Without dead ends: 3035 [2018-12-30 16:09:33,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-30 16:09:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2018-12-30 16:09:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 1740. [2018-12-30 16:09:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1740 states. [2018-12-30 16:09:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2496 transitions. [2018-12-30 16:09:33,537 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2496 transitions. Word has length 261 [2018-12-30 16:09:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:33,538 INFO L480 AbstractCegarLoop]: Abstraction has 1740 states and 2496 transitions. [2018-12-30 16:09:33,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:09:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2496 transitions. [2018-12-30 16:09:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-30 16:09:33,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:33,545 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:33,545 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:33,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:33,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1933393930, now seen corresponding path program 1 times [2018-12-30 16:09:33,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:33,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:33,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:33,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:33,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-30 16:09:33,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:33,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:33,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:33,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:33,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:33,726 INFO L87 Difference]: Start difference. First operand 1740 states and 2496 transitions. Second operand 3 states. [2018-12-30 16:09:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:33,975 INFO L93 Difference]: Finished difference Result 4813 states and 6857 transitions. [2018-12-30 16:09:33,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:33,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2018-12-30 16:09:33,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:33,994 INFO L225 Difference]: With dead ends: 4813 [2018-12-30 16:09:33,994 INFO L226 Difference]: Without dead ends: 3080 [2018-12-30 16:09:33,997 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 [2018-12-30 16:09:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3080 states. [2018-12-30 16:09:34,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3080 to 3078. [2018-12-30 16:09:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3078 states. [2018-12-30 16:09:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4362 transitions. [2018-12-30 16:09:34,134 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4362 transitions. Word has length 268 [2018-12-30 16:09:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:34,134 INFO L480 AbstractCegarLoop]: Abstraction has 3078 states and 4362 transitions. [2018-12-30 16:09:34,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4362 transitions. [2018-12-30 16:09:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-12-30 16:09:34,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:34,141 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:34,143 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:34,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:34,143 INFO L82 PathProgramCache]: Analyzing trace with hash -333999477, now seen corresponding path program 1 times [2018-12-30 16:09:34,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:34,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:34,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:34,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:34,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-12-30 16:09:34,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:34,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:34,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:34,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:34,303 INFO L87 Difference]: Start difference. First operand 3078 states and 4362 transitions. Second operand 3 states. [2018-12-30 16:09:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:34,783 INFO L93 Difference]: Finished difference Result 6269 states and 8893 transitions. [2018-12-30 16:09:34,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:34,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2018-12-30 16:09:34,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:34,792 INFO L225 Difference]: With dead ends: 6269 [2018-12-30 16:09:34,793 INFO L226 Difference]: Without dead ends: 1949 [2018-12-30 16:09:34,798 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 [2018-12-30 16:09:34,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2018-12-30 16:09:34,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1942. [2018-12-30 16:09:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2018-12-30 16:09:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2018-12-30 16:09:34,867 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 305 [2018-12-30 16:09:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:34,867 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2018-12-30 16:09:34,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2018-12-30 16:09:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-12-30 16:09:34,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:34,875 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:34,875 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:34,875 INFO L82 PathProgramCache]: Analyzing trace with hash -722402039, now seen corresponding path program 1 times [2018-12-30 16:09:34,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:34,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:34,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:34,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:34,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-12-30 16:09:35,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:09:35,302 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 [2018-12-30 16:09:35,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:35,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:09:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-12-30 16:09:35,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:09:35,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:09:35,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:09:35,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:09:35,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:09:35,728 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 4 states. [2018-12-30 16:09:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:36,099 INFO L93 Difference]: Finished difference Result 4797 states and 6654 transitions. [2018-12-30 16:09:36,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:09:36,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2018-12-30 16:09:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:36,116 INFO L225 Difference]: With dead ends: 4797 [2018-12-30 16:09:36,117 INFO L226 Difference]: Without dead ends: 2724 [2018-12-30 16:09:36,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:09:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2018-12-30 16:09:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 1942. [2018-12-30 16:09:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2018-12-30 16:09:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2018-12-30 16:09:36,200 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 599 [2018-12-30 16:09:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:36,202 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2018-12-30 16:09:36,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:09:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2018-12-30 16:09:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-12-30 16:09:36,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:36,210 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:36,210 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:36,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash 914135564, now seen corresponding path program 1 times [2018-12-30 16:09:36,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:36,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:36,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:36,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:36,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2018-12-30 16:09:36,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:36,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:36,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:36,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:36,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:36,620 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 3 states. [2018-12-30 16:09:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:37,481 INFO L93 Difference]: Finished difference Result 3917 states and 5403 transitions. [2018-12-30 16:09:37,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:37,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 669 [2018-12-30 16:09:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:37,489 INFO L225 Difference]: With dead ends: 3917 [2018-12-30 16:09:37,489 INFO L226 Difference]: Without dead ends: 1982 [2018-12-30 16:09:37,492 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 [2018-12-30 16:09:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2018-12-30 16:09:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1942. [2018-12-30 16:09:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2018-12-30 16:09:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2663 transitions. [2018-12-30 16:09:37,565 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2663 transitions. Word has length 669 [2018-12-30 16:09:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:37,565 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 2663 transitions. [2018-12-30 16:09:37,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2663 transitions. [2018-12-30 16:09:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2018-12-30 16:09:37,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:37,574 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:37,575 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash 551234930, now seen corresponding path program 1 times [2018-12-30 16:09:37,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:37,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:37,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:37,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:37,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2018-12-30 16:09:37,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:37,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:37,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:37,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:37,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:37,958 INFO L87 Difference]: Start difference. First operand 1942 states and 2663 transitions. Second operand 3 states. [2018-12-30 16:09:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:38,187 INFO L93 Difference]: Finished difference Result 3892 states and 5332 transitions. [2018-12-30 16:09:38,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:38,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2018-12-30 16:09:38,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:38,194 INFO L225 Difference]: With dead ends: 3892 [2018-12-30 16:09:38,194 INFO L226 Difference]: Without dead ends: 1957 [2018-12-30 16:09:38,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 [2018-12-30 16:09:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2018-12-30 16:09:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1929. [2018-12-30 16:09:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2018-12-30 16:09:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2604 transitions. [2018-12-30 16:09:38,248 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2604 transitions. Word has length 683 [2018-12-30 16:09:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:38,249 INFO L480 AbstractCegarLoop]: Abstraction has 1929 states and 2604 transitions. [2018-12-30 16:09:38,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2604 transitions. [2018-12-30 16:09:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-12-30 16:09:38,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:38,255 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:38,255 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:38,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:38,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1986025501, now seen corresponding path program 1 times [2018-12-30 16:09:38,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:38,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:38,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:38,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:38,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2018-12-30 16:09:38,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:38,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:38,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:38,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:38,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:38,547 INFO L87 Difference]: Start difference. First operand 1929 states and 2604 transitions. Second operand 3 states. [2018-12-30 16:09:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:38,769 INFO L93 Difference]: Finished difference Result 3921 states and 5296 transitions. [2018-12-30 16:09:38,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:38,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 711 [2018-12-30 16:09:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:38,774 INFO L225 Difference]: With dead ends: 3921 [2018-12-30 16:09:38,775 INFO L226 Difference]: Without dead ends: 1981 [2018-12-30 16:09:38,778 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 [2018-12-30 16:09:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2018-12-30 16:09:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2018-12-30 16:09:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2018-12-30 16:09:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2649 transitions. [2018-12-30 16:09:38,852 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2649 transitions. Word has length 711 [2018-12-30 16:09:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:38,852 INFO L480 AbstractCegarLoop]: Abstraction has 1971 states and 2649 transitions. [2018-12-30 16:09:38,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2649 transitions. [2018-12-30 16:09:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2018-12-30 16:09:38,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:38,861 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:38,862 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:38,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:38,862 INFO L82 PathProgramCache]: Analyzing trace with hash -120199639, now seen corresponding path program 1 times [2018-12-30 16:09:38,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:38,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:38,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:38,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:38,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2018-12-30 16:09:39,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:39,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:39,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:39,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:39,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:39,162 INFO L87 Difference]: Start difference. First operand 1971 states and 2649 transitions. Second operand 3 states. [2018-12-30 16:09:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:39,575 INFO L93 Difference]: Finished difference Result 2519 states and 3369 transitions. [2018-12-30 16:09:39,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:39,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 726 [2018-12-30 16:09:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:39,577 INFO L225 Difference]: With dead ends: 2519 [2018-12-30 16:09:39,577 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:09:39,580 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 [2018-12-30 16:09:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:09:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:09:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:09:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:09:39,580 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 726 [2018-12-30 16:09:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:39,581 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:09:39,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:09:39,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:09:39,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:09:39,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:39,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:40,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:40,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:40,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:40,435 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 141 [2018-12-30 16:09:40,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:40,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:40,827 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 141 [2018-12-30 16:09:40,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:40,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:40,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:40,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:40,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:42,566 WARN L181 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2018-12-30 16:09:43,227 WARN L181 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2018-12-30 16:09:43,358 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2018-12-30 16:09:45,203 WARN L181 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2018-12-30 16:09:45,566 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2018-12-30 16:09:45,952 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-12-30 16:09:46,222 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2018-12-30 16:09:46,576 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2018-12-30 16:09:47,384 WARN L181 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2018-12-30 16:09:47,693 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2018-12-30 16:09:47,990 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2018-12-30 16:09:48,182 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-12-30 16:09:48,606 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2018-12-30 16:09:48,947 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 90 [2018-12-30 16:09:49,232 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2018-12-30 16:09:49,891 WARN L181 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 69 [2018-12-30 16:09:50,176 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2018-12-30 16:09:50,798 WARN L181 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 69 [2018-12-30 16:09:51,473 WARN L181 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2018-12-30 16:09:51,800 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2018-12-30 16:09:52,088 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2018-12-30 16:09:53,219 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2018-12-30 16:09:53,222 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 367) no Hoare annotation was computed. [2018-12-30 16:09:53,222 INFO L448 ceAbstractionStarter]: For program point L333-1(lines 333 367) no Hoare annotation was computed. [2018-12-30 16:09:53,222 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 545) no Hoare annotation was computed. [2018-12-30 16:09:53,222 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 556) no Hoare annotation was computed. [2018-12-30 16:09:53,223 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 567) no Hoare annotation was computed. [2018-12-30 16:09:53,223 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 578) no Hoare annotation was computed. [2018-12-30 16:09:53,223 INFO L451 ceAbstractionStarter]: At program point L598(lines 98 599) the Hoare annotation is: true [2018-12-30 16:09:53,223 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 534) no Hoare annotation was computed. [2018-12-30 16:09:53,223 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-12-30 16:09:53,223 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-12-30 16:09:53,223 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 364) no Hoare annotation was computed. [2018-12-30 16:09:53,229 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 546) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) [2018-12-30 16:09:53,229 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 578) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) [2018-12-30 16:09:53,229 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 544) no Hoare annotation was computed. [2018-12-30 16:09:53,229 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 555) no Hoare annotation was computed. [2018-12-30 16:09:53,232 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 566) no Hoare annotation was computed. [2018-12-30 16:09:53,233 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 577) no Hoare annotation was computed. [2018-12-30 16:09:53,233 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 311) no Hoare annotation was computed. [2018-12-30 16:09:53,233 INFO L448 ceAbstractionStarter]: For program point L304-2(lines 304 311) no Hoare annotation was computed. [2018-12-30 16:09:53,233 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 544) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2018-12-30 16:09:53,233 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 556) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse17 .cse18 .cse19 .cse20 .cse21) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2018-12-30 16:09:53,233 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 567) the Hoare annotation is: (let ((.cse0 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:53,234 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 605) no Hoare annotation was computed. [2018-12-30 16:09:53,234 INFO L448 ceAbstractionStarter]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2018-12-30 16:09:53,234 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 507) no Hoare annotation was computed. [2018-12-30 16:09:53,234 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 362) no Hoare annotation was computed. [2018-12-30 16:09:53,234 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 544) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2018-12-30 16:09:53,234 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 554) no Hoare annotation was computed. [2018-12-30 16:09:53,234 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 565) no Hoare annotation was computed. [2018-12-30 16:09:53,234 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 576) no Hoare annotation was computed. [2018-12-30 16:09:53,234 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2018-12-30 16:09:53,234 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 541) no Hoare annotation was computed. [2018-12-30 16:09:53,235 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2018-12-30 16:09:53,235 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2018-12-30 16:09:53,235 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 346) no Hoare annotation was computed. [2018-12-30 16:09:53,235 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 346) no Hoare annotation was computed. [2018-12-30 16:09:53,235 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2018-12-30 16:09:53,235 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 553) no Hoare annotation was computed. [2018-12-30 16:09:53,235 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 564) no Hoare annotation was computed. [2018-12-30 16:09:53,235 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 575) no Hoare annotation was computed. [2018-12-30 16:09:53,235 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2018-12-30 16:09:53,235 INFO L448 ceAbstractionStarter]: For program point L475-2(lines 208 541) no Hoare annotation was computed. [2018-12-30 16:09:53,235 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 408) no Hoare annotation was computed. [2018-12-30 16:09:53,236 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2018-12-30 16:09:53,240 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 577) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0)) (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:53,240 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 554) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:53,241 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 565) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-12-30 16:09:53,241 INFO L451 ceAbstractionStarter]: At program point L608(lines 11 610) the Hoare annotation is: true [2018-12-30 16:09:53,241 INFO L444 ceAbstractionStarter]: At program point L542(lines 99 597) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2018-12-30 16:09:53,241 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2018-12-30 16:09:53,241 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 383) no Hoare annotation was computed. [2018-12-30 16:09:53,241 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 552) no Hoare annotation was computed. [2018-12-30 16:09:53,241 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 563) no Hoare annotation was computed. [2018-12-30 16:09:53,241 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 574) no Hoare annotation was computed. [2018-12-30 16:09:53,242 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2018-12-30 16:09:53,242 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 514) no Hoare annotation was computed. [2018-12-30 16:09:53,242 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 595) no Hoare annotation was computed. [2018-12-30 16:09:53,242 INFO L444 ceAbstractionStarter]: At program point L513(lines 72 609) the Hoare annotation is: false [2018-12-30 16:09:53,242 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2018-12-30 16:09:53,242 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2018-12-30 16:09:53,242 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 551) no Hoare annotation was computed. [2018-12-30 16:09:53,242 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 562) no Hoare annotation was computed. [2018-12-30 16:09:53,242 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2018-12-30 16:09:53,242 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 573) no Hoare annotation was computed. [2018-12-30 16:09:53,242 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 594) no Hoare annotation was computed. [2018-12-30 16:09:53,243 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 485) no Hoare annotation was computed. [2018-12-30 16:09:53,245 INFO L448 ceAbstractionStarter]: For program point L481-2(lines 481 485) no Hoare annotation was computed. [2018-12-30 16:09:53,245 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 552) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse17 .cse18 .cse19 .cse20 .cse21) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2018-12-30 16:09:53,245 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 563) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-12-30 16:09:53,245 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2018-12-30 16:09:53,246 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2018-12-30 16:09:53,246 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2018-12-30 16:09:53,246 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 517) no Hoare annotation was computed. [2018-12-30 16:09:53,246 INFO L448 ceAbstractionStarter]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2018-12-30 16:09:53,246 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 358) no Hoare annotation was computed. [2018-12-30 16:09:53,246 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:09:53,246 INFO L448 ceAbstractionStarter]: For program point $Ultimate##90(lines 208 543) no Hoare annotation was computed. [2018-12-30 16:09:53,246 INFO L444 ceAbstractionStarter]: At program point L351(lines 327 369) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-12-30 16:09:53,247 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 550) no Hoare annotation was computed. [2018-12-30 16:09:53,247 INFO L448 ceAbstractionStarter]: For program point $Ultimate##91(lines 208 543) no Hoare annotation was computed. [2018-12-30 16:09:53,247 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 561) no Hoare annotation was computed. [2018-12-30 16:09:53,247 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 572) no Hoare annotation was computed. [2018-12-30 16:09:53,247 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 585) no Hoare annotation was computed. [2018-12-30 16:09:53,247 INFO L448 ceAbstractionStarter]: For program point L418(lines 418 420) no Hoare annotation was computed. [2018-12-30 16:09:53,247 INFO L444 ceAbstractionStarter]: At program point L385(lines 376 408) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-12-30 16:09:53,247 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 573) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:53,253 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 355) no Hoare annotation was computed. [2018-12-30 16:09:53,253 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2018-12-30 16:09:53,253 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-12-30 16:09:53,253 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 208 541) no Hoare annotation was computed. [2018-12-30 16:09:53,253 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2018-12-30 16:09:53,253 INFO L448 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2018-12-30 16:09:53,253 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 325) no Hoare annotation was computed. [2018-12-30 16:09:53,253 INFO L448 ceAbstractionStarter]: For program point L321-2(lines 208 541) no Hoare annotation was computed. [2018-12-30 16:09:53,253 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 549) no Hoare annotation was computed. [2018-12-30 16:09:53,253 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 560) no Hoare annotation was computed. [2018-12-30 16:09:53,254 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 571) no Hoare annotation was computed. [2018-12-30 16:09:53,254 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2018-12-30 16:09:53,254 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 609) no Hoare annotation was computed. [2018-12-30 16:09:53,254 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 406) no Hoare annotation was computed. [2018-12-30 16:09:53,254 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:09:53,254 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 550) the Hoare annotation is: (let ((.cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse3 .cse2 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2018-12-30 16:09:53,254 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 561) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-12-30 16:09:53,255 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 571) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) [2018-12-30 16:09:53,255 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-12-30 16:09:53,255 INFO L451 ceAbstractionStarter]: At program point L620(lines 611 622) the Hoare annotation is: true [2018-12-30 16:09:53,255 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2018-12-30 16:09:53,255 INFO L448 ceAbstractionStarter]: For program point L588(lines 588 592) no Hoare annotation was computed. [2018-12-30 16:09:53,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2018-12-30 16:09:53,255 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 548) no Hoare annotation was computed. [2018-12-30 16:09:53,255 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 559) no Hoare annotation was computed. [2018-12-30 16:09:53,256 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 570) no Hoare annotation was computed. [2018-12-30 16:09:53,259 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2018-12-30 16:09:53,259 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-12-30 16:09:53,259 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-12-30 16:09:53,259 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 541) no Hoare annotation was computed. [2018-12-30 16:09:53,259 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:09:53,259 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 494) no Hoare annotation was computed. [2018-12-30 16:09:53,259 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2018-12-30 16:09:53,259 INFO L448 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2018-12-30 16:09:53,259 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 426 434) no Hoare annotation was computed. [2018-12-30 16:09:53,260 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2018-12-30 16:09:53,260 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 547) no Hoare annotation was computed. [2018-12-30 16:09:53,260 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 558) no Hoare annotation was computed. [2018-12-30 16:09:53,260 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 569) no Hoare annotation was computed. [2018-12-30 16:09:53,260 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 548) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:53,260 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 559) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-12-30 16:09:53,260 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2018-12-30 16:09:53,261 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 368) no Hoare annotation was computed. [2018-12-30 16:09:53,261 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 546) no Hoare annotation was computed. [2018-12-30 16:09:53,261 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 557) no Hoare annotation was computed. [2018-12-30 16:09:53,261 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 568) no Hoare annotation was computed. [2018-12-30 16:09:53,261 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 597) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2018-12-30 16:09:53,261 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 535) no Hoare annotation was computed. [2018-12-30 16:09:53,261 INFO L448 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2018-12-30 16:09:53,261 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2018-12-30 16:09:53,261 INFO L448 ceAbstractionStarter]: For program point L496-2(lines 208 541) no Hoare annotation was computed. [2018-12-30 16:09:53,264 INFO L444 ceAbstractionStarter]: At program point L397(lines 388 406) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-12-30 16:09:53,264 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2018-12-30 16:09:53,264 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 557) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11 .cse12 .cse13) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:53,264 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 570) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:09:53,265 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 16:09:53,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:09:53 BoogieIcfgContainer [2018-12-30 16:09:53,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:09:53,372 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:09:53,372 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:09:53,372 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:09:53,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:09:10" (3/4) ... [2018-12-30 16:09:53,384 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:09:53,408 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 16:09:53,409 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:09:53,577 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:09:53,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:09:53,579 INFO L168 Benchmark]: Toolchain (without parser) took 44924.24 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 978.3 MB). Free memory was 951.4 MB in the beginning and 1.4 GB in the end (delta: -492.5 MB). Peak memory consumption was 485.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:53,581 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:09:53,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.57 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:53,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 174.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:53,582 INFO L168 Benchmark]: Boogie Preprocessor took 45.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:09:53,584 INFO L168 Benchmark]: RCFGBuilder took 1470.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:53,584 INFO L168 Benchmark]: TraceAbstraction took 42453.77 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 865.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -405.4 MB). Peak memory consumption was 939.2 MB. Max. memory is 11.5 GB. [2018-12-30 16:09:53,586 INFO L168 Benchmark]: Witness Printer took 205.03 ms. Allocated memory is still 2.0 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:09:53,590 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 564.57 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 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 174.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1470.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42453.77 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 865.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -405.4 MB). Peak memory consumption was 939.2 MB. Max. memory is 11.5 GB. * Witness Printer took 205.03 ms. Allocated memory is still 2.0 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8576 == s__state)) && s__s3__tmp__next_state___0 <= 3) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || (((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8544 == s__state)) && !(8545 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(8609 == s__state) && !(8497 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8592 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((((((((((((((((((((((((blastFlag <= 2 && !(8609 == s__state)) && !(8497 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((s__state <= 8672 && 8448 <= s__state) && (((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (s__state <= 8448 && blastFlag <= 2 && !(8448 == s__state)) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || ((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672)) || s__state <= 3) || (blastFlag <= 3 && !(s__hit == 0))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((blastFlag <= 3 && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || ((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672)) || s__state <= 3) || (blastFlag <= 3 && !(s__hit == 0))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((s__state <= 8672 && 8448 <= s__state) && (((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. SAFE Result, 42.2s OverallTime, 35 OverallIterations, 25 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 13.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 5377 SDtfs, 5141 SDslu, 2062 SDs, 0 SdLazy, 3586 SolverSat, 1406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 949 GetRequests, 906 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3078occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 2330 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 217 NumberOfFragments, 2993 HoareAnnotationTreeSize, 28 FomulaSimplifications, 50067 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 28 FomulaSimplificationsInter, 8865 FormulaSimplificationTreeSizeReductionInter, 12.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 8605 NumberOfCodeBlocks, 8605 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 8568 ConstructedInterpolants, 0 QuantifiedInterpolants, 4199413 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1341 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 37 InterpolantComputations, 34 PerfectInterpolantSequences, 37743/37821 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...