./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/s3_srvr_2_true-unreach-call_true-no-overflow_false-termination.BV.c.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/bitvector/s3_srvr_2_true-unreach-call_true-no-overflow_false-termination.BV.c.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 a763fae72969a01517c5455a7353d92a16a85d9a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:16:38,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:16:38,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:16:38,395 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:16:38,395 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:16:38,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:16:38,398 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:16:38,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:16:38,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:16:38,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:16:38,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:16:38,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:16:38,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:16:38,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:16:38,407 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:16:38,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:16:38,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:16:38,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:16:38,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:16:38,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:16:38,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:16:38,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:16:38,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:16:38,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:16:38,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:16:38,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:16:38,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:16:38,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:16:38,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:16:38,425 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:16:38,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:16:38,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:16:38,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:16:38,427 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:16:38,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:16:38,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:16:38,429 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:16:38,447 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:16:38,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:16:38,449 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:16:38,449 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:16:38,449 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:16:38,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:16:38,450 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:16:38,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:16:38,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:16:38,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:16:38,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:16:38,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:16:38,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:16:38,451 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:16:38,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:16:38,451 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:16:38,451 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:16:38,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:16:38,453 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:16:38,453 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:16:38,454 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:16:38,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:16:38,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:16:38,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:16:38,454 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:16:38,454 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:16:38,455 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:16:38,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:16:38,456 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 -> a763fae72969a01517c5455a7353d92a16a85d9a [2019-01-11 21:16:38,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:16:38,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:16:38,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:16:38,515 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:16:38,515 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:16:38,517 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_srvr_2_true-unreach-call_true-no-overflow_false-termination.BV.c.cil.c [2019-01-11 21:16:38,577 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5db19f11e/a50cca318d7a414cbab01488bd4e7d5a/FLAGe609f4205 [2019-01-11 21:16:38,990 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:16:38,991 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_srvr_2_true-unreach-call_true-no-overflow_false-termination.BV.c.cil.c [2019-01-11 21:16:39,003 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5db19f11e/a50cca318d7a414cbab01488bd4e7d5a/FLAGe609f4205 [2019-01-11 21:16:39,350 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5db19f11e/a50cca318d7a414cbab01488bd4e7d5a [2019-01-11 21:16:39,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:16:39,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:16:39,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:16:39,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:16:39,363 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:16:39,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:16:39" (1/1) ... [2019-01-11 21:16:39,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cbfd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39, skipping insertion in model container [2019-01-11 21:16:39,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:16:39" (1/1) ... [2019-01-11 21:16:39,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:16:39,443 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:16:39,802 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:16:39,808 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:16:39,911 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:16:39,930 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:16:39,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39 WrapperNode [2019-01-11 21:16:39,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:16:39,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:16:39,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:16:39,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:16:40,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39" (1/1) ... [2019-01-11 21:16:40,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39" (1/1) ... [2019-01-11 21:16:40,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:16:40,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:16:40,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:16:40,091 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:16:40,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39" (1/1) ... [2019-01-11 21:16:40,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39" (1/1) ... [2019-01-11 21:16:40,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39" (1/1) ... [2019-01-11 21:16:40,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39" (1/1) ... [2019-01-11 21:16:40,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39" (1/1) ... [2019-01-11 21:16:40,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39" (1/1) ... [2019-01-11 21:16:40,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39" (1/1) ... [2019-01-11 21:16:40,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:16:40,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:16:40,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:16:40,153 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:16:40,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:16:40,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:16:40,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:16:40,404 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:16:41,622 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:16:41,623 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:16:41,625 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:16:41,625 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:16:41,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:16:41 BoogieIcfgContainer [2019-01-11 21:16:41,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:16:41,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:16:41,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:16:41,632 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:16:41,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:16:39" (1/3) ... [2019-01-11 21:16:41,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb2840d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:16:41, skipping insertion in model container [2019-01-11 21:16:41,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:39" (2/3) ... [2019-01-11 21:16:41,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb2840d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:16:41, skipping insertion in model container [2019-01-11 21:16:41,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:16:41" (3/3) ... [2019-01-11 21:16:41,636 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2_true-unreach-call_true-no-overflow_false-termination.BV.c.cil.c [2019-01-11 21:16:41,643 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:16:41,651 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:16:41,663 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:16:41,695 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:16:41,696 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:16:41,697 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:16:41,697 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:16:41,697 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:16:41,697 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:16:41,697 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:16:41,697 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:16:41,698 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:16:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-01-11 21:16:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 21:16:41,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:41,727 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-11 21:16:41,730 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:41,736 INFO L82 PathProgramCache]: Analyzing trace with hash -91609757, now seen corresponding path program 1 times [2019-01-11 21:16:41,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:41,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:41,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:41,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:41,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:16:42,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:42,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:42,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:42,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:42,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:42,052 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-01-11 21:16:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:42,908 INFO L93 Difference]: Finished difference Result 316 states and 546 transitions. [2019-01-11 21:16:42,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:42,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-11 21:16:42,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:42,924 INFO L225 Difference]: With dead ends: 316 [2019-01-11 21:16:42,925 INFO L226 Difference]: Without dead ends: 160 [2019-01-11 21:16:42,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-11 21:16:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-11 21:16:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2019-01-11 21:16:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-11 21:16:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 247 transitions. [2019-01-11 21:16:42,996 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 247 transitions. Word has length 43 [2019-01-11 21:16:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:42,996 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 247 transitions. [2019-01-11 21:16:42,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 247 transitions. [2019-01-11 21:16:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 21:16:43,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:43,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:43,000 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1448029290, now seen corresponding path program 1 times [2019-01-11 21:16:43,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:43,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:43,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:43,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:43,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:16:43,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:43,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:43,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:43,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:43,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:43,133 INFO L87 Difference]: Start difference. First operand 155 states and 247 transitions. Second operand 3 states. [2019-01-11 21:16:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:43,531 INFO L93 Difference]: Finished difference Result 351 states and 564 transitions. [2019-01-11 21:16:43,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:43,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-11 21:16:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:43,538 INFO L225 Difference]: With dead ends: 351 [2019-01-11 21:16:43,538 INFO L226 Difference]: Without dead ends: 201 [2019-01-11 21:16:43,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-11 21:16:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2019-01-11 21:16:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-11 21:16:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 319 transitions. [2019-01-11 21:16:43,559 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 319 transitions. Word has length 44 [2019-01-11 21:16:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:43,560 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 319 transitions. [2019-01-11 21:16:43,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 319 transitions. [2019-01-11 21:16:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-11 21:16:43,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:43,563 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-11 21:16:43,563 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:43,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2008911458, now seen corresponding path program 1 times [2019-01-11 21:16:43,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:43,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:43,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:43,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:16:43,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:43,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:43,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:43,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:43,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:43,688 INFO L87 Difference]: Start difference. First operand 196 states and 319 transitions. Second operand 3 states. [2019-01-11 21:16:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:43,859 INFO L93 Difference]: Finished difference Result 572 states and 934 transitions. [2019-01-11 21:16:43,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:43,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-01-11 21:16:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:43,864 INFO L225 Difference]: With dead ends: 572 [2019-01-11 21:16:43,865 INFO L226 Difference]: Without dead ends: 383 [2019-01-11 21:16:43,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-01-11 21:16:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2019-01-11 21:16:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-01-11 21:16:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 623 transitions. [2019-01-11 21:16:43,895 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 623 transitions. Word has length 59 [2019-01-11 21:16:43,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:43,895 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 623 transitions. [2019-01-11 21:16:43,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 623 transitions. [2019-01-11 21:16:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 21:16:43,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:43,901 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:43,901 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:43,902 INFO L82 PathProgramCache]: Analyzing trace with hash 44999767, now seen corresponding path program 1 times [2019-01-11 21:16:43,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:43,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:43,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:43,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:43,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-11 21:16:43,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:43,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:43,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:43,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:43,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:43,985 INFO L87 Difference]: Start difference. First operand 383 states and 623 transitions. Second operand 3 states. [2019-01-11 21:16:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:44,343 INFO L93 Difference]: Finished difference Result 811 states and 1316 transitions. [2019-01-11 21:16:44,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:44,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-01-11 21:16:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:44,347 INFO L225 Difference]: With dead ends: 811 [2019-01-11 21:16:44,348 INFO L226 Difference]: Without dead ends: 435 [2019-01-11 21:16:44,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-11 21:16:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2019-01-11 21:16:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-01-11 21:16:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 685 transitions. [2019-01-11 21:16:44,375 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 685 transitions. Word has length 80 [2019-01-11 21:16:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:44,375 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 685 transitions. [2019-01-11 21:16:44,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 685 transitions. [2019-01-11 21:16:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-11 21:16:44,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:44,380 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:44,380 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash 586802411, now seen corresponding path program 1 times [2019-01-11 21:16:44,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:44,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:44,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:44,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:44,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-11 21:16:44,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:44,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:44,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:44,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:44,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:44,521 INFO L87 Difference]: Start difference. First operand 425 states and 685 transitions. Second operand 3 states. [2019-01-11 21:16:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:45,248 INFO L93 Difference]: Finished difference Result 853 states and 1374 transitions. [2019-01-11 21:16:45,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:45,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-01-11 21:16:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:45,255 INFO L225 Difference]: With dead ends: 853 [2019-01-11 21:16:45,255 INFO L226 Difference]: Without dead ends: 435 [2019-01-11 21:16:45,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-11 21:16:45,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2019-01-11 21:16:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-01-11 21:16:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 681 transitions. [2019-01-11 21:16:45,281 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 681 transitions. Word has length 81 [2019-01-11 21:16:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:45,282 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 681 transitions. [2019-01-11 21:16:45,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 681 transitions. [2019-01-11 21:16:45,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 21:16:45,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:45,288 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:45,288 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:45,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:45,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1514553016, now seen corresponding path program 1 times [2019-01-11 21:16:45,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:45,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:45,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-11 21:16:45,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:45,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:45,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:45,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:45,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:45,412 INFO L87 Difference]: Start difference. First operand 425 states and 681 transitions. Second operand 3 states. [2019-01-11 21:16:46,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:46,450 INFO L93 Difference]: Finished difference Result 971 states and 1575 transitions. [2019-01-11 21:16:46,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:46,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-11 21:16:46,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:46,460 INFO L225 Difference]: With dead ends: 971 [2019-01-11 21:16:46,461 INFO L226 Difference]: Without dead ends: 553 [2019-01-11 21:16:46,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-01-11 21:16:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 543. [2019-01-11 21:16:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-01-11 21:16:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 797 transitions. [2019-01-11 21:16:46,490 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 797 transitions. Word has length 96 [2019-01-11 21:16:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:46,491 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 797 transitions. [2019-01-11 21:16:46,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 797 transitions. [2019-01-11 21:16:46,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 21:16:46,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:46,494 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:46,494 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:46,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1948282102, now seen corresponding path program 1 times [2019-01-11 21:16:46,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:46,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:46,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:46,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:46,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-11 21:16:46,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:46,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:46,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:46,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:46,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:46,659 INFO L87 Difference]: Start difference. First operand 543 states and 797 transitions. Second operand 3 states. [2019-01-11 21:16:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:47,623 INFO L93 Difference]: Finished difference Result 1167 states and 1733 transitions. [2019-01-11 21:16:47,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:47,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-11 21:16:47,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:47,627 INFO L225 Difference]: With dead ends: 1167 [2019-01-11 21:16:47,628 INFO L226 Difference]: Without dead ends: 631 [2019-01-11 21:16:47,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:47,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-01-11 21:16:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 605. [2019-01-11 21:16:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-01-11 21:16:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 885 transitions. [2019-01-11 21:16:47,648 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 885 transitions. Word has length 96 [2019-01-11 21:16:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:47,649 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 885 transitions. [2019-01-11 21:16:47,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 885 transitions. [2019-01-11 21:16:47,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-11 21:16:47,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:47,651 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-11 21:16:47,652 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:47,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:47,652 INFO L82 PathProgramCache]: Analyzing trace with hash 564782516, now seen corresponding path program 1 times [2019-01-11 21:16:47,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:47,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:47,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:47,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:47,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-11 21:16:47,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:47,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:47,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:47,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:47,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:47,758 INFO L87 Difference]: Start difference. First operand 605 states and 885 transitions. Second operand 3 states. [2019-01-11 21:16:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:48,045 INFO L93 Difference]: Finished difference Result 905 states and 1324 transitions. [2019-01-11 21:16:48,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:48,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-01-11 21:16:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:48,051 INFO L225 Difference]: With dead ends: 905 [2019-01-11 21:16:48,052 INFO L226 Difference]: Without dead ends: 903 [2019-01-11 21:16:48,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-01-11 21:16:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2019-01-11 21:16:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-01-11 21:16:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1322 transitions. [2019-01-11 21:16:48,082 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1322 transitions. Word has length 120 [2019-01-11 21:16:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:48,083 INFO L480 AbstractCegarLoop]: Abstraction has 903 states and 1322 transitions. [2019-01-11 21:16:48,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1322 transitions. [2019-01-11 21:16:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-11 21:16:48,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:48,087 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:48,088 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:48,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:48,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1174075643, now seen corresponding path program 1 times [2019-01-11 21:16:48,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:48,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:48,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:48,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:48,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-01-11 21:16:48,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:48,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:48,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:48,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:48,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:48,212 INFO L87 Difference]: Start difference. First operand 903 states and 1322 transitions. Second operand 3 states. [2019-01-11 21:16:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:48,530 INFO L93 Difference]: Finished difference Result 1877 states and 2732 transitions. [2019-01-11 21:16:48,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:48,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-01-11 21:16:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:48,535 INFO L225 Difference]: With dead ends: 1877 [2019-01-11 21:16:48,536 INFO L226 Difference]: Without dead ends: 981 [2019-01-11 21:16:48,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-01-11 21:16:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 972. [2019-01-11 21:16:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-01-11 21:16:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1406 transitions. [2019-01-11 21:16:48,564 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1406 transitions. Word has length 184 [2019-01-11 21:16:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:48,564 INFO L480 AbstractCegarLoop]: Abstraction has 972 states and 1406 transitions. [2019-01-11 21:16:48,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1406 transitions. [2019-01-11 21:16:48,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-11 21:16:48,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:48,568 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:48,568 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:48,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:48,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1179429289, now seen corresponding path program 1 times [2019-01-11 21:16:48,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:48,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:48,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:48,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:48,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-01-11 21:16:48,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:48,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:48,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:48,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:48,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:48,677 INFO L87 Difference]: Start difference. First operand 972 states and 1406 transitions. Second operand 3 states. [2019-01-11 21:16:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:48,993 INFO L93 Difference]: Finished difference Result 2048 states and 2960 transitions. [2019-01-11 21:16:48,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:48,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-01-11 21:16:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:49,002 INFO L225 Difference]: With dead ends: 2048 [2019-01-11 21:16:49,002 INFO L226 Difference]: Without dead ends: 1083 [2019-01-11 21:16:49,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-01-11 21:16:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1047. [2019-01-11 21:16:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-01-11 21:16:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1496 transitions. [2019-01-11 21:16:49,038 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1496 transitions. Word has length 204 [2019-01-11 21:16:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:49,038 INFO L480 AbstractCegarLoop]: Abstraction has 1047 states and 1496 transitions. [2019-01-11 21:16:49,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1496 transitions. [2019-01-11 21:16:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-11 21:16:49,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:49,044 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:49,044 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1179962115, now seen corresponding path program 1 times [2019-01-11 21:16:49,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:49,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:49,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:49,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:49,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-01-11 21:16:49,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:49,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:49,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:49,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:49,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:49,176 INFO L87 Difference]: Start difference. First operand 1047 states and 1496 transitions. Second operand 3 states. [2019-01-11 21:16:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:49,293 INFO L93 Difference]: Finished difference Result 3109 states and 4430 transitions. [2019-01-11 21:16:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:49,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-01-11 21:16:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:49,305 INFO L225 Difference]: With dead ends: 3109 [2019-01-11 21:16:49,305 INFO L226 Difference]: Without dead ends: 2069 [2019-01-11 21:16:49,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-01-11 21:16:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1050. [2019-01-11 21:16:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-01-11 21:16:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1499 transitions. [2019-01-11 21:16:49,358 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1499 transitions. Word has length 230 [2019-01-11 21:16:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:49,358 INFO L480 AbstractCegarLoop]: Abstraction has 1050 states and 1499 transitions. [2019-01-11 21:16:49,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1499 transitions. [2019-01-11 21:16:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-11 21:16:49,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:49,365 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:49,365 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:49,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:49,366 INFO L82 PathProgramCache]: Analyzing trace with hash -150020643, now seen corresponding path program 1 times [2019-01-11 21:16:49,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:49,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:49,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:49,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:49,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-01-11 21:16:49,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:49,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:49,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:49,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:49,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:49,533 INFO L87 Difference]: Start difference. First operand 1050 states and 1499 transitions. Second operand 3 states. [2019-01-11 21:16:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:49,927 INFO L93 Difference]: Finished difference Result 2195 states and 3134 transitions. [2019-01-11 21:16:49,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:49,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-01-11 21:16:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:49,934 INFO L225 Difference]: With dead ends: 2195 [2019-01-11 21:16:49,934 INFO L226 Difference]: Without dead ends: 1152 [2019-01-11 21:16:49,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:49,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-01-11 21:16:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1131. [2019-01-11 21:16:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2019-01-11 21:16:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1595 transitions. [2019-01-11 21:16:49,968 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1595 transitions. Word has length 230 [2019-01-11 21:16:49,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:49,968 INFO L480 AbstractCegarLoop]: Abstraction has 1131 states and 1595 transitions. [2019-01-11 21:16:49,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1595 transitions. [2019-01-11 21:16:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-11 21:16:49,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:49,973 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:49,973 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:49,973 INFO L82 PathProgramCache]: Analyzing trace with hash -336843366, now seen corresponding path program 1 times [2019-01-11 21:16:49,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:49,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:49,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:49,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:49,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-01-11 21:16:50,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:50,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:50,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:50,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:50,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:50,144 INFO L87 Difference]: Start difference. First operand 1131 states and 1595 transitions. Second operand 3 states. [2019-01-11 21:16:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:50,297 INFO L93 Difference]: Finished difference Result 3373 states and 4754 transitions. [2019-01-11 21:16:50,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:50,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-01-11 21:16:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:50,308 INFO L225 Difference]: With dead ends: 3373 [2019-01-11 21:16:50,309 INFO L226 Difference]: Without dead ends: 2249 [2019-01-11 21:16:50,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-01-11 21:16:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2247. [2019-01-11 21:16:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2247 states. [2019-01-11 21:16:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3163 transitions. [2019-01-11 21:16:50,388 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3163 transitions. Word has length 231 [2019-01-11 21:16:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:50,389 INFO L480 AbstractCegarLoop]: Abstraction has 2247 states and 3163 transitions. [2019-01-11 21:16:50,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3163 transitions. [2019-01-11 21:16:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-01-11 21:16:50,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:50,396 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:50,397 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1934345498, now seen corresponding path program 1 times [2019-01-11 21:16:50,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:50,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:50,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:50,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:50,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-01-11 21:16:50,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:50,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:50,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:50,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:50,540 INFO L87 Difference]: Start difference. First operand 2247 states and 3163 transitions. Second operand 3 states. [2019-01-11 21:16:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:51,301 INFO L93 Difference]: Finished difference Result 4733 states and 6735 transitions. [2019-01-11 21:16:51,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:51,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-01-11 21:16:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:51,314 INFO L225 Difference]: With dead ends: 4733 [2019-01-11 21:16:51,315 INFO L226 Difference]: Without dead ends: 2433 [2019-01-11 21:16:51,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2019-01-11 21:16:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2433. [2019-01-11 21:16:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2019-01-11 21:16:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3379 transitions. [2019-01-11 21:16:51,394 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3379 transitions. Word has length 232 [2019-01-11 21:16:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:51,395 INFO L480 AbstractCegarLoop]: Abstraction has 2433 states and 3379 transitions. [2019-01-11 21:16:51,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3379 transitions. [2019-01-11 21:16:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-11 21:16:51,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:51,404 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:51,404 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:51,406 INFO L82 PathProgramCache]: Analyzing trace with hash -462203708, now seen corresponding path program 1 times [2019-01-11 21:16:51,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:51,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:51,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:51,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:51,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-01-11 21:16:51,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:16:51,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:16:51,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:51,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-01-11 21:16:51,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:16:51,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:16:51,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:16:51,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:16:51,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:16:51,982 INFO L87 Difference]: Start difference. First operand 2433 states and 3379 transitions. Second operand 5 states. [2019-01-11 21:16:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:55,502 INFO L93 Difference]: Finished difference Result 9605 states and 13449 transitions. [2019-01-11 21:16:55,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:16:55,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-01-11 21:16:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:55,535 INFO L225 Difference]: With dead ends: 9605 [2019-01-11 21:16:55,535 INFO L226 Difference]: Without dead ends: 7179 [2019-01-11 21:16:55,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:16:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2019-01-11 21:16:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6121. [2019-01-11 21:16:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6121 states. [2019-01-11 21:16:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 8436 transitions. [2019-01-11 21:16:55,795 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 8436 transitions. Word has length 244 [2019-01-11 21:16:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:55,795 INFO L480 AbstractCegarLoop]: Abstraction has 6121 states and 8436 transitions. [2019-01-11 21:16:55,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:16:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 8436 transitions. [2019-01-11 21:16:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-11 21:16:55,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:55,813 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:55,813 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:55,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:55,814 INFO L82 PathProgramCache]: Analyzing trace with hash 752836901, now seen corresponding path program 1 times [2019-01-11 21:16:55,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:55,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:55,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:55,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:55,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-01-11 21:16:55,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:55,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:55,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:55,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:55,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:55,975 INFO L87 Difference]: Start difference. First operand 6121 states and 8436 transitions. Second operand 3 states. [2019-01-11 21:16:56,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:56,356 INFO L93 Difference]: Finished difference Result 17917 states and 24774 transitions. [2019-01-11 21:16:56,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:56,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-01-11 21:16:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:56,430 INFO L225 Difference]: With dead ends: 17917 [2019-01-11 21:16:56,430 INFO L226 Difference]: Without dead ends: 11803 [2019-01-11 21:16:56,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11803 states. [2019-01-11 21:16:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11803 to 11761. [2019-01-11 21:16:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11761 states. [2019-01-11 21:16:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11761 states to 11761 states and 16256 transitions. [2019-01-11 21:16:56,840 INFO L78 Accepts]: Start accepts. Automaton has 11761 states and 16256 transitions. Word has length 252 [2019-01-11 21:16:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:56,841 INFO L480 AbstractCegarLoop]: Abstraction has 11761 states and 16256 transitions. [2019-01-11 21:16:56,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 11761 states and 16256 transitions. [2019-01-11 21:16:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-01-11 21:16:56,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:56,863 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, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:56,863 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:56,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:56,864 INFO L82 PathProgramCache]: Analyzing trace with hash 134593790, now seen corresponding path program 1 times [2019-01-11 21:16:56,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:56,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:56,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:56,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:56,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 644 proven. 26 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-01-11 21:16:57,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:16:57,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:16:57,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:57,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-01-11 21:16:57,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:16:57,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:16:57,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:16:57,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:16:57,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:16:57,389 INFO L87 Difference]: Start difference. First operand 11761 states and 16256 transitions. Second operand 5 states. [2019-01-11 21:16:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:58,250 INFO L93 Difference]: Finished difference Result 26031 states and 35776 transitions. [2019-01-11 21:16:58,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:16:58,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 298 [2019-01-11 21:16:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:58,274 INFO L225 Difference]: With dead ends: 26031 [2019-01-11 21:16:58,274 INFO L226 Difference]: Without dead ends: 10083 [2019-01-11 21:16:58,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:16:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10083 states. [2019-01-11 21:16:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10083 to 8984. [2019-01-11 21:16:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8984 states. [2019-01-11 21:16:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8984 states to 8984 states and 12019 transitions. [2019-01-11 21:16:58,685 INFO L78 Accepts]: Start accepts. Automaton has 8984 states and 12019 transitions. Word has length 298 [2019-01-11 21:16:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:58,685 INFO L480 AbstractCegarLoop]: Abstraction has 8984 states and 12019 transitions. [2019-01-11 21:16:58,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:16:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 8984 states and 12019 transitions. [2019-01-11 21:16:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-11 21:16:58,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:58,699 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:58,699 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:58,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1551518133, now seen corresponding path program 1 times [2019-01-11 21:16:58,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:58,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:58,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2019-01-11 21:16:58,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:58,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:58,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:58,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:58,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:58,835 INFO L87 Difference]: Start difference. First operand 8984 states and 12019 transitions. Second operand 3 states. [2019-01-11 21:16:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:59,103 INFO L93 Difference]: Finished difference Result 18177 states and 24396 transitions. [2019-01-11 21:16:59,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:59,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-01-11 21:16:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:59,119 INFO L225 Difference]: With dead ends: 18177 [2019-01-11 21:16:59,119 INFO L226 Difference]: Without dead ends: 9224 [2019-01-11 21:16:59,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9224 states. [2019-01-11 21:16:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9224 to 7756. [2019-01-11 21:16:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7756 states. [2019-01-11 21:16:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7756 states to 7756 states and 10407 transitions. [2019-01-11 21:16:59,349 INFO L78 Accepts]: Start accepts. Automaton has 7756 states and 10407 transitions. Word has length 321 [2019-01-11 21:16:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:59,349 INFO L480 AbstractCegarLoop]: Abstraction has 7756 states and 10407 transitions. [2019-01-11 21:16:59,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7756 states and 10407 transitions. [2019-01-11 21:16:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-01-11 21:16:59,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:59,362 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:59,364 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:59,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:59,364 INFO L82 PathProgramCache]: Analyzing trace with hash -16053374, now seen corresponding path program 1 times [2019-01-11 21:16:59,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:59,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 871 proven. 26 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-01-11 21:16:59,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:16:59,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:16:59,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:59,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2019-01-11 21:16:59,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:16:59,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:16:59,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:16:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:16:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:16:59,935 INFO L87 Difference]: Start difference. First operand 7756 states and 10407 transitions. Second operand 5 states. [2019-01-11 21:17:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:00,737 INFO L93 Difference]: Finished difference Result 15646 states and 21041 transitions. [2019-01-11 21:17:00,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:17:00,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 354 [2019-01-11 21:17:00,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:00,752 INFO L225 Difference]: With dead ends: 15646 [2019-01-11 21:17:00,752 INFO L226 Difference]: Without dead ends: 7620 [2019-01-11 21:17:00,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:17:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2019-01-11 21:17:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 5286. [2019-01-11 21:17:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5286 states. [2019-01-11 21:17:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 7044 transitions. [2019-01-11 21:17:00,929 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 7044 transitions. Word has length 354 [2019-01-11 21:17:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:00,929 INFO L480 AbstractCegarLoop]: Abstraction has 5286 states and 7044 transitions. [2019-01-11 21:17:00,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:17:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 7044 transitions. [2019-01-11 21:17:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-01-11 21:17:00,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:00,942 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:00,942 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:00,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:00,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1296482981, now seen corresponding path program 1 times [2019-01-11 21:17:00,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:00,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:00,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:00,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:00,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2932 backedges. 1676 proven. 0 refuted. 0 times theorem prover too weak. 1256 trivial. 0 not checked. [2019-01-11 21:17:01,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:01,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:01,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:01,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:01,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:01,198 INFO L87 Difference]: Start difference. First operand 5286 states and 7044 transitions. Second operand 3 states. [2019-01-11 21:17:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:01,630 INFO L93 Difference]: Finished difference Result 11153 states and 14786 transitions. [2019-01-11 21:17:01,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:01,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 495 [2019-01-11 21:17:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:01,636 INFO L225 Difference]: With dead ends: 11153 [2019-01-11 21:17:01,636 INFO L226 Difference]: Without dead ends: 5898 [2019-01-11 21:17:01,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5898 states. [2019-01-11 21:17:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5898 to 5864. [2019-01-11 21:17:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5864 states. [2019-01-11 21:17:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 7707 transitions. [2019-01-11 21:17:01,835 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 7707 transitions. Word has length 495 [2019-01-11 21:17:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:01,836 INFO L480 AbstractCegarLoop]: Abstraction has 5864 states and 7707 transitions. [2019-01-11 21:17:01,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 7707 transitions. [2019-01-11 21:17:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-01-11 21:17:01,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:01,853 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 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] [2019-01-11 21:17:01,853 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:01,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1496383928, now seen corresponding path program 1 times [2019-01-11 21:17:01,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:01,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:01,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:01,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:01,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1986 proven. 16 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2019-01-11 21:17:02,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:02,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:02,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:02,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:03,039 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_ssl3_accept_~ag_Y~0 Int) (ULTIMATE.start_ssl3_accept_~ag_X~0 Int)) (let ((.cse0 (+ (* 2 ULTIMATE.start_ssl3_accept_~ag_Y~0) (* 2 ULTIMATE.start_ssl3_accept_~ag_X~0)))) (and (<= .cse0 8496) (<= c_ULTIMATE.start_ssl3_accept_~s__state~0 .cse0)))) is different from true [2019-01-11 21:17:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1792 proven. 95 refuted. 0 times theorem prover too weak. 1173 trivial. 144 not checked. [2019-01-11 21:17:03,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:03,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-01-11 21:17:03,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 21:17:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 21:17:03,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2019-01-11 21:17:03,702 INFO L87 Difference]: Start difference. First operand 5864 states and 7707 transitions. Second operand 7 states. [2019-01-11 21:17:04,453 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 14 [2019-01-11 21:17:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:05,713 INFO L93 Difference]: Finished difference Result 13978 states and 18470 transitions. [2019-01-11 21:17:05,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 21:17:05,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 512 [2019-01-11 21:17:05,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:05,715 INFO L225 Difference]: With dead ends: 13978 [2019-01-11 21:17:05,715 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:17:05,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=40, Invalid=95, Unknown=1, NotChecked=20, Total=156 [2019-01-11 21:17:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:17:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:17:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:17:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:17:05,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 512 [2019-01-11 21:17:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:05,726 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:17:05,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 21:17:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:17:05,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:17:05,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:17:05,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,894 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 64 [2019-01-11 21:17:05,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:05,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,191 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 86 [2019-01-11 21:17:06,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,307 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-01-11 21:17:06,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,415 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2019-01-11 21:17:06,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:06,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,469 WARN L181 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 633 DAG size of output: 275 [2019-01-11 21:17:09,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,634 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2019-01-11 21:17:09,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:10,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,884 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 623 DAG size of output: 273 [2019-01-11 21:17:11,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:11,998 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 86 [2019-01-11 21:17:12,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,122 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 80 [2019-01-11 21:17:12,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,554 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-01-11 21:17:12,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:12,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:13,095 WARN L181 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-01-11 21:17:13,926 WARN L181 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2019-01-11 21:17:14,366 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 21 [2019-01-11 21:17:14,755 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 24 [2019-01-11 21:17:14,993 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 21 [2019-01-11 21:17:15,170 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 29 [2019-01-11 21:17:17,466 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 240 DAG size of output: 47 [2019-01-11 21:17:17,988 WARN L181 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 24 [2019-01-11 21:17:18,217 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 21 [2019-01-11 21:17:20,359 WARN L181 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 238 DAG size of output: 47 [2019-01-11 21:17:20,618 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-01-11 21:17:21,014 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 27 [2019-01-11 21:17:21,175 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2019-01-11 21:17:21,455 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 21 [2019-01-11 21:17:21,710 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 21 [2019-01-11 21:17:21,843 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 19 [2019-01-11 21:17:22,111 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 21 [2019-01-11 21:17:22,385 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 21 [2019-01-11 21:17:22,583 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 24 [2019-01-11 21:17:22,586 INFO L448 ceAbstractionStarter]: For program point L631(lines 631 635) no Hoare annotation was computed. [2019-01-11 21:17:22,586 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 593) no Hoare annotation was computed. [2019-01-11 21:17:22,586 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 604) no Hoare annotation was computed. [2019-01-11 21:17:22,587 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 615) no Hoare annotation was computed. [2019-01-11 21:17:22,587 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 626) no Hoare annotation was computed. [2019-01-11 21:17:22,587 INFO L444 ceAbstractionStarter]: At program point L203(lines 199 594) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1) (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1))) [2019-01-11 21:17:22,587 INFO L444 ceAbstractionStarter]: At program point L104(lines 103 626) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:17:22,587 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-01-11 21:17:22,587 INFO L448 ceAbstractionStarter]: For program point L469(lines 469 480) no Hoare annotation was computed. [2019-01-11 21:17:22,587 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 440) no Hoare annotation was computed. [2019-01-11 21:17:22,588 INFO L444 ceAbstractionStarter]: At program point L370(lines 353 388) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:22,590 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 243) no Hoare annotation was computed. [2019-01-11 21:17:22,590 INFO L448 ceAbstractionStarter]: For program point L205(lines 205 592) no Hoare annotation was computed. [2019-01-11 21:17:22,590 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 603) no Hoare annotation was computed. [2019-01-11 21:17:22,590 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 614) no Hoare annotation was computed. [2019-01-11 21:17:22,590 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 625) no Hoare annotation was computed. [2019-01-11 21:17:22,590 INFO L444 ceAbstractionStarter]: At program point L404(lines 395 426) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:22,591 INFO L444 ceAbstractionStarter]: At program point L206(lines 205 592) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:17:22,591 INFO L444 ceAbstractionStarter]: At program point L173(lines 169 604) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 .cse3))) [2019-01-11 21:17:22,591 INFO L444 ceAbstractionStarter]: At program point L140(lines 136 615) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse0 .cse1) (and .cse2 .cse0 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:17:22,591 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-01-11 21:17:22,591 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 376) no Hoare annotation was computed. [2019-01-11 21:17:22,591 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 412) no Hoare annotation was computed. [2019-01-11 21:17:22,591 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 602) no Hoare annotation was computed. [2019-01-11 21:17:22,591 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 613) no Hoare annotation was computed. [2019-01-11 21:17:22,591 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 624) no Hoare annotation was computed. [2019-01-11 21:17:22,591 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 582) no Hoare annotation was computed. [2019-01-11 21:17:22,592 INFO L448 ceAbstractionStarter]: For program point L572-1(lines 572 582) no Hoare annotation was computed. [2019-01-11 21:17:22,592 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 477) no Hoare annotation was computed. [2019-01-11 21:17:22,592 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2019-01-11 21:17:22,592 INFO L444 ceAbstractionStarter]: At program point L209(lines 208 591) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:17:22,592 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-01-11 21:17:22,592 INFO L448 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-01-11 21:17:22,592 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 669) no Hoare annotation was computed. [2019-01-11 21:17:22,592 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 511) no Hoare annotation was computed. [2019-01-11 21:17:22,592 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 317) no Hoare annotation was computed. [2019-01-11 21:17:22,592 INFO L451 ceAbstractionStarter]: At program point L673(lines 65 675) the Hoare annotation is: true [2019-01-11 21:17:22,593 INFO L448 ceAbstractionStarter]: For program point L640(lines 640 646) no Hoare annotation was computed. [2019-01-11 21:17:22,594 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 546) no Hoare annotation was computed. [2019-01-11 21:17:22,594 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 601) no Hoare annotation was computed. [2019-01-11 21:17:22,594 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 612) no Hoare annotation was computed. [2019-01-11 21:17:22,594 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 623) no Hoare annotation was computed. [2019-01-11 21:17:22,594 INFO L451 ceAbstractionStarter]: At program point L674(lines 8 676) the Hoare annotation is: true [2019-01-11 21:17:22,594 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2019-01-11 21:17:22,594 INFO L444 ceAbstractionStarter]: At program point L179(lines 175 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 .cse3))) [2019-01-11 21:17:22,594 INFO L444 ceAbstractionStarter]: At program point L146(lines 142 613) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:22,594 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-01-11 21:17:22,595 INFO L448 ceAbstractionStarter]: For program point L312-2(lines 210 588) no Hoare annotation was computed. [2019-01-11 21:17:22,595 INFO L444 ceAbstractionStarter]: At program point L213(lines 106 625) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:17:22,595 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 600) no Hoare annotation was computed. [2019-01-11 21:17:22,595 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 611) no Hoare annotation was computed. [2019-01-11 21:17:22,595 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 622) no Hoare annotation was computed. [2019-01-11 21:17:22,595 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-01-11 21:17:22,595 INFO L448 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-01-11 21:17:22,595 INFO L448 ceAbstractionStarter]: For program point L446-1(lines 446 458) no Hoare annotation was computed. [2019-01-11 21:17:22,595 INFO L444 ceAbstractionStarter]: At program point L414(lines 405 425) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:22,595 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 352) no Hoare annotation was computed. [2019-01-11 21:17:22,596 INFO L448 ceAbstractionStarter]: For program point L348-2(lines 210 588) no Hoare annotation was computed. [2019-01-11 21:17:22,596 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-01-11 21:17:22,596 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 65 675) no Hoare annotation was computed. [2019-01-11 21:17:22,596 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 599) no Hoare annotation was computed. [2019-01-11 21:17:22,596 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 610) no Hoare annotation was computed. [2019-01-11 21:17:22,596 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 621) no Hoare annotation was computed. [2019-01-11 21:17:22,596 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-01-11 21:17:22,596 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 454) no Hoare annotation was computed. [2019-01-11 21:17:22,596 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:17:22,596 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 222) no Hoare annotation was computed. [2019-01-11 21:17:22,596 INFO L444 ceAbstractionStarter]: At program point L185(lines 181 600) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3))) [2019-01-11 21:17:22,597 INFO L444 ceAbstractionStarter]: At program point L152(lines 148 611) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:22,604 INFO L448 ceAbstractionStarter]: For program point L218-2(lines 210 588) no Hoare annotation was computed. [2019-01-11 21:17:22,604 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 421) no Hoare annotation was computed. [2019-01-11 21:17:22,604 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 598) no Hoare annotation was computed. [2019-01-11 21:17:22,604 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 609) no Hoare annotation was computed. [2019-01-11 21:17:22,604 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 620) no Hoare annotation was computed. [2019-01-11 21:17:22,604 INFO L448 ceAbstractionStarter]: For program point L551(lines 551 555) no Hoare annotation was computed. [2019-01-11 21:17:22,604 INFO L448 ceAbstractionStarter]: For program point L485(lines 485 489) no Hoare annotation was computed. [2019-01-11 21:17:22,605 INFO L444 ceAbstractionStarter]: At program point L122(lines 118 621) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3) (and .cse4 .cse0 .cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4 .cse0 .cse1 .cse2 .cse3))) [2019-01-11 21:17:22,605 INFO L444 ceAbstractionStarter]: At program point L552(lines 65 675) the Hoare annotation is: false [2019-01-11 21:17:22,605 INFO L448 ceAbstractionStarter]: For program point L255(lines 255 269) no Hoare annotation was computed. [2019-01-11 21:17:22,605 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:17:22,605 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 261) no Hoare annotation was computed. [2019-01-11 21:17:22,605 INFO L448 ceAbstractionStarter]: For program point L190(lines 190 597) no Hoare annotation was computed. [2019-01-11 21:17:22,605 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 608) no Hoare annotation was computed. [2019-01-11 21:17:22,605 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 619) no Hoare annotation was computed. [2019-01-11 21:17:22,605 INFO L451 ceAbstractionStarter]: At program point L686(lines 677 688) the Hoare annotation is: true [2019-01-11 21:17:22,605 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 387) no Hoare annotation was computed. [2019-01-11 21:17:22,606 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-01-11 21:17:22,606 INFO L448 ceAbstractionStarter]: For program point L323-2(lines 323 327) no Hoare annotation was computed. [2019-01-11 21:17:22,606 INFO L444 ceAbstractionStarter]: At program point L191(lines 187 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4))) [2019-01-11 21:17:22,606 INFO L444 ceAbstractionStarter]: At program point L158(lines 154 609) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:22,606 INFO L444 ceAbstractionStarter]: At program point L125(lines 124 619) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8466 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3) (and .cse4 .cse0 .cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse1 .cse2 .cse3))) [2019-01-11 21:17:22,606 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 527) no Hoare annotation was computed. [2019-01-11 21:17:22,606 INFO L444 ceAbstractionStarter]: At program point L589(lines 100 657) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse7 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse6 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse5 .cse6 .cse1 .cse7) (and .cse6 .cse1 .cse7 .cse3) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (and .cse4 .cse3) (and .cse4 .cse5 .cse6))) [2019-01-11 21:17:22,607 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 560) no Hoare annotation was computed. [2019-01-11 21:17:22,609 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-01-11 21:17:22,609 INFO L448 ceAbstractionStarter]: For program point L292-2(lines 210 588) no Hoare annotation was computed. [2019-01-11 21:17:22,609 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 596) no Hoare annotation was computed. [2019-01-11 21:17:22,609 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 607) no Hoare annotation was computed. [2019-01-11 21:17:22,609 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 618) no Hoare annotation was computed. [2019-01-11 21:17:22,609 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:17:22,609 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 386) no Hoare annotation was computed. [2019-01-11 21:17:22,609 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 359 386) no Hoare annotation was computed. [2019-01-11 21:17:22,609 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 383) no Hoare annotation was computed. [2019-01-11 21:17:22,609 INFO L451 ceAbstractionStarter]: At program point L658(lines 99 659) the Hoare annotation is: true [2019-01-11 21:17:22,610 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 595) no Hoare annotation was computed. [2019-01-11 21:17:22,610 INFO L448 ceAbstractionStarter]: For program point L163(lines 163 606) no Hoare annotation was computed. [2019-01-11 21:17:22,610 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 617) no Hoare annotation was computed. [2019-01-11 21:17:22,610 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 426) no Hoare annotation was computed. [2019-01-11 21:17:22,610 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 247) no Hoare annotation was computed. [2019-01-11 21:17:22,610 INFO L444 ceAbstractionStarter]: At program point L197(lines 193 596) the Hoare annotation is: (let ((.cse0 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 .cse3 .cse1 .cse2) (and .cse0 .cse3 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2019-01-11 21:17:22,610 INFO L444 ceAbstractionStarter]: At program point L164(lines 160 607) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:22,610 INFO L448 ceAbstractionStarter]: For program point L230-2(lines 210 588) no Hoare annotation was computed. [2019-01-11 21:17:22,610 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 655) no Hoare annotation was computed. [2019-01-11 21:17:22,610 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-01-11 21:17:22,611 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 382) no Hoare annotation was computed. [2019-01-11 21:17:22,611 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 652) no Hoare annotation was computed. [2019-01-11 21:17:22,611 INFO L448 ceAbstractionStarter]: For program point L562(lines 562 566) no Hoare annotation was computed. [2019-01-11 21:17:22,611 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-01-11 21:17:22,611 INFO L448 ceAbstractionStarter]: For program point L496(lines 496 500) no Hoare annotation was computed. [2019-01-11 21:17:22,611 INFO L448 ceAbstractionStarter]: For program point L562-2(lines 562 566) no Hoare annotation was computed. [2019-01-11 21:17:22,613 INFO L448 ceAbstractionStarter]: For program point L529-2(lines 210 588) no Hoare annotation was computed. [2019-01-11 21:17:22,613 INFO L448 ceAbstractionStarter]: For program point L364(lines 364 368) no Hoare annotation was computed. [2019-01-11 21:17:22,613 INFO L448 ceAbstractionStarter]: For program point L364-2(lines 363 380) no Hoare annotation was computed. [2019-01-11 21:17:22,613 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 237) no Hoare annotation was computed. [2019-01-11 21:17:22,613 INFO L448 ceAbstractionStarter]: For program point L199(lines 199 594) no Hoare annotation was computed. [2019-01-11 21:17:22,613 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 605) no Hoare annotation was computed. [2019-01-11 21:17:22,613 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 616) no Hoare annotation was computed. [2019-01-11 21:17:22,613 INFO L444 ceAbstractionStarter]: At program point L100-2(lines 100 657) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse0 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse7 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse6 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse5 .cse6 .cse1 .cse7) (and .cse6 .cse1 .cse7 .cse3) (and .cse4 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (and .cse4 .cse3) (and .cse4 .cse5 .cse6))) [2019-01-11 21:17:22,614 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 666) no Hoare annotation was computed. [2019-01-11 21:17:22,614 INFO L448 ceAbstractionStarter]: For program point L629(lines 629 638) no Hoare annotation was computed. [2019-01-11 21:17:22,614 INFO L448 ceAbstractionStarter]: For program point L662-2(lines 662 666) no Hoare annotation was computed. [2019-01-11 21:17:22,614 INFO L448 ceAbstractionStarter]: For program point L629-2(lines 628 650) no Hoare annotation was computed. [2019-01-11 21:17:22,614 INFO L448 ceAbstractionStarter]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-01-11 21:17:22,614 INFO L448 ceAbstractionStarter]: For program point L332-1(lines 332 341) no Hoare annotation was computed. [2019-01-11 21:17:22,614 INFO L444 ceAbstractionStarter]: At program point L167(lines 166 605) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse1 .cse2) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse3 .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2019-01-11 21:17:22,614 INFO L444 ceAbstractionStarter]: At program point L134(lines 127 618) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (and .cse0 .cse1 .cse2) .cse3))) [2019-01-11 21:17:22,614 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-01-11 21:17:22,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:17:22 BoogieIcfgContainer [2019-01-11 21:17:22,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:17:22,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:17:22,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:17:22,658 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:17:22,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:16:41" (3/4) ... [2019-01-11 21:17:22,664 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:17:22,684 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:17:22,685 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:17:22,824 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:17:22,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:17:22,826 INFO L168 Benchmark]: Toolchain (without parser) took 43471.85 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 951.4 MB in the beginning and 1.8 GB in the end (delta: -887.2 MB). Peak memory consumption was 267.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:22,827 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:17:22,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.76 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-11 21:17:22,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 158.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:22,828 INFO L168 Benchmark]: Boogie Preprocessor took 61.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:17:22,829 INFO L168 Benchmark]: RCFGBuilder took 1474.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:22,829 INFO L168 Benchmark]: TraceAbstraction took 41028.94 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -782.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-11 21:17:22,829 INFO L168 Benchmark]: Witness Printer took 167.64 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 276.3 kB). Peak memory consumption was 276.3 kB. Max. memory is 11.5 GB. [2019-01-11 21:17:22,834 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.20 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 574.76 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 158.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1474.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41028.94 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -782.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 167.64 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 276.3 kB). Peak memory consumption was 276.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 669]: 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: 118]: Loop Invariant Derived loop invariant: (((((8466 <= s__state && !(8497 == s__state)) && !(8496 == s__state)) && blastFlag <= 1) && s__state <= 8576) || ((((((blastFlag <= 2 && 8466 <= s__state) && !(8497 == s__state)) && !(8673 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(s__hit == 0))) || (((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && 8466 <= s__state) && !(8497 == s__state)) && !(8496 == s__state)) && s__state <= 8576) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((!(8673 == s__state) && blastFlag <= 1) && 8656 <= s__state) && !(8672 == s__state)) || ((((s__s3__tmp__next_state___0 <= 8576 && !(8673 == s__state)) && blastFlag <= 3) && 8656 <= s__state) && !(8672 == s__state))) || ((((!(8673 == s__state) && blastFlag <= 3) && 8656 <= s__state) && !(8672 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 8512 <= s__state) && !(8673 == s__state)) && !(8672 == s__state)) && !(s__hit == 0)) || ((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(8673 == s__state)) && 8576 <= s__state) && !(8672 == s__state)) && !(s__hit == 0)) || (((!(8673 == s__state) && 8576 <= s__state) && blastFlag <= 1) && !(8672 == s__state))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(8673 == s__state)) && 8576 <= s__state) && !(8672 == s__state)) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 8512 <= s__state) && !(8673 == s__state)) && !(8672 == s__state)) && !(s__hit == 0)) || ((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && !(8673 == s__state)) && !(8672 == s__state)) && 8640 <= s__state) && !(s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(8673 == s__state)) && !(8672 == s__state)) && 8640 <= s__state)) || (((!(8673 == s__state) && blastFlag <= 1) && !(8672 == s__state)) && 8640 <= s__state)) || (((((8640 <= s__s3__tmp__next_state___0 && !(8673 == s__state)) && blastFlag <= 3) && !(8672 == s__state)) && 8640 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((8466 <= s__state && blastFlag <= 1) && s__state <= 8576) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && 8466 <= s__state) && s__state <= 8576)) || ((((blastFlag <= 2 && 8466 <= s__state) && !(8673 == s__state)) && !(8672 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((((((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(s__hit == 0)) || blastFlag <= 1) || (blastFlag <= 2 && s__state == 8560)) || (blastFlag <= 2 && s__state == 8544)) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && 0 == s__hit)) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(s__hit == 0))) || (blastFlag <= 2 && s__state == 8512)) || (((s__s3__tmp__next_state___0 <= 8576 && !(8673 == s__state)) && blastFlag <= 3) && 8656 <= s__state)) || (((!(8673 == s__state) && blastFlag <= 3) && 8656 <= s__state) && !(s__hit == 0))) || (blastFlag <= 2 && s__state == 8528)) || (blastFlag <= 2 && !(s__hit == 0))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(8673 == s__state)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(8673 == s__state)) && 8576 <= s__state) && !(8672 == s__state)) && !(s__hit == 0)) || (((!(8673 == s__state) && 8576 <= s__state) && blastFlag <= 1) && !(8672 == s__state))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(8673 == s__state)) && 8576 <= s__state) && !(8672 == s__state)) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 8512 <= s__state) && !(8673 == s__state)) && !(8672 == s__state)) && !(s__hit == 0)) || ((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) - InvariantResult [Line: 677]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((((((((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(s__hit == 0)) || blastFlag <= 1) || (blastFlag <= 2 && s__state == 8560)) || (blastFlag <= 2 && s__state == 8544)) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && 0 == s__hit)) || (((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && 8640 <= s__state) && !(s__hit == 0))) || (blastFlag <= 2 && s__state == 8512)) || (((s__s3__tmp__next_state___0 <= 8576 && !(8673 == s__state)) && blastFlag <= 3) && 8656 <= s__state)) || (((!(8673 == s__state) && blastFlag <= 3) && 8656 <= s__state) && !(s__hit == 0))) || (blastFlag <= 2 && s__state == 8528)) || (blastFlag <= 2 && !(s__hit == 0))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(8673 == s__state)) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && !(8497 == s__state)) && !(8673 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(s__hit == 0)) || (((!(8497 == s__state) && !(8496 == s__state)) && blastFlag <= 1) && s__state <= 8576)) || ((s__s3__tmp__next_state___0 <= 8576 && (blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && s__state <= 8576) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && !(s__hit == 0)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || (s__state <= 8448 && blastFlag <= 1)) || ((blastFlag <= 2 && s__state <= 8448) && !(s__hit == 0))) || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448) && 0 == s__hit) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((8466 <= s__state && !(8497 == s__state)) && !(8496 == s__state)) && blastFlag <= 1) && s__state <= 8576) || ((((((blastFlag <= 2 && 8466 <= s__state) && !(8497 == s__state)) && !(8673 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(s__hit == 0))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8466 <= s__state) && !(8497 == s__state)) && !(8496 == s__state)) && s__state <= 8576) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 8512 <= s__state) && !(8673 == s__state)) && !(8672 == s__state)) && !(s__hit == 0)) || ((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 8512 <= s__state) && !(8673 == s__state)) && !(8672 == s__state)) && !(s__hit == 0)) || ((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && 8656 <= s__state) || ((blastFlag <= 3 && 8656 <= s__state) && !(s__hit == 0))) || (blastFlag <= 1 && 8656 <= s__state) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 8512 <= s__state) && !(8673 == s__state)) && !(8672 == s__state)) && !(s__hit == 0)) || ((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 8512 <= s__state) && !(8673 == s__state)) && !(8672 == s__state)) && !(s__hit == 0)) || ((blastFlag <= 2 && 8512 <= s__state) && s__state <= 8576) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && !(8673 == s__state)) && 8576 <= s__state) && !(8672 == s__state)) || ((((blastFlag <= 2 && !(8673 == s__state)) && 8576 <= s__state) && !(8672 == s__state)) && !(s__hit == 0))) || (((!(8673 == s__state) && 8576 <= s__state) && blastFlag <= 1) && !(8672 == s__state)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. SAFE Result, 40.9s OverallTime, 21 OverallIterations, 19 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 16.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 4627 SDtfs, 2772 SDslu, 3774 SDs, 0 SdLazy, 3773 SolverSat, 582 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1496 GetRequests, 1450 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11761occurred in iteration=16, 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: 2.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 7188 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 1134 NumberOfFragments, 1082 HoareAnnotationTreeSize, 29 FomulaSimplifications, 165673 FormulaSimplificationTreeSizeReduction, 6.9s HoareSimplificationTime, 29 FomulaSimplificationsInter, 34240 FormulaSimplificationTreeSizeReductionInter, 9.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 5814 NumberOfCodeBlocks, 5814 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 5789 ConstructedInterpolants, 35 QuantifiedInterpolants, 3537802 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2301 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 25 InterpolantComputations, 20 PerfectInterpolantSequences, 19692/20015 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...