./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_3_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_srvr_3_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb70094490cf46157ed6f1dc8c697227b983429d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 14:58:29,341 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:58:29,343 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:58:29,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:58:29,355 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:58:29,356 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:58:29,357 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:58:29,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:58:29,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:58:29,364 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:58:29,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:58:29,366 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:58:29,367 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:58:29,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:58:29,373 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:58:29,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:58:29,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:58:29,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:58:29,379 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:58:29,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:58:29,382 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:58:29,383 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:58:29,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:58:29,386 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:58:29,386 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:58:29,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:58:29,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:58:29,389 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:58:29,390 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:58:29,391 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:58:29,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:58:29,392 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:58:29,392 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:58:29,393 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:58:29,394 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:58:29,395 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:58:29,395 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:29,417 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:58:29,419 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:58:29,420 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:58:29,420 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:58:29,420 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:58:29,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:58:29,421 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:58:29,421 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:58:29,421 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:58:29,421 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:58:29,421 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:58:29,421 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:58:29,424 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:58:29,424 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:58:29,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:58:29,425 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:58:29,425 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:58:29,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:58:29,425 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:58:29,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:58:29,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:58:29,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:58:29,426 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:58:29,426 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:58:29,426 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:58:29,426 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:58:29,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:58:29,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb70094490cf46157ed6f1dc8c697227b983429d [2019-01-14 14:58:29,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:58:29,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:58:29,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:58:29,516 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:58:29,517 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:58:29,517 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_3_true-unreach-call_false-termination.cil.c [2019-01-14 14:58:29,567 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d02bce825/85792f29b539450ebc76ba2ed7a77ea1/FLAG005f53a30 [2019-01-14 14:58:30,041 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:58:30,044 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_3_true-unreach-call_false-termination.cil.c [2019-01-14 14:58:30,060 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d02bce825/85792f29b539450ebc76ba2ed7a77ea1/FLAG005f53a30 [2019-01-14 14:58:30,342 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d02bce825/85792f29b539450ebc76ba2ed7a77ea1 [2019-01-14 14:58:30,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:58:30,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:58:30,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:58:30,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:58:30,351 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:58:30,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:58:30" (1/1) ... [2019-01-14 14:58:30,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5636bad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:30, skipping insertion in model container [2019-01-14 14:58:30,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:58:30" (1/1) ... [2019-01-14 14:58:30,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:58:30,404 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:58:30,771 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:58:30,782 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:58:30,867 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:58:30,882 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:58:30,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:30 WrapperNode [2019-01-14 14:58:30,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:58:30,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:58:30,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:58:30,884 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:58:30,953 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:30" (1/1) ... [2019-01-14 14:58:30,971 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:30" (1/1) ... [2019-01-14 14:58:31,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:58:31,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:58:31,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:58:31,024 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:58:31,035 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:30" (1/1) ... [2019-01-14 14:58:31,035 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:30" (1/1) ... [2019-01-14 14:58:31,046 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:30" (1/1) ... [2019-01-14 14:58:31,047 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:30" (1/1) ... [2019-01-14 14:58:31,060 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:30" (1/1) ... [2019-01-14 14:58:31,070 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:30" (1/1) ... [2019-01-14 14:58:31,073 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:30" (1/1) ... [2019-01-14 14:58:31,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:58:31,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:58:31,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:58:31,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:58:31,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:30" (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:31,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:58:31,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:58:31,281 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 14:58:32,362 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-14 14:58:32,363 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-14 14:58:32,364 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:58:32,365 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 14:58:32,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:58:32 BoogieIcfgContainer [2019-01-14 14:58:32,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:58:32,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:58:32,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:58:32,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:58:32,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:58:30" (1/3) ... [2019-01-14 14:58:32,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d026e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:58:32, skipping insertion in model container [2019-01-14 14:58:32,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:30" (2/3) ... [2019-01-14 14:58:32,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d026e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:58:32, skipping insertion in model container [2019-01-14 14:58:32,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:58:32" (3/3) ... [2019-01-14 14:58:32,374 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_true-unreach-call_false-termination.cil.c [2019-01-14 14:58:32,382 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:58:32,390 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:58:32,406 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:58:32,436 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:58:32,437 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:58:32,438 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:58:32,438 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:58:32,438 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:58:32,439 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:58:32,439 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:58:32,439 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:58:32,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:58:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-01-14 14:58:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 14:58:32,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:32,467 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:32,470 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:32,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash -91604792, now seen corresponding path program 1 times [2019-01-14 14:58:32,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:32,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:32,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:32,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:32,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:32,756 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:32,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:32,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:32,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:32,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:32,782 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-01-14 14:58:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:33,509 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-01-14 14:58:33,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:33,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-14 14:58:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:33,528 INFO L225 Difference]: With dead ends: 327 [2019-01-14 14:58:33,528 INFO L226 Difference]: Without dead ends: 174 [2019-01-14 14:58:33,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:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-14 14:58:33,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-01-14 14:58:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-14 14:58:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-01-14 14:58:33,588 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-01-14 14:58:33,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:33,588 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-01-14 14:58:33,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:33,589 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-01-14 14:58:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 14:58:33,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:33,591 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:33,592 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:33,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:33,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1448034255, now seen corresponding path program 1 times [2019-01-14 14:58:33,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:33,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:33,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:33,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:33,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:33,681 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,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:33,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:33,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:33,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:33,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:33,685 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-01-14 14:58:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:34,091 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-01-14 14:58:34,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:34,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-14 14:58:34,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:34,095 INFO L225 Difference]: With dead ends: 379 [2019-01-14 14:58:34,095 INFO L226 Difference]: Without dead ends: 215 [2019-01-14 14:58:34,097 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,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-14 14:58:34,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-01-14 14:58:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-14 14:58:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-01-14 14:58:34,117 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-01-14 14:58:34,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:34,118 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-01-14 14:58:34,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-01-14 14:58:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 14:58:34,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:34,122 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:34,122 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:34,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash 564000227, now seen corresponding path program 1 times [2019-01-14 14:58:34,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:34,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:34,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:34,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:34,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:34,197 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:34,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:34,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:34,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:34,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:34,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:34,200 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-01-14 14:58:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:34,545 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-01-14 14:58:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:34,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-14 14:58:34,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:34,550 INFO L225 Difference]: With dead ends: 444 [2019-01-14 14:58:34,550 INFO L226 Difference]: Without dead ends: 241 [2019-01-14 14:58:34,552 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,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-14 14:58:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-01-14 14:58:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-14 14:58:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-01-14 14:58:34,572 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-01-14 14:58:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:34,572 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-01-14 14:58:34,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-01-14 14:58:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 14:58:34,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:34,577 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:34,577 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:34,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:34,578 INFO L82 PathProgramCache]: Analyzing trace with hash 730826777, now seen corresponding path program 1 times [2019-01-14 14:58:34,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:34,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:34,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:34,673 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:34,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:34,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:34,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:34,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:34,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:34,674 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-01-14 14:58:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:35,041 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-01-14 14:58:35,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:35,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-14 14:58:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:35,044 INFO L225 Difference]: With dead ends: 492 [2019-01-14 14:58:35,044 INFO L226 Difference]: Without dead ends: 258 [2019-01-14 14:58:35,045 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,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-14 14:58:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-01-14 14:58:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-14 14:58:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-01-14 14:58:35,063 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-01-14 14:58:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:35,064 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-01-14 14:58:35,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-01-14 14:58:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 14:58:35,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:35,068 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:35,068 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:35,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1628760422, now seen corresponding path program 1 times [2019-01-14 14:58:35,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:35,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:35,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:35,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:35,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:35,177 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:35,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:35,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:35,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:35,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:35,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:35,179 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-01-14 14:58:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:35,442 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-01-14 14:58:35,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:35,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-14 14:58:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:35,450 INFO L225 Difference]: With dead ends: 551 [2019-01-14 14:58:35,450 INFO L226 Difference]: Without dead ends: 302 [2019-01-14 14:58:35,451 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,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-14 14:58:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-01-14 14:58:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-14 14:58:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-01-14 14:58:35,470 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-01-14 14:58:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:35,471 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-01-14 14:58:35,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-01-14 14:58:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:58:35,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:35,474 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:35,475 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:35,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2100135205, now seen corresponding path program 1 times [2019-01-14 14:58:35,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:35,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:35,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:35,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:35,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:35,576 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:35,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:35,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:35,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:35,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:35,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:35,578 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-01-14 14:58:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:36,064 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-01-14 14:58:36,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:36,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:58:36,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:36,066 INFO L225 Difference]: With dead ends: 591 [2019-01-14 14:58:36,066 INFO L226 Difference]: Without dead ends: 300 [2019-01-14 14:58:36,068 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,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-14 14:58:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-01-14 14:58:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-14 14:58:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-01-14 14:58:36,086 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-01-14 14:58:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:36,086 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-01-14 14:58:36,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:36,086 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-01-14 14:58:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:58:36,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:36,090 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:36,090 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:36,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:36,090 INFO L82 PathProgramCache]: Analyzing trace with hash 967197197, now seen corresponding path program 1 times [2019-01-14 14:58:36,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:36,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:36,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:36,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:36,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:36,172 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:36,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:36,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:36,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:36,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:36,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:36,175 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-01-14 14:58:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:37,023 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-01-14 14:58:37,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:37,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:58:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:37,026 INFO L225 Difference]: With dead ends: 593 [2019-01-14 14:58:37,026 INFO L226 Difference]: Without dead ends: 300 [2019-01-14 14:58:37,027 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,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-14 14:58:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-01-14 14:58:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-14 14:58:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-01-14 14:58:37,039 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-01-14 14:58:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:37,039 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-01-14 14:58:37,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-01-14 14:58:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 14:58:37,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:37,042 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:37,042 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:37,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:37,043 INFO L82 PathProgramCache]: Analyzing trace with hash 169031718, now seen corresponding path program 1 times [2019-01-14 14:58:37,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:37,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:37,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:37,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:37,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:37,114 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:37,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:37,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:37,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:37,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:37,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:37,116 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-01-14 14:58:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:37,408 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-01-14 14:58:37,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:37,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-14 14:58:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:37,411 INFO L225 Difference]: With dead ends: 594 [2019-01-14 14:58:37,411 INFO L226 Difference]: Without dead ends: 305 [2019-01-14 14:58:37,413 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,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-14 14:58:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-01-14 14:58:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-14 14:58:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-01-14 14:58:37,426 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-01-14 14:58:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:37,427 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-01-14 14:58:37,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-01-14 14:58:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-14 14:58:37,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:37,428 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:37,429 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:37,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:37,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1117186876, now seen corresponding path program 1 times [2019-01-14 14:58:37,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:37,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:37,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:37,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:37,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:37,517 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:37,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:37,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:37,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:37,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:37,519 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-01-14 14:58:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:38,793 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-01-14 14:58:38,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:38,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-14 14:58:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:38,797 INFO L225 Difference]: With dead ends: 634 [2019-01-14 14:58:38,798 INFO L226 Difference]: Without dead ends: 336 [2019-01-14 14:58:38,798 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,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-14 14:58:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-14 14:58:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-14 14:58:38,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-01-14 14:58:38,810 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-01-14 14:58:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:38,810 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-01-14 14:58:38,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-01-14 14:58:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 14:58:38,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:38,814 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:38,814 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:38,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:38,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1355507800, now seen corresponding path program 1 times [2019-01-14 14:58:38,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:38,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:38,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:38,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:38,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:38,896 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:38,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:38,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:38,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:38,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:38,897 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-01-14 14:58:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:39,226 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-01-14 14:58:39,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:39,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-14 14:58:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:39,230 INFO L225 Difference]: With dead ends: 663 [2019-01-14 14:58:39,230 INFO L226 Difference]: Without dead ends: 336 [2019-01-14 14:58:39,231 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:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-14 14:58:39,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-14 14:58:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-14 14:58:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-01-14 14:58:39,241 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-01-14 14:58:39,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:39,241 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-01-14 14:58:39,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-01-14 14:58:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 14:58:39,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:39,243 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:39,243 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:39,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:39,243 INFO L82 PathProgramCache]: Analyzing trace with hash 106299532, now seen corresponding path program 1 times [2019-01-14 14:58:39,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:39,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:39,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:39,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:39,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:39,326 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:39,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:39,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:39,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:39,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:39,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:39,327 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-01-14 14:58:40,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:40,020 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-01-14 14:58:40,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:40,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-14 14:58:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:40,022 INFO L225 Difference]: With dead ends: 696 [2019-01-14 14:58:40,022 INFO L226 Difference]: Without dead ends: 369 [2019-01-14 14:58:40,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-14 14:58:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-01-14 14:58:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-14 14:58:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-01-14 14:58:40,039 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-01-14 14:58:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:40,039 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-01-14 14:58:40,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-01-14 14:58:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 14:58:40,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:40,041 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:40,041 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:40,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179864, now seen corresponding path program 1 times [2019-01-14 14:58:40,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:40,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:40,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:40,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:40,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:40,125 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:40,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:40,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:40,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:40,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:40,127 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-01-14 14:58:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:41,101 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-01-14 14:58:41,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:41,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-14 14:58:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:41,106 INFO L225 Difference]: With dead ends: 723 [2019-01-14 14:58:41,106 INFO L226 Difference]: Without dead ends: 369 [2019-01-14 14:58:41,107 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,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-14 14:58:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-01-14 14:58:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-14 14:58:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-01-14 14:58:41,122 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-01-14 14:58:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:41,123 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-01-14 14:58:41,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-01-14 14:58:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-14 14:58:41,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:41,126 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:41,127 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:41,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:41,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1408209639, now seen corresponding path program 1 times [2019-01-14 14:58:41,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:41,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:41,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:41,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:41,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:41,214 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:41,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:41,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:41,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:41,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:41,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:41,215 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-01-14 14:58:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:41,796 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2019-01-14 14:58:41,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:41,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-14 14:58:41,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:41,798 INFO L225 Difference]: With dead ends: 740 [2019-01-14 14:58:41,799 INFO L226 Difference]: Without dead ends: 386 [2019-01-14 14:58:41,801 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,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-14 14:58:41,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-01-14 14:58:41,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-14 14:58:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-01-14 14:58:41,816 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-01-14 14:58:41,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:41,817 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-01-14 14:58:41,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-01-14 14:58:41,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-14 14:58:41,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:41,819 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:41,819 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:41,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:41,819 INFO L82 PathProgramCache]: Analyzing trace with hash -628608595, now seen corresponding path program 1 times [2019-01-14 14:58:41,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:41,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:41,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:41,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:41,911 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:41,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:41,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:41,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:41,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:41,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:41,913 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-01-14 14:58:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:42,511 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2019-01-14 14:58:42,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:42,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-14 14:58:42,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:42,515 INFO L225 Difference]: With dead ends: 761 [2019-01-14 14:58:42,515 INFO L226 Difference]: Without dead ends: 386 [2019-01-14 14:58:42,516 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,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-14 14:58:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2019-01-14 14:58:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-14 14:58:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-01-14 14:58:42,534 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-01-14 14:58:42,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:42,534 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-01-14 14:58:42,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-01-14 14:58:42,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-14 14:58:42,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:42,536 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:42,536 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:42,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:42,539 INFO L82 PathProgramCache]: Analyzing trace with hash 543915161, now seen corresponding path program 1 times [2019-01-14 14:58:42,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:42,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:42,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:42,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:42,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:42,637 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:42,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:42,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:42,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:42,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:42,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:42,640 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-01-14 14:58:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:42,820 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-01-14 14:58:42,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:42,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-01-14 14:58:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:42,826 INFO L225 Difference]: With dead ends: 757 [2019-01-14 14:58:42,826 INFO L226 Difference]: Without dead ends: 755 [2019-01-14 14:58:42,827 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:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-01-14 14:58:42,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-01-14 14:58:42,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-01-14 14:58:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-01-14 14:58:42,851 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-01-14 14:58:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:42,851 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-01-14 14:58:42,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-01-14 14:58:42,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-14 14:58:42,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:42,856 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:42,856 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:42,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:42,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1286959367, now seen corresponding path program 1 times [2019-01-14 14:58:42,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:42,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:42,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:42,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:42,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-14 14:58:42,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:42,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:42,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:42,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:42,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:42,940 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-01-14 14:58:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:43,226 INFO L93 Difference]: Finished difference Result 1587 states and 2515 transitions. [2019-01-14 14:58:43,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:43,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-14 14:58:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:43,230 INFO L225 Difference]: With dead ends: 1587 [2019-01-14 14:58:43,230 INFO L226 Difference]: Without dead ends: 839 [2019-01-14 14:58:43,231 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,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-01-14 14:58:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 831. [2019-01-14 14:58:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-01-14 14:58:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1313 transitions. [2019-01-14 14:58:43,255 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1313 transitions. Word has length 121 [2019-01-14 14:58:43,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:43,255 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1313 transitions. [2019-01-14 14:58:43,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1313 transitions. [2019-01-14 14:58:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-14 14:58:43,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:43,258 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:43,258 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:43,258 INFO L82 PathProgramCache]: Analyzing trace with hash 203437824, now seen corresponding path program 1 times [2019-01-14 14:58:43,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:43,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:43,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:43,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:43,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-14 14:58:43,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:43,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:43,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:43,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:43,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:43,342 INFO L87 Difference]: Start difference. First operand 831 states and 1313 transitions. Second operand 3 states. [2019-01-14 14:58:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:44,332 INFO L93 Difference]: Finished difference Result 1663 states and 2627 transitions. [2019-01-14 14:58:44,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:44,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-01-14 14:58:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:44,338 INFO L225 Difference]: With dead ends: 1663 [2019-01-14 14:58:44,338 INFO L226 Difference]: Without dead ends: 835 [2019-01-14 14:58:44,340 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,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-01-14 14:58:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 827. [2019-01-14 14:58:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-01-14 14:58:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1301 transitions. [2019-01-14 14:58:44,363 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1301 transitions. Word has length 122 [2019-01-14 14:58:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:44,363 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1301 transitions. [2019-01-14 14:58:44,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1301 transitions. [2019-01-14 14:58:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-14 14:58:44,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:44,366 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:44,366 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:44,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:44,367 INFO L82 PathProgramCache]: Analyzing trace with hash -431636595, now seen corresponding path program 1 times [2019-01-14 14:58:44,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:44,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:44,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:44,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:44,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-01-14 14:58:44,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:44,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:44,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:44,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:44,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:44,463 INFO L87 Difference]: Start difference. First operand 827 states and 1301 transitions. Second operand 3 states. [2019-01-14 14:58:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:45,080 INFO L93 Difference]: Finished difference Result 1723 states and 2711 transitions. [2019-01-14 14:58:45,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:45,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-01-14 14:58:45,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:45,088 INFO L225 Difference]: With dead ends: 1723 [2019-01-14 14:58:45,088 INFO L226 Difference]: Without dead ends: 903 [2019-01-14 14:58:45,089 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,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-01-14 14:58:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 899. [2019-01-14 14:58:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-01-14 14:58:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1409 transitions. [2019-01-14 14:58:45,114 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1409 transitions. Word has length 154 [2019-01-14 14:58:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:45,114 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1409 transitions. [2019-01-14 14:58:45,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1409 transitions. [2019-01-14 14:58:45,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-14 14:58:45,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:45,116 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:45,117 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:45,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:45,117 INFO L82 PathProgramCache]: Analyzing trace with hash 579021766, now seen corresponding path program 1 times [2019-01-14 14:58:45,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:45,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:45,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:45,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-01-14 14:58:45,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:45,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:45,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:45,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:45,205 INFO L87 Difference]: Start difference. First operand 899 states and 1409 transitions. Second operand 3 states. [2019-01-14 14:58:45,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:45,774 INFO L93 Difference]: Finished difference Result 1795 states and 2811 transitions. [2019-01-14 14:58:45,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:45,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-01-14 14:58:45,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:45,778 INFO L225 Difference]: With dead ends: 1795 [2019-01-14 14:58:45,778 INFO L226 Difference]: Without dead ends: 899 [2019-01-14 14:58:45,779 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,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-01-14 14:58:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 895. [2019-01-14 14:58:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-01-14 14:58:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1395 transitions. [2019-01-14 14:58:45,807 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1395 transitions. Word has length 155 [2019-01-14 14:58:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:45,807 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1395 transitions. [2019-01-14 14:58:45,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1395 transitions. [2019-01-14 14:58:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-14 14:58:45,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:45,810 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:45,810 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:45,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:45,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1624823262, now seen corresponding path program 1 times [2019-01-14 14:58:45,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:45,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:45,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:45,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-01-14 14:58:45,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:45,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:45,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:45,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:45,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:45,877 INFO L87 Difference]: Start difference. First operand 895 states and 1395 transitions. Second operand 3 states. [2019-01-14 14:58:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:46,142 INFO L93 Difference]: Finished difference Result 1855 states and 2891 transitions. [2019-01-14 14:58:46,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:46,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-01-14 14:58:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:46,154 INFO L225 Difference]: With dead ends: 1855 [2019-01-14 14:58:46,154 INFO L226 Difference]: Without dead ends: 967 [2019-01-14 14:58:46,155 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:46,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-01-14 14:58:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 963. [2019-01-14 14:58:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-01-14 14:58:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1493 transitions. [2019-01-14 14:58:46,183 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1493 transitions. Word has length 185 [2019-01-14 14:58:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:46,183 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 1493 transitions. [2019-01-14 14:58:46,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1493 transitions. [2019-01-14 14:58:46,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-14 14:58:46,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:46,187 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:46,187 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:46,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:46,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1103681317, now seen corresponding path program 1 times [2019-01-14 14:58:46,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:46,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:46,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:46,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:46,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-01-14 14:58:46,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:46,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:46,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:46,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:46,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:46,284 INFO L87 Difference]: Start difference. First operand 963 states and 1493 transitions. Second operand 3 states. [2019-01-14 14:58:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:46,550 INFO L93 Difference]: Finished difference Result 1923 states and 2979 transitions. [2019-01-14 14:58:46,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:46,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-01-14 14:58:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:46,556 INFO L225 Difference]: With dead ends: 1923 [2019-01-14 14:58:46,556 INFO L226 Difference]: Without dead ends: 963 [2019-01-14 14:58:46,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-01-14 14:58:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 959. [2019-01-14 14:58:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-01-14 14:58:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1477 transitions. [2019-01-14 14:58:46,583 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1477 transitions. Word has length 186 [2019-01-14 14:58:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:46,583 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1477 transitions. [2019-01-14 14:58:46,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1477 transitions. [2019-01-14 14:58:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-01-14 14:58:46,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:46,586 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:46,586 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:46,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:46,586 INFO L82 PathProgramCache]: Analyzing trace with hash 550080402, now seen corresponding path program 1 times [2019-01-14 14:58:46,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:46,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:46,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:46,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:46,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-01-14 14:58:46,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:46,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:46,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:46,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:46,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:46,673 INFO L87 Difference]: Start difference. First operand 959 states and 1477 transitions. Second operand 3 states. [2019-01-14 14:58:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:46,828 INFO L93 Difference]: Finished difference Result 1987 states and 3067 transitions. [2019-01-14 14:58:46,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:46,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-01-14 14:58:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:46,833 INFO L225 Difference]: With dead ends: 1987 [2019-01-14 14:58:46,833 INFO L226 Difference]: Without dead ends: 1035 [2019-01-14 14:58:46,834 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:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-01-14 14:58:46,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-01-14 14:58:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-01-14 14:58:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1541 transitions. [2019-01-14 14:58:46,861 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1541 transitions. Word has length 203 [2019-01-14 14:58:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:46,862 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 1541 transitions. [2019-01-14 14:58:46,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1541 transitions. [2019-01-14 14:58:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-14 14:58:46,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:46,864 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:46,864 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:46,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:46,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1613413310, now seen corresponding path program 1 times [2019-01-14 14:58:46,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:46,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:46,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:46,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:46,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-01-14 14:58:46,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:46,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:46,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:46,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:46,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:46,924 INFO L87 Difference]: Start difference. First operand 1009 states and 1541 transitions. Second operand 3 states. [2019-01-14 14:58:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:47,091 INFO L93 Difference]: Finished difference Result 2037 states and 3113 transitions. [2019-01-14 14:58:47,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:47,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-01-14 14:58:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:47,098 INFO L225 Difference]: With dead ends: 2037 [2019-01-14 14:58:47,098 INFO L226 Difference]: Without dead ends: 1035 [2019-01-14 14:58:47,100 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:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-01-14 14:58:47,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1009. [2019-01-14 14:58:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-01-14 14:58:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1523 transitions. [2019-01-14 14:58:47,129 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1523 transitions. Word has length 204 [2019-01-14 14:58:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:47,131 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 1523 transitions. [2019-01-14 14:58:47,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1523 transitions. [2019-01-14 14:58:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-14 14:58:47,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:47,135 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:47,135 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:47,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1583018131, now seen corresponding path program 1 times [2019-01-14 14:58:47,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:47,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:47,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:47,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:47,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-01-14 14:58:47,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:47,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:47,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:47,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:47,237 INFO L87 Difference]: Start difference. First operand 1009 states and 1523 transitions. Second operand 3 states. [2019-01-14 14:58:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:47,926 INFO L93 Difference]: Finished difference Result 2019 states and 3045 transitions. [2019-01-14 14:58:47,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:47,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-01-14 14:58:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:47,930 INFO L225 Difference]: With dead ends: 2019 [2019-01-14 14:58:47,930 INFO L226 Difference]: Without dead ends: 1017 [2019-01-14 14:58:47,931 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:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-01-14 14:58:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1009. [2019-01-14 14:58:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-01-14 14:58:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1511 transitions. [2019-01-14 14:58:47,957 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1511 transitions. Word has length 216 [2019-01-14 14:58:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:47,958 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 1511 transitions. [2019-01-14 14:58:47,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1511 transitions. [2019-01-14 14:58:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-14 14:58:47,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:47,960 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:47,960 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1099234138, now seen corresponding path program 1 times [2019-01-14 14:58:47,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:47,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:47,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-01-14 14:58:48,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:48,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:48,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:48,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:48,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:48,076 INFO L87 Difference]: Start difference. First operand 1009 states and 1511 transitions. Second operand 3 states. [2019-01-14 14:58:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:48,874 INFO L93 Difference]: Finished difference Result 2019 states and 3021 transitions. [2019-01-14 14:58:48,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:48,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-01-14 14:58:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:48,883 INFO L225 Difference]: With dead ends: 2019 [2019-01-14 14:58:48,883 INFO L226 Difference]: Without dead ends: 999 [2019-01-14 14:58:48,884 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:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-01-14 14:58:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 991. [2019-01-14 14:58:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-01-14 14:58:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1473 transitions. [2019-01-14 14:58:48,908 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1473 transitions. Word has length 217 [2019-01-14 14:58:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:48,908 INFO L480 AbstractCegarLoop]: Abstraction has 991 states and 1473 transitions. [2019-01-14 14:58:48,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1473 transitions. [2019-01-14 14:58:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-01-14 14:58:48,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:48,912 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:48,912 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:48,913 INFO L82 PathProgramCache]: Analyzing trace with hash -30789295, now seen corresponding path program 1 times [2019-01-14 14:58:48,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:48,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:48,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:48,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:48,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-01-14 14:58:48,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:48,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:48,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:48,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:48,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:48,996 INFO L87 Difference]: Start difference. First operand 991 states and 1473 transitions. Second operand 3 states. [2019-01-14 14:58:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:49,151 INFO L93 Difference]: Finished difference Result 2029 states and 3019 transitions. [2019-01-14 14:58:49,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:49,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-01-14 14:58:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:49,155 INFO L225 Difference]: With dead ends: 2029 [2019-01-14 14:58:49,155 INFO L226 Difference]: Without dead ends: 1045 [2019-01-14 14:58:49,157 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:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-01-14 14:58:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1037. [2019-01-14 14:58:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-01-14 14:58:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1527 transitions. [2019-01-14 14:58:49,178 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1527 transitions. Word has length 224 [2019-01-14 14:58:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:49,179 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1527 transitions. [2019-01-14 14:58:49,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1527 transitions. [2019-01-14 14:58:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-14 14:58:49,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:49,181 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:49,181 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:49,182 INFO L82 PathProgramCache]: Analyzing trace with hash 812836165, now seen corresponding path program 1 times [2019-01-14 14:58:49,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:49,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:49,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:49,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:49,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-01-14 14:58:49,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:49,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:49,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:49,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:49,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:49,274 INFO L87 Difference]: Start difference. First operand 1037 states and 1527 transitions. Second operand 3 states. [2019-01-14 14:58:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:49,444 INFO L93 Difference]: Finished difference Result 2075 states and 3053 transitions. [2019-01-14 14:58:49,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:49,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-01-14 14:58:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:49,448 INFO L225 Difference]: With dead ends: 2075 [2019-01-14 14:58:49,448 INFO L226 Difference]: Without dead ends: 1037 [2019-01-14 14:58:49,449 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:49,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-01-14 14:58:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1029. [2019-01-14 14:58:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-01-14 14:58:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1495 transitions. [2019-01-14 14:58:49,474 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1495 transitions. Word has length 225 [2019-01-14 14:58:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:49,474 INFO L480 AbstractCegarLoop]: Abstraction has 1029 states and 1495 transitions. [2019-01-14 14:58:49,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1495 transitions. [2019-01-14 14:58:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-14 14:58:49,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:49,476 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:49,477 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:49,477 INFO L82 PathProgramCache]: Analyzing trace with hash 497301888, now seen corresponding path program 1 times [2019-01-14 14:58:49,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:49,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:49,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:49,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:49,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-01-14 14:58:49,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:58:49,585 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:49,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:49,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:58:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-01-14 14:58:49,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:58:49,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:58:49,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:58:49,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:58:49,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:58:49,971 INFO L87 Difference]: Start difference. First operand 1029 states and 1495 transitions. Second operand 5 states. [2019-01-14 14:58:51,710 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 14:58:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:52,675 INFO L93 Difference]: Finished difference Result 4090 states and 5918 transitions. [2019-01-14 14:58:52,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 14:58:52,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2019-01-14 14:58:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:52,692 INFO L225 Difference]: With dead ends: 4090 [2019-01-14 14:58:52,692 INFO L226 Difference]: Without dead ends: 3035 [2019-01-14 14:58:52,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 14:58:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2019-01-14 14:58:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 1740. [2019-01-14 14:58:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1740 states. [2019-01-14 14:58:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2496 transitions. [2019-01-14 14:58:52,768 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2496 transitions. Word has length 261 [2019-01-14 14:58:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:52,768 INFO L480 AbstractCegarLoop]: Abstraction has 1740 states and 2496 transitions. [2019-01-14 14:58:52,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:58:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2496 transitions. [2019-01-14 14:58:52,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-14 14:58:52,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:52,775 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:52,775 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:52,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:52,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1933393930, now seen corresponding path program 1 times [2019-01-14 14:58:52,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:52,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:52,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:52,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:52,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-01-14 14:58:52,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:52,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:52,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:52,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:52,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:52,939 INFO L87 Difference]: Start difference. First operand 1740 states and 2496 transitions. Second operand 3 states. [2019-01-14 14:58:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:53,169 INFO L93 Difference]: Finished difference Result 4813 states and 6857 transitions. [2019-01-14 14:58:53,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:53,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-01-14 14:58:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:53,185 INFO L225 Difference]: With dead ends: 4813 [2019-01-14 14:58:53,186 INFO L226 Difference]: Without dead ends: 3080 [2019-01-14 14:58:53,189 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,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3080 states. [2019-01-14 14:58:53,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3080 to 3078. [2019-01-14 14:58:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3078 states. [2019-01-14 14:58:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4362 transitions. [2019-01-14 14:58:53,311 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4362 transitions. Word has length 268 [2019-01-14 14:58:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:53,311 INFO L480 AbstractCegarLoop]: Abstraction has 3078 states and 4362 transitions. [2019-01-14 14:58:53,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4362 transitions. [2019-01-14 14:58:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-14 14:58:53,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:53,318 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:53,319 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:53,320 INFO L82 PathProgramCache]: Analyzing trace with hash -333999477, now seen corresponding path program 1 times [2019-01-14 14:58:53,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:53,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:53,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:53,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-01-14 14:58:53,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:53,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:53,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:53,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:53,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:53,477 INFO L87 Difference]: Start difference. First operand 3078 states and 4362 transitions. Second operand 3 states. [2019-01-14 14:58:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:53,830 INFO L93 Difference]: Finished difference Result 6269 states and 8893 transitions. [2019-01-14 14:58:53,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:53,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-01-14 14:58:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:53,840 INFO L225 Difference]: With dead ends: 6269 [2019-01-14 14:58:53,841 INFO L226 Difference]: Without dead ends: 1949 [2019-01-14 14:58:53,845 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,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2019-01-14 14:58:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1942. [2019-01-14 14:58:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-01-14 14:58:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-01-14 14:58:53,913 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 305 [2019-01-14 14:58:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:53,914 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-01-14 14:58:53,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-01-14 14:58:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-01-14 14:58:53,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:53,923 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:53,923 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:53,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:53,924 INFO L82 PathProgramCache]: Analyzing trace with hash -722402039, now seen corresponding path program 1 times [2019-01-14 14:58:53,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:53,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:53,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:53,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:53,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-01-14 14:58:54,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:58:54,196 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:54,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:54,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:58:54,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-01-14 14:58:54,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 14:58:54,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 14:58:54,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 14:58:54,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 14:58:54,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 14:58:54,538 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 4 states. [2019-01-14 14:58:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:54,906 INFO L93 Difference]: Finished difference Result 4797 states and 6654 transitions. [2019-01-14 14:58:54,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 14:58:54,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2019-01-14 14:58:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:54,919 INFO L225 Difference]: With dead ends: 4797 [2019-01-14 14:58:54,920 INFO L226 Difference]: Without dead ends: 2724 [2019-01-14 14:58:54,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 601 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:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2019-01-14 14:58:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 1942. [2019-01-14 14:58:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-01-14 14:58:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2683 transitions. [2019-01-14 14:58:54,993 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2683 transitions. Word has length 599 [2019-01-14 14:58:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:54,995 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 2683 transitions. [2019-01-14 14:58:54,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 14:58:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2683 transitions. [2019-01-14 14:58:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-01-14 14:58:55,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:55,002 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:55,002 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:55,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:55,003 INFO L82 PathProgramCache]: Analyzing trace with hash 914135564, now seen corresponding path program 1 times [2019-01-14 14:58:55,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:55,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:55,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:55,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:55,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-01-14 14:58:55,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:55,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:55,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:55,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:55,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:55,323 INFO L87 Difference]: Start difference. First operand 1942 states and 2683 transitions. Second operand 3 states. [2019-01-14 14:58:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:55,564 INFO L93 Difference]: Finished difference Result 3917 states and 5403 transitions. [2019-01-14 14:58:55,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:55,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 669 [2019-01-14 14:58:55,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:55,570 INFO L225 Difference]: With dead ends: 3917 [2019-01-14 14:58:55,570 INFO L226 Difference]: Without dead ends: 1982 [2019-01-14 14:58:55,572 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,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-01-14 14:58:55,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1942. [2019-01-14 14:58:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-01-14 14:58:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2663 transitions. [2019-01-14 14:58:55,638 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2663 transitions. Word has length 669 [2019-01-14 14:58:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:55,639 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 2663 transitions. [2019-01-14 14:58:55,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2663 transitions. [2019-01-14 14:58:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-01-14 14:58:55,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:55,646 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:55,646 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:55,647 INFO L82 PathProgramCache]: Analyzing trace with hash 551234930, now seen corresponding path program 1 times [2019-01-14 14:58:55,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:55,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:55,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:55,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:55,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-01-14 14:58:56,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:56,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:56,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:56,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:56,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:56,151 INFO L87 Difference]: Start difference. First operand 1942 states and 2663 transitions. Second operand 3 states. [2019-01-14 14:58:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:56,430 INFO L93 Difference]: Finished difference Result 3892 states and 5332 transitions. [2019-01-14 14:58:56,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:56,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2019-01-14 14:58:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:56,436 INFO L225 Difference]: With dead ends: 3892 [2019-01-14 14:58:56,436 INFO L226 Difference]: Without dead ends: 1957 [2019-01-14 14:58:56,438 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,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2019-01-14 14:58:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1929. [2019-01-14 14:58:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2019-01-14 14:58:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2604 transitions. [2019-01-14 14:58:56,499 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2604 transitions. Word has length 683 [2019-01-14 14:58:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:56,500 INFO L480 AbstractCegarLoop]: Abstraction has 1929 states and 2604 transitions. [2019-01-14 14:58:56,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2604 transitions. [2019-01-14 14:58:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-01-14 14:58:56,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:56,505 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:56,505 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:56,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:56,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1986025501, now seen corresponding path program 1 times [2019-01-14 14:58:56,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:56,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:56,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:56,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:56,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-01-14 14:58:56,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:56,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:56,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:56,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:56,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:56,939 INFO L87 Difference]: Start difference. First operand 1929 states and 2604 transitions. Second operand 3 states. [2019-01-14 14:58:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:57,165 INFO L93 Difference]: Finished difference Result 3921 states and 5296 transitions. [2019-01-14 14:58:57,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:57,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 711 [2019-01-14 14:58:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:57,171 INFO L225 Difference]: With dead ends: 3921 [2019-01-14 14:58:57,171 INFO L226 Difference]: Without dead ends: 1981 [2019-01-14 14:58:57,173 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,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-01-14 14:58:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-01-14 14:58:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-01-14 14:58:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2649 transitions. [2019-01-14 14:58:57,246 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2649 transitions. Word has length 711 [2019-01-14 14:58:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:57,247 INFO L480 AbstractCegarLoop]: Abstraction has 1971 states and 2649 transitions. [2019-01-14 14:58:57,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2649 transitions. [2019-01-14 14:58:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2019-01-14 14:58:57,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:57,257 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:57,258 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:57,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:57,258 INFO L82 PathProgramCache]: Analyzing trace with hash -120199639, now seen corresponding path program 1 times [2019-01-14 14:58:57,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:57,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:57,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:57,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-01-14 14:58:57,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:57,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:57,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:57,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:57,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:57,583 INFO L87 Difference]: Start difference. First operand 1971 states and 2649 transitions. Second operand 3 states. [2019-01-14 14:58:57,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:57,970 INFO L93 Difference]: Finished difference Result 2519 states and 3369 transitions. [2019-01-14 14:58:57,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:57,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 726 [2019-01-14 14:58:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:57,972 INFO L225 Difference]: With dead ends: 2519 [2019-01-14 14:58:57,972 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 14:58:57,974 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,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 14:58:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 14:58:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 14:58:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 14:58:57,975 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 726 [2019-01-14 14:58:57,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:57,976 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 14:58:57,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 14:58:57,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 14:58:57,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 14:58:58,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,953 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 141 [2019-01-14 14:58:58,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:58,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:59,245 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 141 [2019-01-14 14:58:59,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:59,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:59,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:59,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:58:59,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 14:59:00,593 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2019-01-14 14:59:01,147 WARN L181 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-01-14 14:59:01,260 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2019-01-14 14:59:02,746 WARN L181 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-01-14 14:59:03,257 WARN L181 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-01-14 14:59:03,638 WARN L181 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-01-14 14:59:03,907 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-01-14 14:59:04,192 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-01-14 14:59:04,934 WARN L181 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-01-14 14:59:05,237 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-01-14 14:59:05,536 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-01-14 14:59:05,996 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2019-01-14 14:59:06,326 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 90 [2019-01-14 14:59:06,668 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-01-14 14:59:07,299 WARN L181 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 69 [2019-01-14 14:59:07,584 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-01-14 14:59:08,195 WARN L181 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 69 [2019-01-14 14:59:08,844 WARN L181 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-01-14 14:59:09,175 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2019-01-14 14:59:09,455 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-01-14 14:59:10,347 WARN L181 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2019-01-14 14:59:10,350 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 367) no Hoare annotation was computed. [2019-01-14 14:59:10,350 INFO L448 ceAbstractionStarter]: For program point L333-1(lines 333 367) no Hoare annotation was computed. [2019-01-14 14:59:10,350 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 545) no Hoare annotation was computed. [2019-01-14 14:59:10,350 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 556) no Hoare annotation was computed. [2019-01-14 14:59:10,350 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 567) no Hoare annotation was computed. [2019-01-14 14:59:10,351 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 578) no Hoare annotation was computed. [2019-01-14 14:59:10,351 INFO L451 ceAbstractionStarter]: At program point L598(lines 98 599) the Hoare annotation is: true [2019-01-14 14:59:10,351 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-01-14 14:59:10,351 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-01-14 14:59:10,351 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2019-01-14 14:59:10,351 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 364) no Hoare annotation was computed. [2019-01-14 14:59:10,352 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 546) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)))) [2019-01-14 14:59:10,352 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 578) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) [2019-01-14 14:59:10,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-01-14 14:59:10,352 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 544) no Hoare annotation was computed. [2019-01-14 14:59:10,352 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 555) no Hoare annotation was computed. [2019-01-14 14:59:10,353 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 566) no Hoare annotation was computed. [2019-01-14 14:59:10,353 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 577) no Hoare annotation was computed. [2019-01-14 14:59:10,353 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 311) no Hoare annotation was computed. [2019-01-14 14:59:10,353 INFO L448 ceAbstractionStarter]: For program point L304-2(lines 304 311) no Hoare annotation was computed. [2019-01-14 14:59:10,353 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 544) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-14 14:59:10,353 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 556) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse17 .cse18 .cse19 .cse20 .cse21) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2019-01-14 14:59:10,354 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 567) the Hoare annotation is: (let ((.cse0 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-14 14:59:10,354 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-01-14 14:59:10,354 INFO L448 ceAbstractionStarter]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-01-14 14:59:10,354 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-01-14 14:59:10,354 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 362) no Hoare annotation was computed. [2019-01-14 14:59:10,354 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 544) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-14 14:59:10,354 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 554) no Hoare annotation was computed. [2019-01-14 14:59:10,354 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 565) no Hoare annotation was computed. [2019-01-14 14:59:10,354 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 576) no Hoare annotation was computed. [2019-01-14 14:59:10,355 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2019-01-14 14:59:10,355 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 541) no Hoare annotation was computed. [2019-01-14 14:59:10,355 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2019-01-14 14:59:10,355 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-01-14 14:59:10,355 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 346) no Hoare annotation was computed. [2019-01-14 14:59:10,355 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 346) no Hoare annotation was computed. [2019-01-14 14:59:10,355 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2019-01-14 14:59:10,355 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 553) no Hoare annotation was computed. [2019-01-14 14:59:10,355 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 564) no Hoare annotation was computed. [2019-01-14 14:59:10,355 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 575) no Hoare annotation was computed. [2019-01-14 14:59:10,355 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2019-01-14 14:59:10,355 INFO L448 ceAbstractionStarter]: For program point L475-2(lines 208 541) no Hoare annotation was computed. [2019-01-14 14:59:10,356 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 408) no Hoare annotation was computed. [2019-01-14 14:59:10,356 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2019-01-14 14:59:10,356 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 577) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0)) (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-14 14:59:10,356 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 554) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-14 14:59:10,356 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 565) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2019-01-14 14:59:10,357 INFO L451 ceAbstractionStarter]: At program point L608(lines 11 610) the Hoare annotation is: true [2019-01-14 14:59:10,357 INFO L444 ceAbstractionStarter]: At program point L542(lines 99 597) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-14 14:59:10,357 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2019-01-14 14:59:10,357 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 383) no Hoare annotation was computed. [2019-01-14 14:59:10,357 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 552) no Hoare annotation was computed. [2019-01-14 14:59:10,357 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 563) no Hoare annotation was computed. [2019-01-14 14:59:10,357 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 574) no Hoare annotation was computed. [2019-01-14 14:59:10,357 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-01-14 14:59:10,357 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-01-14 14:59:10,358 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-01-14 14:59:10,358 INFO L444 ceAbstractionStarter]: At program point L513(lines 72 609) the Hoare annotation is: false [2019-01-14 14:59:10,358 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-01-14 14:59:10,358 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2019-01-14 14:59:10,358 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 551) no Hoare annotation was computed. [2019-01-14 14:59:10,358 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 562) no Hoare annotation was computed. [2019-01-14 14:59:10,358 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2019-01-14 14:59:10,358 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 573) no Hoare annotation was computed. [2019-01-14 14:59:10,358 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-01-14 14:59:10,358 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 485) no Hoare annotation was computed. [2019-01-14 14:59:10,358 INFO L448 ceAbstractionStarter]: For program point L481-2(lines 481 485) no Hoare annotation was computed. [2019-01-14 14:59:10,359 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 552) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse17 .cse18 .cse19 .cse20 .cse21) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)))) [2019-01-14 14:59:10,359 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 563) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-01-14 14:59:10,359 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-01-14 14:59:10,359 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-01-14 14:59:10,359 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-01-14 14:59:10,359 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-01-14 14:59:10,359 INFO L448 ceAbstractionStarter]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-01-14 14:59:10,360 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 358) no Hoare annotation was computed. [2019-01-14 14:59:10,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 14:59:10,360 INFO L444 ceAbstractionStarter]: At program point L351(lines 327 369) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-01-14 14:59:10,360 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 550) no Hoare annotation was computed. [2019-01-14 14:59:10,360 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 561) no Hoare annotation was computed. [2019-01-14 14:59:10,360 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 572) no Hoare annotation was computed. [2019-01-14 14:59:10,360 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-01-14 14:59:10,360 INFO L448 ceAbstractionStarter]: For program point L418(lines 418 420) no Hoare annotation was computed. [2019-01-14 14:59:10,361 INFO L444 ceAbstractionStarter]: At program point L385(lines 376 408) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2019-01-14 14:59:10,361 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 573) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-14 14:59:10,361 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 355) no Hoare annotation was computed. [2019-01-14 14:59:10,361 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2019-01-14 14:59:10,361 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-01-14 14:59:10,361 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 208 541) no Hoare annotation was computed. [2019-01-14 14:59:10,361 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-01-14 14:59:10,361 INFO L448 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-01-14 14:59:10,361 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 325) no Hoare annotation was computed. [2019-01-14 14:59:10,361 INFO L448 ceAbstractionStarter]: For program point L321-2(lines 208 541) no Hoare annotation was computed. [2019-01-14 14:59:10,362 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 549) no Hoare annotation was computed. [2019-01-14 14:59:10,362 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 560) no Hoare annotation was computed. [2019-01-14 14:59:10,362 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 571) no Hoare annotation was computed. [2019-01-14 14:59:10,362 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-01-14 14:59:10,362 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 609) no Hoare annotation was computed. [2019-01-14 14:59:10,362 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 406) no Hoare annotation was computed. [2019-01-14 14:59:10,362 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 14:59:10,362 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 550) the Hoare annotation is: (let ((.cse0 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse3 .cse2 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2019-01-14 14:59:10,363 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 561) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2019-01-14 14:59:10,363 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 571) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) [2019-01-14 14:59:10,363 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-01-14 14:59:10,363 INFO L451 ceAbstractionStarter]: At program point L620(lines 611 622) the Hoare annotation is: true [2019-01-14 14:59:10,363 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-01-14 14:59:10,363 INFO L448 ceAbstractionStarter]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-01-14 14:59:10,363 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 548) no Hoare annotation was computed. [2019-01-14 14:59:10,363 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 559) no Hoare annotation was computed. [2019-01-14 14:59:10,363 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 570) no Hoare annotation was computed. [2019-01-14 14:59:10,364 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2019-01-14 14:59:10,364 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2019-01-14 14:59:10,364 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-01-14 14:59:10,364 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 541) no Hoare annotation was computed. [2019-01-14 14:59:10,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 14:59:10,364 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 494) no Hoare annotation was computed. [2019-01-14 14:59:10,364 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-01-14 14:59:10,364 INFO L448 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-01-14 14:59:10,364 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 426 434) no Hoare annotation was computed. [2019-01-14 14:59:10,364 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-01-14 14:59:10,364 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 547) no Hoare annotation was computed. [2019-01-14 14:59:10,364 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 558) no Hoare annotation was computed. [2019-01-14 14:59:10,365 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 569) no Hoare annotation was computed. [2019-01-14 14:59:10,365 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 548) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-14 14:59:10,365 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 559) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2019-01-14 14:59:10,365 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2019-01-14 14:59:10,365 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 368) no Hoare annotation was computed. [2019-01-14 14:59:10,365 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 546) no Hoare annotation was computed. [2019-01-14 14:59:10,365 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 557) no Hoare annotation was computed. [2019-01-14 14:59:10,365 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 568) no Hoare annotation was computed. [2019-01-14 14:59:10,366 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 597) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (and (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-14 14:59:10,366 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-01-14 14:59:10,366 INFO L448 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-01-14 14:59:10,366 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-01-14 14:59:10,366 INFO L448 ceAbstractionStarter]: For program point L496-2(lines 208 541) no Hoare annotation was computed. [2019-01-14 14:59:10,366 INFO L444 ceAbstractionStarter]: At program point L397(lines 388 406) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2019-01-14 14:59:10,366 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2019-01-14 14:59:10,367 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 557) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11 .cse12 .cse13) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-14 14:59:10,367 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 570) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-14 14:59:10,367 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-14 14:59:10,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:59:10 BoogieIcfgContainer [2019-01-14 14:59:10,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 14:59:10,462 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 14:59:10,462 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 14:59:10,462 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 14:59:10,463 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:32" (3/4) ... [2019-01-14 14:59:10,466 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 14:59:10,493 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 14:59:10,495 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 14:59:10,683 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 14:59:10,686 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 14:59:10,687 INFO L168 Benchmark]: Toolchain (without parser) took 40342.18 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 951.4 MB in the beginning and 1.4 GB in the end (delta: -424.9 MB). Peak memory consumption was 650.4 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:10,688 INFO L168 Benchmark]: CDTParser took 0.14 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:10,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.98 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:10,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:10,690 INFO L168 Benchmark]: Boogie Preprocessor took 53.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:59:10,690 INFO L168 Benchmark]: RCFGBuilder took 1287.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:10,690 INFO L168 Benchmark]: TraceAbstraction took 38093.76 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 955.3 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -353.7 MB). Peak memory consumption was 959.6 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:10,693 INFO L168 Benchmark]: Witness Printer took 224.15 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:10,696 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.14 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 536.98 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 139.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1287.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38093.76 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 955.3 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -353.7 MB). Peak memory consumption was 959.6 MB. Max. memory is 11.5 GB. * Witness Printer took 224.15 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8576 == s__state)) && s__s3__tmp__next_state___0 <= 3) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || (((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8544 == s__state)) && !(8545 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(8609 == s__state) && !(8497 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8592 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((((((((((((((((((((((((blastFlag <= 2 && !(8609 == s__state)) && !(8497 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((s__state <= 8672 && 8448 <= s__state) && (((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (s__state <= 8448 && blastFlag <= 2 && !(8448 == s__state)) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || ((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672)) || s__state <= 3) || (blastFlag <= 3 && !(s__hit == 0))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((blastFlag <= 3 && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || ((blastFlag <= 3 && 8672 <= s__state) && s__state <= 8672)) || s__state <= 3) || (blastFlag <= 3 && !(s__hit == 0))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((s__state <= 8672 && 8448 <= s__state) && (((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || (8448 <= s__state && ((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8672) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && blastFlag <= 3) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. SAFE Result, 37.9s OverallTime, 35 OverallIterations, 25 TraceHistogramMax, 18.6s AutomataDifference, 0.0s DeadEndRemovalTime, 12.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 5377 SDtfs, 5141 SDslu, 2062 SDs, 0 SdLazy, 3586 SolverSat, 1406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 949 GetRequests, 906 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3078occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 2330 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 217 NumberOfFragments, 2993 HoareAnnotationTreeSize, 28 FomulaSimplifications, 50067 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 28 FomulaSimplificationsInter, 8865 FormulaSimplificationTreeSizeReductionInter, 10.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 8605 NumberOfCodeBlocks, 8605 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 8568 ConstructedInterpolants, 0 QuantifiedInterpolants, 4199413 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1341 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 37 InterpolantComputations, 34 PerfectInterpolantSequences, 37743/37821 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...