./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_4_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_srvr_4_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 a9636d7d6107e60711fab246dfc2abf2798468aa .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 14:58:30,305 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:58:30,307 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:58:30,318 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:58:30,319 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:58:30,320 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:58:30,321 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:58:30,323 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:58:30,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:58:30,325 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:58:30,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:58:30,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:58:30,328 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:58:30,329 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:58:30,330 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:58:30,331 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:58:30,331 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:58:30,333 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:58:30,335 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:58:30,337 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:58:30,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:58:30,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:58:30,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:58:30,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:58:30,342 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:58:30,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:58:30,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:58:30,354 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:58:30,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:58:30,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:58:30,356 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:58:30,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:58:30,357 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:58:30,357 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:58:30,359 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:58:30,360 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:58:30,360 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 14:58:30,375 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:58:30,375 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:58:30,376 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:58:30,376 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:58:30,376 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:58:30,377 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:58:30,377 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:58:30,378 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:58:30,378 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:58:30,378 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:58:30,378 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:58:30,378 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:58:30,378 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:58:30,379 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:58:30,379 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:58:30,379 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:58:30,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:58:30,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:58:30,380 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:58:30,381 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:58:30,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:58:30,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:58:30,382 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:58:30,382 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:58:30,382 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:58:30,382 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:58:30,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:58:30,383 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 -> a9636d7d6107e60711fab246dfc2abf2798468aa [2019-01-14 14:58:30,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:58:30,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:58:30,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:58:30,446 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:58:30,446 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:58:30,447 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_4_true-unreach-call_false-termination.cil.c [2019-01-14 14:58:30,507 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da380f111/fc4d8a08bb7f4da5bfea3cb82aa60017/FLAG5a8ccf1d9 [2019-01-14 14:58:30,926 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:58:30,927 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_4_true-unreach-call_false-termination.cil.c [2019-01-14 14:58:30,946 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da380f111/fc4d8a08bb7f4da5bfea3cb82aa60017/FLAG5a8ccf1d9 [2019-01-14 14:58:31,289 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da380f111/fc4d8a08bb7f4da5bfea3cb82aa60017 [2019-01-14 14:58:31,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:58:31,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:58:31,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:58:31,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:58:31,300 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:58:31,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:58:31" (1/1) ... [2019-01-14 14:58:31,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff06185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31, skipping insertion in model container [2019-01-14 14:58:31,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:58:31" (1/1) ... [2019-01-14 14:58:31,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:58:31,361 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:58:31,670 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:58:31,674 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:58:31,762 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:58:31,782 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:58:31,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31 WrapperNode [2019-01-14 14:58:31,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:58:31,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:58:31,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:58:31,784 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:58:31,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31" (1/1) ... [2019-01-14 14:58:31,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31" (1/1) ... [2019-01-14 14:58:31,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:58:31,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:58:31,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:58:31,929 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:58:31,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31" (1/1) ... [2019-01-14 14:58:31,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31" (1/1) ... [2019-01-14 14:58:31,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31" (1/1) ... [2019-01-14 14:58:31,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31" (1/1) ... [2019-01-14 14:58:31,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31" (1/1) ... [2019-01-14 14:58:31,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31" (1/1) ... [2019-01-14 14:58:31,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31" (1/1) ... [2019-01-14 14:58:31,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:58:32,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:58:32,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:58:32,001 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:58:32,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:58:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:58:32,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:58:32,250 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 14:58:33,424 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-14 14:58:33,425 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-14 14:58:33,426 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:58:33,426 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 14:58:33,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:58:33 BoogieIcfgContainer [2019-01-14 14:58:33,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:58:33,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:58:33,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:58:33,434 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:58:33,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:58:31" (1/3) ... [2019-01-14 14:58:33,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65623432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:58:33, skipping insertion in model container [2019-01-14 14:58:33,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:31" (2/3) ... [2019-01-14 14:58:33,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65623432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:58:33, skipping insertion in model container [2019-01-14 14:58:33,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:58:33" (3/3) ... [2019-01-14 14:58:33,439 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_4_true-unreach-call_false-termination.cil.c [2019-01-14 14:58:33,449 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:58:33,456 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:58:33,471 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:58:33,503 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:58:33,504 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:58:33,504 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:58:33,504 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:58:33,505 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:58:33,505 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:58:33,505 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:58:33,505 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:58:33,505 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:58:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-01-14 14:58:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 14:58:33,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:33,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:33,550 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:33,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:33,555 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-01-14 14:58:33,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:33,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:33,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:33,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:33,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:33,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:33,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:33,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:33,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:33,817 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-01-14 14:58:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:34,510 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-01-14 14:58:34,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:34,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-14 14:58:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:34,528 INFO L225 Difference]: With dead ends: 327 [2019-01-14 14:58:34,528 INFO L226 Difference]: Without dead ends: 174 [2019-01-14 14:58:34,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:34,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-14 14:58:34,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-01-14 14:58:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-14 14:58:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-01-14 14:58:34,589 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-01-14 14:58:34,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:34,590 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-01-14 14:58:34,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-01-14 14:58:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 14:58:34,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:34,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:34,593 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-01-14 14:58:34,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:34,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:34,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:34,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:34,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:34,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:34,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:34,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:34,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:34,744 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-01-14 14:58:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:35,393 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-01-14 14:58:35,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:35,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-14 14:58:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:35,400 INFO L225 Difference]: With dead ends: 379 [2019-01-14 14:58:35,400 INFO L226 Difference]: Without dead ends: 215 [2019-01-14 14:58:35,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-14 14:58:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-01-14 14:58:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-14 14:58:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-01-14 14:58:35,426 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-01-14 14:58:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:35,427 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-01-14 14:58:35,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-01-14 14:58:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 14:58:35,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:35,438 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:35,438 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash 25102818, now seen corresponding path program 1 times [2019-01-14 14:58:35,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:35,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:35,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:35,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:35,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:35,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:35,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:35,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:35,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:35,535 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-01-14 14:58:35,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:35,883 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-01-14 14:58:35,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:35,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-14 14:58:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:35,887 INFO L225 Difference]: With dead ends: 444 [2019-01-14 14:58:35,887 INFO L226 Difference]: Without dead ends: 241 [2019-01-14 14:58:35,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-14 14:58:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-01-14 14:58:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-14 14:58:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-01-14 14:58:35,909 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-01-14 14:58:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:35,910 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-01-14 14:58:35,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-01-14 14:58:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 14:58:35,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:35,914 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:35,914 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:35,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1824447496, now seen corresponding path program 1 times [2019-01-14 14:58:35,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:35,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:35,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 14:58:35,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:35,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:36,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:36,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:36,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:36,001 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-01-14 14:58:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:36,302 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-01-14 14:58:36,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:36,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-14 14:58:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:36,306 INFO L225 Difference]: With dead ends: 492 [2019-01-14 14:58:36,306 INFO L226 Difference]: Without dead ends: 258 [2019-01-14 14:58:36,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-14 14:58:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-01-14 14:58:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-14 14:58:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-01-14 14:58:36,327 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-01-14 14:58:36,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:36,328 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-01-14 14:58:36,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-01-14 14:58:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 14:58:36,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:36,331 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:36,332 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:36,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:36,332 INFO L82 PathProgramCache]: Analyzing trace with hash 471399807, now seen corresponding path program 1 times [2019-01-14 14:58:36,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:36,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:36,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:36,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:36,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:36,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:36,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:36,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:36,452 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-01-14 14:58:36,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:36,691 INFO L93 Difference]: Finished difference Result 552 states and 932 transitions. [2019-01-14 14:58:36,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:36,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-14 14:58:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:36,695 INFO L225 Difference]: With dead ends: 552 [2019-01-14 14:58:36,695 INFO L226 Difference]: Without dead ends: 303 [2019-01-14 14:58:36,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:36,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-14 14:58:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 298. [2019-01-14 14:58:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-14 14:58:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-01-14 14:58:36,713 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-01-14 14:58:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:36,714 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-01-14 14:58:36,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-01-14 14:58:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:58:36,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:36,717 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:36,717 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:36,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash -455139068, now seen corresponding path program 1 times [2019-01-14 14:58:36,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:36,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:36,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:36,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:36,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 14:58:36,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:36,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:36,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:36,835 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-01-14 14:58:37,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:37,449 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-01-14 14:58:37,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:37,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:58:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:37,452 INFO L225 Difference]: With dead ends: 591 [2019-01-14 14:58:37,452 INFO L226 Difference]: Without dead ends: 300 [2019-01-14 14:58:37,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-14 14:58:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-01-14 14:58:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-14 14:58:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-01-14 14:58:37,466 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-01-14 14:58:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:37,466 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-01-14 14:58:37,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-01-14 14:58:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:58:37,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:37,469 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:37,469 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:37,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:37,470 INFO L82 PathProgramCache]: Analyzing trace with hash -190163418, now seen corresponding path program 1 times [2019-01-14 14:58:37,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:37,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:37,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:37,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:37,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:37,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:37,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:37,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:37,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:37,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:37,562 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-01-14 14:58:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:38,240 INFO L93 Difference]: Finished difference Result 594 states and 996 transitions. [2019-01-14 14:58:38,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:38,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:58:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:38,244 INFO L225 Difference]: With dead ends: 594 [2019-01-14 14:58:38,244 INFO L226 Difference]: Without dead ends: 301 [2019-01-14 14:58:38,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-01-14 14:58:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2019-01-14 14:58:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-14 14:58:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-01-14 14:58:38,256 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-01-14 14:58:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:38,257 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-01-14 14:58:38,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-01-14 14:58:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 14:58:38,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:38,260 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:38,260 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:38,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:38,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1935111195, now seen corresponding path program 1 times [2019-01-14 14:58:38,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:38,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:38,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-01-14 14:58:38,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:38,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:38,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:38,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:38,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:38,329 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-01-14 14:58:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:38,712 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-01-14 14:58:38,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:38,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-14 14:58:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:38,717 INFO L225 Difference]: With dead ends: 594 [2019-01-14 14:58:38,717 INFO L226 Difference]: Without dead ends: 305 [2019-01-14 14:58:38,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-14 14:58:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-01-14 14:58:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-14 14:58:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-01-14 14:58:38,734 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-01-14 14:58:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:38,734 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-01-14 14:58:38,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-01-14 14:58:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-14 14:58:38,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:38,739 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:38,740 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:38,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:38,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1438087397, now seen corresponding path program 1 times [2019-01-14 14:58:38,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:38,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:38,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:38,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:38,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 14:58:38,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:38,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:38,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:38,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:38,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:38,834 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-01-14 14:58:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:40,234 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-01-14 14:58:40,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:40,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-14 14:58:40,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:40,237 INFO L225 Difference]: With dead ends: 634 [2019-01-14 14:58:40,237 INFO L226 Difference]: Without dead ends: 336 [2019-01-14 14:58:40,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-14 14:58:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-14 14:58:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-14 14:58:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-01-14 14:58:40,251 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-01-14 14:58:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:40,251 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-01-14 14:58:40,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-01-14 14:58:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 14:58:40,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:40,254 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:40,254 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:40,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash 384185223, now seen corresponding path program 1 times [2019-01-14 14:58:40,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:40,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:40,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 14:58:40,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:40,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:40,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:40,340 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-01-14 14:58:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:40,751 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-01-14 14:58:40,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:40,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-14 14:58:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:40,755 INFO L225 Difference]: With dead ends: 663 [2019-01-14 14:58:40,755 INFO L226 Difference]: Without dead ends: 336 [2019-01-14 14:58:40,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-14 14:58:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-14 14:58:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-14 14:58:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-01-14 14:58:40,769 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-01-14 14:58:40,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:40,769 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-01-14 14:58:40,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-01-14 14:58:40,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 14:58:40,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:40,772 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:40,772 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1845992555, now seen corresponding path program 1 times [2019-01-14 14:58:40,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:40,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:40,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:40,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:40,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 14:58:40,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:40,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:40,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:40,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:40,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:40,860 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-01-14 14:58:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:41,877 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-01-14 14:58:41,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:41,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-14 14:58:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:41,880 INFO L225 Difference]: With dead ends: 696 [2019-01-14 14:58:41,880 INFO L226 Difference]: Without dead ends: 369 [2019-01-14 14:58:41,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-14 14:58:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-01-14 14:58:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-14 14:58:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-01-14 14:58:41,893 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-01-14 14:58:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:41,893 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-01-14 14:58:41,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-01-14 14:58:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 14:58:41,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:41,897 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:41,897 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:41,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1032094409, now seen corresponding path program 1 times [2019-01-14 14:58:41,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:41,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:41,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:41,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:41,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 14:58:41,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:41,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:41,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:41,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:41,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:41,979 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-01-14 14:58:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:42,647 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-01-14 14:58:42,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:42,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-14 14:58:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:42,651 INFO L225 Difference]: With dead ends: 723 [2019-01-14 14:58:42,651 INFO L226 Difference]: Without dead ends: 369 [2019-01-14 14:58:42,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:42,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-14 14:58:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-01-14 14:58:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-14 14:58:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-01-14 14:58:42,665 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-01-14 14:58:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:42,665 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-01-14 14:58:42,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:42,666 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-01-14 14:58:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-14 14:58:42,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:42,669 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:42,669 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2114438894, now seen corresponding path program 1 times [2019-01-14 14:58:42,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:42,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:42,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:42,757 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-14 14:58:42,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:42,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:42,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:42,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:42,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:42,759 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-01-14 14:58:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:43,209 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-01-14 14:58:43,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:43,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-14 14:58:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:43,212 INFO L225 Difference]: With dead ends: 740 [2019-01-14 14:58:43,212 INFO L226 Difference]: Without dead ends: 386 [2019-01-14 14:58:43,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:43,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-14 14:58:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-01-14 14:58:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-14 14:58:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-01-14 14:58:43,229 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-01-14 14:58:43,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:43,230 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-01-14 14:58:43,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-01-14 14:58:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-14 14:58:43,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:43,233 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:43,233 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:43,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:43,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1334837850, now seen corresponding path program 1 times [2019-01-14 14:58:43,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:43,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:43,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:43,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:43,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-14 14:58:43,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:43,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:43,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:43,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:43,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:43,320 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-01-14 14:58:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:44,023 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-01-14 14:58:44,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:44,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-14 14:58:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:44,027 INFO L225 Difference]: With dead ends: 761 [2019-01-14 14:58:44,027 INFO L226 Difference]: Without dead ends: 386 [2019-01-14 14:58:44,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-14 14:58:44,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-01-14 14:58:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-14 14:58:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-01-14 14:58:44,041 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-01-14 14:58:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:44,042 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-01-14 14:58:44,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-01-14 14:58:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-14 14:58:44,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:44,043 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:44,045 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:44,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:44,046 INFO L82 PathProgramCache]: Analyzing trace with hash -457491278, now seen corresponding path program 1 times [2019-01-14 14:58:44,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:44,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:44,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:44,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:44,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-14 14:58:44,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:44,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:44,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:44,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:44,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:44,105 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-01-14 14:58:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:44,386 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-01-14 14:58:44,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:44,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-01-14 14:58:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:44,392 INFO L225 Difference]: With dead ends: 757 [2019-01-14 14:58:44,392 INFO L226 Difference]: Without dead ends: 755 [2019-01-14 14:58:44,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-01-14 14:58:44,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-01-14 14:58:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-01-14 14:58:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-01-14 14:58:44,416 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-01-14 14:58:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:44,416 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-01-14 14:58:44,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-01-14 14:58:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-14 14:58:44,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:44,421 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:44,421 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:44,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1678103130, now seen corresponding path program 1 times [2019-01-14 14:58:44,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:44,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:44,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:44,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:44,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 14:58:44,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:44,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:44,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:44,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:44,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:44,511 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-01-14 14:58:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:44,758 INFO L93 Difference]: Finished difference Result 1831 states and 2899 transitions. [2019-01-14 14:58:44,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:44,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-14 14:58:44,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:44,764 INFO L225 Difference]: With dead ends: 1831 [2019-01-14 14:58:44,765 INFO L226 Difference]: Without dead ends: 1083 [2019-01-14 14:58:44,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:44,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-01-14 14:58:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2019-01-14 14:58:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-01-14 14:58:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1712 transitions. [2019-01-14 14:58:44,798 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1712 transitions. Word has length 121 [2019-01-14 14:58:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:44,798 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 1712 transitions. [2019-01-14 14:58:44,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1712 transitions. [2019-01-14 14:58:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-14 14:58:44,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:44,802 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:44,803 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:44,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash -740381348, now seen corresponding path program 1 times [2019-01-14 14:58:44,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:44,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:44,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:44,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:44,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-14 14:58:44,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:44,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:44,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:44,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:44,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:44,882 INFO L87 Difference]: Start difference. First operand 1083 states and 1712 transitions. Second operand 3 states. [2019-01-14 14:58:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:45,137 INFO L93 Difference]: Finished difference Result 2528 states and 3999 transitions. [2019-01-14 14:58:45,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:45,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-14 14:58:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:45,146 INFO L225 Difference]: With dead ends: 2528 [2019-01-14 14:58:45,147 INFO L226 Difference]: Without dead ends: 1452 [2019-01-14 14:58:45,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2019-01-14 14:58:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1452. [2019-01-14 14:58:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-01-14 14:58:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2294 transitions. [2019-01-14 14:58:45,203 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2294 transitions. Word has length 121 [2019-01-14 14:58:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:45,203 INFO L480 AbstractCegarLoop]: Abstraction has 1452 states and 2294 transitions. [2019-01-14 14:58:45,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2294 transitions. [2019-01-14 14:58:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-14 14:58:45,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:45,209 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:45,209 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash 648912666, now seen corresponding path program 1 times [2019-01-14 14:58:45,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:45,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:45,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:45,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-14 14:58:45,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:45,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:45,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:45,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:45,291 INFO L87 Difference]: Start difference. First operand 1452 states and 2294 transitions. Second operand 3 states. [2019-01-14 14:58:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:45,576 INFO L93 Difference]: Finished difference Result 3248 states and 5132 transitions. [2019-01-14 14:58:45,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:45,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-14 14:58:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:45,585 INFO L225 Difference]: With dead ends: 3248 [2019-01-14 14:58:45,585 INFO L226 Difference]: Without dead ends: 1803 [2019-01-14 14:58:45,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-01-14 14:58:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2019-01-14 14:58:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-01-14 14:58:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2845 transitions. [2019-01-14 14:58:45,643 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2845 transitions. Word has length 121 [2019-01-14 14:58:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:45,643 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2845 transitions. [2019-01-14 14:58:45,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2845 transitions. [2019-01-14 14:58:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-14 14:58:45,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:45,650 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:45,650 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1430663259, now seen corresponding path program 1 times [2019-01-14 14:58:45,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:45,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:45,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:45,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-14 14:58:45,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:45,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:45,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:45,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:45,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:45,750 INFO L87 Difference]: Start difference. First operand 1803 states and 2845 transitions. Second operand 3 states. [2019-01-14 14:58:47,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:47,046 INFO L93 Difference]: Finished difference Result 3649 states and 5739 transitions. [2019-01-14 14:58:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:47,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-01-14 14:58:47,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:47,056 INFO L225 Difference]: With dead ends: 3649 [2019-01-14 14:58:47,056 INFO L226 Difference]: Without dead ends: 1853 [2019-01-14 14:58:47,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-01-14 14:58:47,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1803. [2019-01-14 14:58:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-01-14 14:58:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2773 transitions. [2019-01-14 14:58:47,121 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2773 transitions. Word has length 198 [2019-01-14 14:58:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:47,122 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2773 transitions. [2019-01-14 14:58:47,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2773 transitions. [2019-01-14 14:58:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-14 14:58:47,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:47,129 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:47,130 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:47,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:47,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1183282719, now seen corresponding path program 1 times [2019-01-14 14:58:47,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:47,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:47,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:47,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:47,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-01-14 14:58:47,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:47,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:47,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:47,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:47,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:47,259 INFO L87 Difference]: Start difference. First operand 1803 states and 2773 transitions. Second operand 3 states. [2019-01-14 14:58:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:47,617 INFO L93 Difference]: Finished difference Result 3666 states and 5612 transitions. [2019-01-14 14:58:47,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:47,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-01-14 14:58:47,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:47,627 INFO L225 Difference]: With dead ends: 3666 [2019-01-14 14:58:47,627 INFO L226 Difference]: Without dead ends: 1870 [2019-01-14 14:58:47,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-01-14 14:58:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1803. [2019-01-14 14:58:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-01-14 14:58:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2697 transitions. [2019-01-14 14:58:47,682 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2697 transitions. Word has length 212 [2019-01-14 14:58:47,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:47,683 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2697 transitions. [2019-01-14 14:58:47,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2697 transitions. [2019-01-14 14:58:47,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-14 14:58:47,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:47,690 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-14 14:58:47,690 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:47,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:47,690 INFO L82 PathProgramCache]: Analyzing trace with hash 317822775, now seen corresponding path program 1 times [2019-01-14 14:58:47,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:47,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:47,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:47,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:47,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-14 14:58:47,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:58:47,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:58:47,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:47,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:58:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-14 14:58:48,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 14:58:48,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 14:58:48,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 14:58:48,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 14:58:48,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 14:58:48,066 INFO L87 Difference]: Start difference. First operand 1803 states and 2697 transitions. Second operand 4 states. [2019-01-14 14:58:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:49,892 INFO L93 Difference]: Finished difference Result 4264 states and 6328 transitions. [2019-01-14 14:58:49,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 14:58:49,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-01-14 14:58:49,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:49,906 INFO L225 Difference]: With dead ends: 4264 [2019-01-14 14:58:49,906 INFO L226 Difference]: Without dead ends: 2435 [2019-01-14 14:58:49,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:58:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2019-01-14 14:58:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1603. [2019-01-14 14:58:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2019-01-14 14:58:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2361 transitions. [2019-01-14 14:58:49,977 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2361 transitions. Word has length 231 [2019-01-14 14:58:49,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:49,977 INFO L480 AbstractCegarLoop]: Abstraction has 1603 states and 2361 transitions. [2019-01-14 14:58:49,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 14:58:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2361 transitions. [2019-01-14 14:58:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-14 14:58:49,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:49,983 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-14 14:58:49,983 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:49,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1244258795, now seen corresponding path program 1 times [2019-01-14 14:58:49,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:49,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:49,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:49,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:49,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-01-14 14:58:50,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:50,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:50,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:50,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:50,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:50,115 INFO L87 Difference]: Start difference. First operand 1603 states and 2361 transitions. Second operand 3 states. [2019-01-14 14:58:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:51,347 INFO L93 Difference]: Finished difference Result 3394 states and 5016 transitions. [2019-01-14 14:58:51,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:51,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-01-14 14:58:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:51,358 INFO L225 Difference]: With dead ends: 3394 [2019-01-14 14:58:51,359 INFO L226 Difference]: Without dead ends: 1678 [2019-01-14 14:58:51,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-01-14 14:58:51,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2019-01-14 14:58:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2019-01-14 14:58:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2426 transitions. [2019-01-14 14:58:51,416 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2426 transitions. Word has length 240 [2019-01-14 14:58:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:51,417 INFO L480 AbstractCegarLoop]: Abstraction has 1678 states and 2426 transitions. [2019-01-14 14:58:51,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2426 transitions. [2019-01-14 14:58:51,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-14 14:58:51,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:51,422 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:51,422 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:51,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:51,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2075878606, now seen corresponding path program 1 times [2019-01-14 14:58:51,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:51,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:51,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:51,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:51,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-01-14 14:58:51,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:58:51,604 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:58:51,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:51,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:58:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-01-14 14:58:51,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 14:58:51,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 14:58:51,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 14:58:51,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 14:58:51,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 14:58:51,753 INFO L87 Difference]: Start difference. First operand 1678 states and 2426 transitions. Second operand 4 states. [2019-01-14 14:58:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:52,536 INFO L93 Difference]: Finished difference Result 5319 states and 7732 transitions. [2019-01-14 14:58:52,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 14:58:52,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-01-14 14:58:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:52,553 INFO L225 Difference]: With dead ends: 5319 [2019-01-14 14:58:52,553 INFO L226 Difference]: Without dead ends: 3648 [2019-01-14 14:58:52,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:58:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2019-01-14 14:58:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 2003. [2019-01-14 14:58:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2003 states. [2019-01-14 14:58:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 2728 transitions. [2019-01-14 14:58:52,635 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 2728 transitions. Word has length 252 [2019-01-14 14:58:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:52,635 INFO L480 AbstractCegarLoop]: Abstraction has 2003 states and 2728 transitions. [2019-01-14 14:58:52,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 14:58:52,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2728 transitions. [2019-01-14 14:58:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-14 14:58:52,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:52,642 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:52,642 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:52,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1787059216, now seen corresponding path program 1 times [2019-01-14 14:58:52,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:52,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:52,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:52,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:52,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-01-14 14:58:52,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:52,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:52,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:52,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:52,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:52,790 INFO L87 Difference]: Start difference. First operand 2003 states and 2728 transitions. Second operand 3 states. [2019-01-14 14:58:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:53,089 INFO L93 Difference]: Finished difference Result 5741 states and 7863 transitions. [2019-01-14 14:58:53,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:53,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-01-14 14:58:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:53,112 INFO L225 Difference]: With dead ends: 5741 [2019-01-14 14:58:53,112 INFO L226 Difference]: Without dead ends: 3745 [2019-01-14 14:58:53,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:53,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-01-14 14:58:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3743. [2019-01-14 14:58:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-01-14 14:58:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5133 transitions. [2019-01-14 14:58:53,249 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5133 transitions. Word has length 252 [2019-01-14 14:58:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:53,250 INFO L480 AbstractCegarLoop]: Abstraction has 3743 states and 5133 transitions. [2019-01-14 14:58:53,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5133 transitions. [2019-01-14 14:58:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-14 14:58:53,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:53,259 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:53,259 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:53,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:53,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1938581061, now seen corresponding path program 1 times [2019-01-14 14:58:53,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:53,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:53,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:53,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:53,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-01-14 14:58:53,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:53,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:53,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:53,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:53,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:53,379 INFO L87 Difference]: Start difference. First operand 3743 states and 5133 transitions. Second operand 3 states. [2019-01-14 14:58:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:53,857 INFO L93 Difference]: Finished difference Result 7697 states and 10553 transitions. [2019-01-14 14:58:53,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:53,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-01-14 14:58:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:53,873 INFO L225 Difference]: With dead ends: 7697 [2019-01-14 14:58:53,873 INFO L226 Difference]: Without dead ends: 3961 [2019-01-14 14:58:53,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2019-01-14 14:58:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3743. [2019-01-14 14:58:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-01-14 14:58:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5029 transitions. [2019-01-14 14:58:54,011 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5029 transitions. Word has length 255 [2019-01-14 14:58:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:54,011 INFO L480 AbstractCegarLoop]: Abstraction has 3743 states and 5029 transitions. [2019-01-14 14:58:54,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5029 transitions. [2019-01-14 14:58:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-01-14 14:58:54,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:54,021 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:54,021 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:54,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:54,021 INFO L82 PathProgramCache]: Analyzing trace with hash 501059335, now seen corresponding path program 1 times [2019-01-14 14:58:54,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:54,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:54,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:54,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:54,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-01-14 14:58:54,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:54,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:54,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:54,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:54,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:54,141 INFO L87 Difference]: Start difference. First operand 3743 states and 5029 transitions. Second operand 3 states. [2019-01-14 14:58:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:55,131 INFO L93 Difference]: Finished difference Result 7611 states and 10229 transitions. [2019-01-14 14:58:55,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:55,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-01-14 14:58:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:55,139 INFO L225 Difference]: With dead ends: 7611 [2019-01-14 14:58:55,139 INFO L226 Difference]: Without dead ends: 3875 [2019-01-14 14:58:55,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:55,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2019-01-14 14:58:55,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3835. [2019-01-14 14:58:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3835 states. [2019-01-14 14:58:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5141 transitions. [2019-01-14 14:58:55,298 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5141 transitions. Word has length 289 [2019-01-14 14:58:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:55,298 INFO L480 AbstractCegarLoop]: Abstraction has 3835 states and 5141 transitions. [2019-01-14 14:58:55,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5141 transitions. [2019-01-14 14:58:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-14 14:58:55,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:55,306 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:55,307 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:55,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:55,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1381959862, now seen corresponding path program 1 times [2019-01-14 14:58:55,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:55,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:55,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:55,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:55,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-01-14 14:58:55,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:55,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:55,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:55,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:55,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:55,442 INFO L87 Difference]: Start difference. First operand 3835 states and 5141 transitions. Second operand 3 states. [2019-01-14 14:58:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:55,734 INFO L93 Difference]: Finished difference Result 8043 states and 10851 transitions. [2019-01-14 14:58:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:55,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-01-14 14:58:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:55,743 INFO L225 Difference]: With dead ends: 8043 [2019-01-14 14:58:55,744 INFO L226 Difference]: Without dead ends: 4215 [2019-01-14 14:58:55,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:55,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4215 states. [2019-01-14 14:58:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4215 to 4085. [2019-01-14 14:58:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4085 states. [2019-01-14 14:58:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 5441 transitions. [2019-01-14 14:58:55,887 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 5441 transitions. Word has length 310 [2019-01-14 14:58:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:55,887 INFO L480 AbstractCegarLoop]: Abstraction has 4085 states and 5441 transitions. [2019-01-14 14:58:55,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 5441 transitions. [2019-01-14 14:58:55,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-14 14:58:55,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:55,895 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:55,895 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:55,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:55,896 INFO L82 PathProgramCache]: Analyzing trace with hash -978123879, now seen corresponding path program 1 times [2019-01-14 14:58:55,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:55,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:55,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:55,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:55,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-01-14 14:58:56,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:56,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:56,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:56,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:56,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:56,029 INFO L87 Difference]: Start difference. First operand 4085 states and 5441 transitions. Second operand 3 states. [2019-01-14 14:58:56,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:56,340 INFO L93 Difference]: Finished difference Result 6854 states and 9018 transitions. [2019-01-14 14:58:56,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:56,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-01-14 14:58:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:56,349 INFO L225 Difference]: With dead ends: 6854 [2019-01-14 14:58:56,349 INFO L226 Difference]: Without dead ends: 2132 [2019-01-14 14:58:56,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-01-14 14:58:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2132. [2019-01-14 14:58:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-01-14 14:58:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2773 transitions. [2019-01-14 14:58:56,403 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2773 transitions. Word has length 320 [2019-01-14 14:58:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:56,403 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2773 transitions. [2019-01-14 14:58:56,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2773 transitions. [2019-01-14 14:58:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-14 14:58:56,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:56,407 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:56,407 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:56,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:56,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1544826379, now seen corresponding path program 1 times [2019-01-14 14:58:56,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:56,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:56,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:56,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:56,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-01-14 14:58:56,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:56,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:56,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:56,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:56,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:56,602 INFO L87 Difference]: Start difference. First operand 2132 states and 2773 transitions. Second operand 3 states. [2019-01-14 14:58:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:56,860 INFO L93 Difference]: Finished difference Result 4297 states and 5600 transitions. [2019-01-14 14:58:56,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:56,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-01-14 14:58:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:56,865 INFO L225 Difference]: With dead ends: 4297 [2019-01-14 14:58:56,866 INFO L226 Difference]: Without dead ends: 2172 [2019-01-14 14:58:56,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-01-14 14:58:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2132. [2019-01-14 14:58:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-01-14 14:58:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2733 transitions. [2019-01-14 14:58:56,942 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2733 transitions. Word has length 336 [2019-01-14 14:58:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:56,942 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2733 transitions. [2019-01-14 14:58:56,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2733 transitions. [2019-01-14 14:58:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-01-14 14:58:56,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:56,949 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:56,949 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:56,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:56,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1385591610, now seen corresponding path program 1 times [2019-01-14 14:58:56,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:56,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:56,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:56,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:56,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-01-14 14:58:57,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:57,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:57,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:57,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:57,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:57,114 INFO L87 Difference]: Start difference. First operand 2132 states and 2733 transitions. Second operand 3 states. [2019-01-14 14:58:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:57,370 INFO L93 Difference]: Finished difference Result 4267 states and 5465 transitions. [2019-01-14 14:58:57,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:57,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-01-14 14:58:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:57,376 INFO L225 Difference]: With dead ends: 4267 [2019-01-14 14:58:57,376 INFO L226 Difference]: Without dead ends: 2142 [2019-01-14 14:58:57,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:57,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-01-14 14:58:57,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2132. [2019-01-14 14:58:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-01-14 14:58:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2693 transitions. [2019-01-14 14:58:57,443 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2693 transitions. Word has length 359 [2019-01-14 14:58:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:57,443 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2693 transitions. [2019-01-14 14:58:57,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2693 transitions. [2019-01-14 14:58:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-01-14 14:58:57,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:57,449 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:57,451 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:57,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:57,451 INFO L82 PathProgramCache]: Analyzing trace with hash 228313073, now seen corresponding path program 1 times [2019-01-14 14:58:57,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:57,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:57,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:57,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:57,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-14 14:58:57,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:58:57,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:58:57,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:57,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:58:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-01-14 14:58:57,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:58:57,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:58:57,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:58:57,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:58:57,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:58:57,991 INFO L87 Difference]: Start difference. First operand 2132 states and 2693 transitions. Second operand 5 states. [2019-01-14 14:58:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:58,916 INFO L93 Difference]: Finished difference Result 5817 states and 7440 transitions. [2019-01-14 14:58:58,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 14:58:58,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 392 [2019-01-14 14:58:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:58,923 INFO L225 Difference]: With dead ends: 5817 [2019-01-14 14:58:58,923 INFO L226 Difference]: Without dead ends: 3638 [2019-01-14 14:58:58,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 14:58:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2019-01-14 14:58:59,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 2156. [2019-01-14 14:58:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2019-01-14 14:58:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2759 transitions. [2019-01-14 14:58:59,018 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2759 transitions. Word has length 392 [2019-01-14 14:58:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:59,018 INFO L480 AbstractCegarLoop]: Abstraction has 2156 states and 2759 transitions. [2019-01-14 14:58:59,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:58:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2759 transitions. [2019-01-14 14:58:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-01-14 14:58:59,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:59,027 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:59,027 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:59,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:59,028 INFO L82 PathProgramCache]: Analyzing trace with hash 276993037, now seen corresponding path program 1 times [2019-01-14 14:58:59,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:59,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:59,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-01-14 14:58:59,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:59,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:59,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:59,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:59,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:59,277 INFO L87 Difference]: Start difference. First operand 2156 states and 2759 transitions. Second operand 3 states. [2019-01-14 14:58:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:59,642 INFO L93 Difference]: Finished difference Result 4485 states and 5762 transitions. [2019-01-14 14:58:59,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:59,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2019-01-14 14:58:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:59,645 INFO L225 Difference]: With dead ends: 4485 [2019-01-14 14:58:59,645 INFO L226 Difference]: Without dead ends: 2336 [2019-01-14 14:58:59,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-01-14 14:58:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2326. [2019-01-14 14:58:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-14 14:58:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 2954 transitions. [2019-01-14 14:58:59,735 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 2954 transitions. Word has length 470 [2019-01-14 14:58:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:59,736 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 2954 transitions. [2019-01-14 14:58:59,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2954 transitions. [2019-01-14 14:58:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-01-14 14:58:59,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:59,744 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:59,744 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:59,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:59,747 INFO L82 PathProgramCache]: Analyzing trace with hash 373235815, now seen corresponding path program 1 times [2019-01-14 14:58:59,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:59,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:59,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:59,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:59,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2019-01-14 14:59:00,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:00,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:00,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:00,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:00,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:00,030 INFO L87 Difference]: Start difference. First operand 2326 states and 2954 transitions. Second operand 3 states. [2019-01-14 14:59:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:00,889 INFO L93 Difference]: Finished difference Result 4640 states and 5887 transitions. [2019-01-14 14:59:00,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:00,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 532 [2019-01-14 14:59:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:00,892 INFO L225 Difference]: With dead ends: 4640 [2019-01-14 14:59:00,892 INFO L226 Difference]: Without dead ends: 2321 [2019-01-14 14:59:00,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2019-01-14 14:59:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2019-01-14 14:59:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-01-14 14:59:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 2884 transitions. [2019-01-14 14:59:00,975 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 2884 transitions. Word has length 532 [2019-01-14 14:59:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:00,975 INFO L480 AbstractCegarLoop]: Abstraction has 2321 states and 2884 transitions. [2019-01-14 14:59:00,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2884 transitions. [2019-01-14 14:59:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2019-01-14 14:59:00,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:00,986 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] [2019-01-14 14:59:00,986 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:00,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:00,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1632000361, now seen corresponding path program 1 times [2019-01-14 14:59:00,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:00,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:00,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:00,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:00,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-01-14 14:59:01,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:59:01,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:59:01,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:01,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:59:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-01-14 14:59:01,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 14:59:01,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 14:59:01,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 14:59:01,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 14:59:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 14:59:01,551 INFO L87 Difference]: Start difference. First operand 2321 states and 2884 transitions. Second operand 4 states. [2019-01-14 14:59:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:01,893 INFO L93 Difference]: Finished difference Result 3916 states and 4894 transitions. [2019-01-14 14:59:01,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 14:59:01,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 598 [2019-01-14 14:59:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:01,895 INFO L225 Difference]: With dead ends: 3916 [2019-01-14 14:59:01,895 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 14:59:01,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:59:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 14:59:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 14:59:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 14:59:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 14:59:01,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2019-01-14 14:59:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:01,899 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 14:59:01,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 14:59:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 14:59:01,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 14:59:01,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 14:59:01,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:01,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:01,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,353 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 88 [2019-01-14 14:59:02,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,455 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-01-14 14:59:02,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:02,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,591 WARN L181 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 322 DAG size of output: 201 [2019-01-14 14:59:03,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:03,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,283 WARN L181 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 322 DAG size of output: 201 [2019-01-14 14:59:04,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:04,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:06,250 WARN L181 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-01-14 14:59:08,186 WARN L181 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 72 DAG size of output: 30 [2019-01-14 14:59:08,518 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-01-14 14:59:09,084 WARN L181 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-01-14 14:59:09,535 WARN L181 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-01-14 14:59:09,909 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 34 [2019-01-14 14:59:10,116 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 24 [2019-01-14 14:59:10,519 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-01-14 14:59:10,672 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 19 [2019-01-14 14:59:11,114 WARN L181 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-01-14 14:59:11,373 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-01-14 14:59:11,755 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-01-14 14:59:12,150 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 25 [2019-01-14 14:59:14,609 WARN L181 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 177 DAG size of output: 107 [2019-01-14 14:59:15,681 WARN L181 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-01-14 14:59:16,118 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-01-14 14:59:18,636 WARN L181 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 177 DAG size of output: 107 [2019-01-14 14:59:18,885 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-01-14 14:59:19,241 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-01-14 14:59:19,486 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-01-14 14:59:19,703 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2019-01-14 14:59:19,705 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 367) no Hoare annotation was computed. [2019-01-14 14:59:19,706 INFO L448 ceAbstractionStarter]: For program point L333-1(lines 333 367) no Hoare annotation was computed. [2019-01-14 14:59:19,706 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 546) no Hoare annotation was computed. [2019-01-14 14:59:19,706 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 557) no Hoare annotation was computed. [2019-01-14 14:59:19,706 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 568) no Hoare annotation was computed. [2019-01-14 14:59:19,706 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 579) no Hoare annotation was computed. [2019-01-14 14:59:19,706 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-01-14 14:59:19,706 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2019-01-14 14:59:19,706 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 364) no Hoare annotation was computed. [2019-01-14 14:59:19,707 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 547) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse2 .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (and .cse2 .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-01-14 14:59:19,707 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 579) the Hoare annotation is: false [2019-01-14 14:59:19,707 INFO L451 ceAbstractionStarter]: At program point L599(lines 98 600) the Hoare annotation is: true [2019-01-14 14:59:19,707 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 535) no Hoare annotation was computed. [2019-01-14 14:59:19,707 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 545) no Hoare annotation was computed. [2019-01-14 14:59:19,707 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 556) no Hoare annotation was computed. [2019-01-14 14:59:19,707 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 567) no Hoare annotation was computed. [2019-01-14 14:59:19,707 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 578) no Hoare annotation was computed. [2019-01-14 14:59:19,707 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 311) no Hoare annotation was computed. [2019-01-14 14:59:19,708 INFO L448 ceAbstractionStarter]: For program point L304-2(lines 304 311) no Hoare annotation was computed. [2019-01-14 14:59:19,708 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 545) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-14 14:59:19,708 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-01-14 14:59:19,708 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 568) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8) (and .cse9 .cse0 .cse8 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7))) [2019-01-14 14:59:19,708 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 362) no Hoare annotation was computed. [2019-01-14 14:59:19,708 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 545) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-14 14:59:19,709 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 555) no Hoare annotation was computed. [2019-01-14 14:59:19,709 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 566) no Hoare annotation was computed. [2019-01-14 14:59:19,709 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 577) no Hoare annotation was computed. [2019-01-14 14:59:19,709 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 606) no Hoare annotation was computed. [2019-01-14 14:59:19,709 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 606) no Hoare annotation was computed. [2019-01-14 14:59:19,709 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 508) no Hoare annotation was computed. [2019-01-14 14:59:19,709 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-01-14 14:59:19,709 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 542) no Hoare annotation was computed. [2019-01-14 14:59:19,709 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2019-01-14 14:59:19,709 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-01-14 14:59:19,709 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 346) no Hoare annotation was computed. [2019-01-14 14:59:19,709 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 346) no Hoare annotation was computed. [2019-01-14 14:59:19,710 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-01-14 14:59:19,710 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 554) no Hoare annotation was computed. [2019-01-14 14:59:19,710 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 565) no Hoare annotation was computed. [2019-01-14 14:59:19,710 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 576) no Hoare annotation was computed. [2019-01-14 14:59:19,710 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2019-01-14 14:59:19,710 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 408) no Hoare annotation was computed. [2019-01-14 14:59:19,710 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-01-14 14:59:19,710 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 578) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2) (and .cse0 (and .cse2 (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1))) (and .cse0 (and .cse2 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2))) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-14 14:59:19,711 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 555) 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-01-14 14:59:19,711 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 566) 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-01-14 14:59:19,711 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2019-01-14 14:59:19,711 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 383) no Hoare annotation was computed. [2019-01-14 14:59:19,711 INFO L451 ceAbstractionStarter]: At program point L609(lines 11 611) the Hoare annotation is: true [2019-01-14 14:59:19,712 INFO L444 ceAbstractionStarter]: At program point L543(lines 99 598) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse22 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse31 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse30 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse16 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse32 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (let ((.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse27 (and .cse7 (and .cse15 .cse30 .cse5 .cse16 .cse17 .cse18 .cse19 .cse29 .cse32 .cse20))) (.cse28 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse25 (and .cse15 .cse30 .cse16 .cse22 .cse17 .cse18 .cse19 .cse31 .cse29 .cse32 .cse20)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse12 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse24 (and .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse31 .cse2 .cse29 .cse32 .cse20)) (.cse26 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse8 .cse9 .cse4) (and .cse5 .cse10) (and .cse10 .cse8) (and .cse0 .cse11 .cse12 .cse4) (and .cse13 .cse5 .cse14) (and .cse15 .cse7 .cse5 .cse16 .cse17 .cse18 .cse19 .cse14 .cse20) (and .cse11 .cse7 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse9) (and .cse21 .cse22) (and .cse13 .cse22 .cse14) (and .cse0 .cse1 .cse22 .cse3) (and .cse22 .cse23) (and .cse24 .cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse7 .cse14 .cse25) (and .cse0 .cse1 .cse13 .cse2 .cse3) (and .cse10 .cse2) (and .cse23 .cse6 .cse2) (and .cse24 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse6) (and .cse26 .cse27) (and .cse13 .cse24 .cse28 .cse6) (and .cse5 .cse29 .cse3) (and .cse21 .cse6 .cse2) (and .cse27 .cse28) (and .cse28 .cse25) (and (and .cse8 .cse29 .cse3) .cse4) (and .cse26 .cse25) (and .cse10 .cse22) (and .cse0 .cse11 .cse12 .cse13) (and .cse13 .cse2 .cse14 .cse6) (and .cse13 .cse24 .cse26 .cse6)))) [2019-01-14 14:59:19,712 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 553) no Hoare annotation was computed. [2019-01-14 14:59:19,712 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 564) no Hoare annotation was computed. [2019-01-14 14:59:19,712 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 575) no Hoare annotation was computed. [2019-01-14 14:59:19,712 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-01-14 14:59:19,712 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 482) no Hoare annotation was computed. [2019-01-14 14:59:19,712 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-01-14 14:59:19,712 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 515) no Hoare annotation was computed. [2019-01-14 14:59:19,712 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-01-14 14:59:19,713 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-01-14 14:59:19,713 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 552) no Hoare annotation was computed. [2019-01-14 14:59:19,713 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 563) no Hoare annotation was computed. [2019-01-14 14:59:19,713 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-01-14 14:59:19,713 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 574) no Hoare annotation was computed. [2019-01-14 14:59:19,713 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 596) no Hoare annotation was computed. [2019-01-14 14:59:19,713 INFO L444 ceAbstractionStarter]: At program point L514(lines 72 610) the Hoare annotation is: false [2019-01-14 14:59:19,713 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 553) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0))) [2019-01-14 14:59:19,713 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 564) the Hoare annotation is: (let ((.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9) (and .cse10 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-14 14:59:19,713 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-01-14 14:59:19,714 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-01-14 14:59:19,714 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 595) no Hoare annotation was computed. [2019-01-14 14:59:19,714 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 358) no Hoare annotation was computed. [2019-01-14 14:59:19,714 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 14:59:19,714 INFO L448 ceAbstractionStarter]: For program point L582(lines 582 587) no Hoare annotation was computed. [2019-01-14 14:59:19,714 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 518) no Hoare annotation was computed. [2019-01-14 14:59:19,714 INFO L448 ceAbstractionStarter]: For program point L582-2(lines 581 595) no Hoare annotation was computed. [2019-01-14 14:59:19,714 INFO L444 ceAbstractionStarter]: At program point L351(lines 327 369) the Hoare annotation is: (let ((.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9) (and .cse10 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-14 14:59:19,714 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 551) no Hoare annotation was computed. [2019-01-14 14:59:19,715 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 562) no Hoare annotation was computed. [2019-01-14 14:59:19,715 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 573) no Hoare annotation was computed. [2019-01-14 14:59:19,715 INFO L448 ceAbstractionStarter]: For program point L418(lines 418 420) no Hoare annotation was computed. [2019-01-14 14:59:19,715 INFO L444 ceAbstractionStarter]: At program point L385(lines 376 408) the Hoare annotation is: (let ((.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 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))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7)) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse8 (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7) .cse0)) (and (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7) .cse0) .cse8))) [2019-01-14 14:59:19,715 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 574) 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9))) [2019-01-14 14:59:19,715 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2019-01-14 14:59:19,715 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2019-01-14 14:59:19,716 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 355) no Hoare annotation was computed. [2019-01-14 14:59:19,716 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-01-14 14:59:19,716 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-01-14 14:59:19,716 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 208 542) no Hoare annotation was computed. [2019-01-14 14:59:19,716 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 325) no Hoare annotation was computed. [2019-01-14 14:59:19,716 INFO L448 ceAbstractionStarter]: For program point L321-2(lines 208 542) no Hoare annotation was computed. [2019-01-14 14:59:19,716 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 550) no Hoare annotation was computed. [2019-01-14 14:59:19,716 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 561) no Hoare annotation was computed. [2019-01-14 14:59:19,716 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 572) no Hoare annotation was computed. [2019-01-14 14:59:19,716 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-01-14 14:59:19,716 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 610) no Hoare annotation was computed. [2019-01-14 14:59:19,716 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 524) no Hoare annotation was computed. [2019-01-14 14:59:19,717 INFO L448 ceAbstractionStarter]: For program point L520-2(lines 520 524) no Hoare annotation was computed. [2019-01-14 14:59:19,717 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 406) no Hoare annotation was computed. [2019-01-14 14:59:19,717 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 14:59:19,717 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 551) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4) .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5))) [2019-01-14 14:59:19,717 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 562) the Hoare annotation is: (let ((.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 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))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7)) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse8 (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7) .cse0)) (and (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7) .cse0) .cse8))) [2019-01-14 14:59:19,717 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 572) 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 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-01-14 14:59:19,718 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-01-14 14:59:19,718 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 491) no Hoare annotation was computed. [2019-01-14 14:59:19,718 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-01-14 14:59:19,718 INFO L451 ceAbstractionStarter]: At program point L621(lines 612 623) the Hoare annotation is: true [2019-01-14 14:59:19,718 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 549) no Hoare annotation was computed. [2019-01-14 14:59:19,718 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 560) no Hoare annotation was computed. [2019-01-14 14:59:19,718 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 571) no Hoare annotation was computed. [2019-01-14 14:59:19,718 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2019-01-14 14:59:19,718 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2019-01-14 14:59:19,718 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-01-14 14:59:19,718 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-01-14 14:59:19,718 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 542) no Hoare annotation was computed. [2019-01-14 14:59:19,718 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 14:59:19,719 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-01-14 14:59:19,719 INFO L448 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-01-14 14:59:19,719 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 426 434) no Hoare annotation was computed. [2019-01-14 14:59:19,719 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-01-14 14:59:19,719 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 548) no Hoare annotation was computed. [2019-01-14 14:59:19,719 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 559) no Hoare annotation was computed. [2019-01-14 14:59:19,719 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 570) no Hoare annotation was computed. [2019-01-14 14:59:19,719 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 499) no Hoare annotation was computed. [2019-01-14 14:59:19,719 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 549) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse3) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3) (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-14 14:59:19,719 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 560) the Hoare annotation is: (let ((.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7)) .cse8) (and (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7) .cse0) .cse8) (and (and (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse7) .cse0) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-14 14:59:19,720 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2019-01-14 14:59:19,720 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 368) no Hoare annotation was computed. [2019-01-14 14:59:19,720 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 547) no Hoare annotation was computed. [2019-01-14 14:59:19,720 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 558) no Hoare annotation was computed. [2019-01-14 14:59:19,720 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 569) no Hoare annotation was computed. [2019-01-14 14:59:19,720 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 598) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse22 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse31 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse30 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse16 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse32 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (let ((.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse27 (and .cse7 (and .cse15 .cse30 .cse5 .cse16 .cse17 .cse18 .cse19 .cse29 .cse32 .cse20))) (.cse28 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse25 (and .cse15 .cse30 .cse16 .cse22 .cse17 .cse18 .cse19 .cse31 .cse29 .cse32 .cse20)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse12 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse24 (and .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse31 .cse2 .cse29 .cse32 .cse20)) (.cse26 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse8 .cse9 .cse4) (and .cse5 .cse10) (and .cse10 .cse8) (and .cse0 .cse11 .cse12 .cse4) (and .cse13 .cse5 .cse14) (and .cse15 .cse7 .cse5 .cse16 .cse17 .cse18 .cse19 .cse14 .cse20) (and .cse11 .cse7 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse9) (and .cse21 .cse22) (and .cse13 .cse22 .cse14) (and .cse0 .cse1 .cse22 .cse3) (and .cse22 .cse23) (and .cse24 .cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse7 .cse14 .cse25) (and .cse0 .cse1 .cse13 .cse2 .cse3) (and .cse10 .cse2) (and .cse23 .cse6 .cse2) (and .cse24 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse6) (and .cse26 .cse27) (and .cse13 .cse24 .cse28 .cse6) (and .cse5 .cse29 .cse3) (and .cse21 .cse6 .cse2) (and .cse27 .cse28) (and .cse28 .cse25) (and (and .cse8 .cse29 .cse3) .cse4) (and .cse26 .cse25) (and .cse10 .cse22) (and .cse0 .cse11 .cse12 .cse13) (and .cse13 .cse2 .cse14 .cse6) (and .cse13 .cse24 .cse26 .cse6)))) [2019-01-14 14:59:19,721 INFO L448 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-01-14 14:59:19,721 INFO L448 ceAbstractionStarter]: For program point L496-2(lines 208 542) no Hoare annotation was computed. [2019-01-14 14:59:19,721 INFO L444 ceAbstractionStarter]: At program point L397(lines 388 406) the Hoare annotation is: (let ((.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 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))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7)) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse8 (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7) .cse0)) (and (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7) .cse0) .cse8))) [2019-01-14 14:59:19,721 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-01-14 14:59:19,721 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 558) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse1) (and .cse0 .cse3 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1))) [2019-01-14 14:59:19,721 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 571) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10))) [2019-01-14 14:59:19,721 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-14 14:59:19,721 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 536) no Hoare annotation was computed. [2019-01-14 14:59:19,722 INFO L448 ceAbstractionStarter]: For program point L530-1(lines 530 536) no Hoare annotation was computed. [2019-01-14 14:59:19,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:59:19 BoogieIcfgContainer [2019-01-14 14:59:19,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 14:59:19,812 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 14:59:19,813 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 14:59:19,813 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 14:59:19,813 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:58:33" (3/4) ... [2019-01-14 14:59:19,817 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 14:59:19,845 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 14:59:19,846 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 14:59:20,016 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 14:59:20,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 14:59:20,017 INFO L168 Benchmark]: Toolchain (without parser) took 48723.15 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 879.2 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -276.3 MB). Peak memory consumption was 602.9 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:20,017 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:59:20,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 487.48 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. [2019-01-14 14:59:20,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:20,018 INFO L168 Benchmark]: Boogie Preprocessor took 72.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:59:20,018 INFO L168 Benchmark]: RCFGBuilder took 1426.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:20,024 INFO L168 Benchmark]: TraceAbstraction took 46380.73 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 733.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -166.6 MB). Peak memory consumption was 973.4 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:20,025 INFO L168 Benchmark]: Witness Printer took 203.39 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:20,031 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 487.48 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 144.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1426.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46380.73 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 733.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -166.6 MB). Peak memory consumption was 973.4 MB. Max. memory is 11.5 GB. * Witness Printer took 203.39 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(s__hit == 0)) || (((8448 <= s__state && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (((8448 <= s__state && blastFlag == 1) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((8448 <= s__state && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && s__state <= 8448) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((8448 <= s__state && ((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 0 == s__hit) || (s__state <= 8576 && (((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((8448 <= s__state && ((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 0 == s__hit) || (s__state <= 8576 && (((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((s__state <= 8672 && !(8657 == s__state)) && !(8672 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(s__hit == 0)) || (((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 1) && !(8672 == s__state)) && !(8656 == s__state)) && 8640 <= s__state)) || (((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 0) && !(8672 == s__state)) && !(8656 == s__state)) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(8657 == s__state)) && !(8672 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8656 == s__state)) && blastFlag == 2) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(8657 == s__state)) && !(8672 == s__state)) && !(8656 == s__state)) && blastFlag == 2) && 8640 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((8672 <= s__state && !(12292 == s__state)) && blastFlag == 1) || (((blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state)) && !(s__hit == 0))) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || (((blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state)) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((s__state <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && s__state == 8608) || (((0 == s__hit && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && s__state == 8608)) || (blastFlag == 1 && s__state == 8608) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((8448 <= s__state && ((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 0 == s__hit) || (s__state <= 8576 && (((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) || (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && s__state <= 8448) || (s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448 && blastFlag == 1 && !(8448 == s__state))) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448 && !(8448 == s__state) && blastFlag == 2) && 0 == s__hit) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 2) && 8640 <= s__state) && !(s__hit == 0)) || ((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 1) && 0 == s__hit) && 8640 <= s__state)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(s__hit == 0))) || (blastFlag == 1 && s__state <= 3)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(s__hit == 0))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || ((((((((!(8497 == s__state) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag == 0)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 0) && 8640 <= s__state)) || (blastFlag == 0 && s__state == 8560)) || ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && s__state == 8512)) || ((8448 <= s__state && s__state <= 8576) && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || ((((s__state <= 8672 && !(8657 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && 8640 <= s__state)) || (s__state <= 3 && blastFlag == 2)) || ((s__state == 8560 && 0 == s__hit) && blastFlag == 2)) || ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8528) && 0 == s__hit)) || (s__state == 8592 && 8448 <= s__state && ((((((((!(8497 == s__state) && !(8496 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8608) && 0 == s__hit)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((s__state == 8544 && 0 == s__hit) && blastFlag == 2)) || ((8448 <= s__state && ((((((((!(8497 == s__state) && !(8496 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8608)) || (s__state == 8608 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (s__state == 8592 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (s__state <= 3 && blastFlag == 0)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 2) && s__state <= 8576) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8592) && 0 == s__hit) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((s__state <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((8448 <= s__state && ((((((!(8481 == s__state) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || ((((s__s3__tmp__next_state___0 <= 8576 && 8448 <= s__state) && s__state <= 8576) && ((((((!(8481 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit)) || ((((((((((8448 <= s__state && !(8481 == s__state)) && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 2) && 8640 <= s__state) && !(s__hit == 0)) || ((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 1) && 0 == s__hit) && 8640 <= s__state)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(s__hit == 0))) || (blastFlag == 1 && s__state <= 3)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(s__hit == 0))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || ((((((((!(8497 == s__state) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag == 0)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 0) && 8640 <= s__state)) || (blastFlag == 0 && s__state == 8560)) || ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && s__state == 8512)) || ((8448 <= s__state && s__state <= 8576) && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || ((((s__state <= 8672 && !(8657 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && 8640 <= s__state)) || (s__state <= 3 && blastFlag == 2)) || ((s__state == 8560 && 0 == s__hit) && blastFlag == 2)) || ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8528) && 0 == s__hit)) || (s__state == 8592 && 8448 <= s__state && ((((((((!(8497 == s__state) && !(8496 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8608) && 0 == s__hit)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((s__state == 8544 && 0 == s__hit) && blastFlag == 2)) || ((8448 <= s__state && ((((((((!(8497 == s__state) && !(8496 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8608)) || (s__state == 8608 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (s__state == 8592 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (s__state <= 3 && blastFlag == 0)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 2) && s__state <= 8576) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8592) && 0 == s__hit) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) || (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((8448 <= s__state && ((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576)) || ((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && !(8672 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && 8640 <= s__state) || ((((s__state <= 8672 && blastFlag == 1) && !(8672 == s__state)) && 8640 <= s__state) && 0 == s__hit)) || (((s__state <= 8672 && !(8672 == s__state)) && blastFlag == 0) && 8640 <= s__state)) || ((((s__state <= 8672 && !(8672 == s__state)) && blastFlag == 2) && 8640 <= s__state) && !(s__hit == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. SAFE Result, 46.2s OverallTime, 34 OverallIterations, 19 TraceHistogramMax, 20.8s AutomataDifference, 0.0s DeadEndRemovalTime, 17.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 6488 SDtfs, 4148 SDslu, 3265 SDs, 0 SdLazy, 3730 SolverSat, 959 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1574 GetRequests, 1528 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4085occurred in iteration=27, 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.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 4578 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3659 HoareAnnotationTreeSize, 28 FomulaSimplifications, 121494 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 28 FomulaSimplificationsInter, 32552 FormulaSimplificationTreeSizeReductionInter, 15.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 8393 NumberOfCodeBlocks, 8393 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 8355 ConstructedInterpolants, 0 QuantifiedInterpolants, 3514509 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2325 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 38 InterpolantComputations, 31 PerfectInterpolantSequences, 27180/27342 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...