./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/s3_srvr_2_alt_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_alt_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 a2f01af3546ca3525e0ee0472f0f0b216e6d4f7c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:24,715 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:16:24,717 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:16:24,728 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:16:24,728 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:16:24,729 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:16:24,731 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:16:24,733 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:16:24,735 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:16:24,736 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:16:24,737 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:16:24,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:16:24,740 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:16:24,742 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:16:24,748 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:16:24,751 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:16:24,751 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:16:24,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:16:24,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:16:24,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:16:24,762 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:16:24,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:16:24,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:16:24,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:16:24,772 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:16:24,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:16:24,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:16:24,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:16:24,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:16:24,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:16:24,778 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:16:24,781 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:16:24,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:16:24,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:16:24,783 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:16:24,783 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:16:24,783 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:24,804 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:16:24,805 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:16:24,806 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:16:24,806 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:16:24,806 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:16:24,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:16:24,807 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:16:24,807 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:16:24,807 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:16:24,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:16:24,808 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:16:24,808 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:16:24,808 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:16:24,808 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:16:24,808 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:16:24,808 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:16:24,808 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:16:24,810 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:16:24,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:16:24,810 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:16:24,811 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:16:24,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:16:24,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:16:24,812 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:16:24,812 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:16:24,813 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:16:24,813 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:16:24,813 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:16:24,813 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 -> a2f01af3546ca3525e0ee0472f0f0b216e6d4f7c [2019-01-11 21:16:24,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:16:24,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:16:24,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:16:24,884 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:16:24,884 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:16:24,885 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_srvr_2_alt_true-unreach-call_true-no-overflow_false-termination.BV.c.cil.c [2019-01-11 21:16:24,944 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1410f5bb2/e1d22882d696447d9419638cdc1ba811/FLAG2f9a1f4ef [2019-01-11 21:16:25,367 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:16:25,368 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_srvr_2_alt_true-unreach-call_true-no-overflow_false-termination.BV.c.cil.c [2019-01-11 21:16:25,386 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1410f5bb2/e1d22882d696447d9419638cdc1ba811/FLAG2f9a1f4ef [2019-01-11 21:16:25,719 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1410f5bb2/e1d22882d696447d9419638cdc1ba811 [2019-01-11 21:16:25,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:16:25,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:16:25,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:16:25,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:16:25,730 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:16:25,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:16:25" (1/1) ... [2019-01-11 21:16:25,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23790601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:25, skipping insertion in model container [2019-01-11 21:16:25,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:16:25" (1/1) ... [2019-01-11 21:16:25,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:16:25,800 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:16:26,083 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:16:26,088 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:16:26,156 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:16:26,172 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:16:26,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:26 WrapperNode [2019-01-11 21:16:26,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:16:26,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:16:26,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:16:26,173 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:16:26,179 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:26" (1/1) ... [2019-01-11 21:16:26,188 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:26" (1/1) ... [2019-01-11 21:16:26,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:16:26,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:16:26,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:16:26,298 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:16:26,308 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:26" (1/1) ... [2019-01-11 21:16:26,308 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:26" (1/1) ... [2019-01-11 21:16:26,311 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:26" (1/1) ... [2019-01-11 21:16:26,312 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:26" (1/1) ... [2019-01-11 21:16:26,319 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:26" (1/1) ... [2019-01-11 21:16:26,327 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:26" (1/1) ... [2019-01-11 21:16:26,330 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:26" (1/1) ... [2019-01-11 21:16:26,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:16:26,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:16:26,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:16:26,335 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:16:26,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:26" (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:26,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:16:26,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:16:26,544 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:16:27,521 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:16:27,521 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:16:27,523 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:16:27,523 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:16:27,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:16:27 BoogieIcfgContainer [2019-01-11 21:16:27,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:16:27,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:16:27,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:16:27,529 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:16:27,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:16:25" (1/3) ... [2019-01-11 21:16:27,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35deb6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:16:27, skipping insertion in model container [2019-01-11 21:16:27,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:26" (2/3) ... [2019-01-11 21:16:27,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35deb6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:16:27, skipping insertion in model container [2019-01-11 21:16:27,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:16:27" (3/3) ... [2019-01-11 21:16:27,532 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2_alt_true-unreach-call_true-no-overflow_false-termination.BV.c.cil.c [2019-01-11 21:16:27,542 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:16:27,550 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:16:27,567 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:16:27,597 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:16:27,598 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:16:27,598 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:16:27,598 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:16:27,599 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:16:27,599 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:16:27,599 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:16:27,599 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:16:27,599 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:16:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-01-11 21:16:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 21:16:27,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:27,630 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:27,632 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:27,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:27,638 INFO L82 PathProgramCache]: Analyzing trace with hash -91609757, now seen corresponding path program 1 times [2019-01-11 21:16:27,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:27,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:27,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:27,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:27,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:27,897 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:27,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:27,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:27,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:27,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:27,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:27,921 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-01-11 21:16:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:28,633 INFO L93 Difference]: Finished difference Result 316 states and 546 transitions. [2019-01-11 21:16:28,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:28,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-11 21:16:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:28,649 INFO L225 Difference]: With dead ends: 316 [2019-01-11 21:16:28,649 INFO L226 Difference]: Without dead ends: 160 [2019-01-11 21:16:28,653 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:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-11 21:16:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2019-01-11 21:16:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-11 21:16:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 247 transitions. [2019-01-11 21:16:28,700 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 247 transitions. Word has length 43 [2019-01-11 21:16:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:28,700 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 247 transitions. [2019-01-11 21:16:28,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 247 transitions. [2019-01-11 21:16:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 21:16:28,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:28,703 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:28,703 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:28,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1448029290, now seen corresponding path program 1 times [2019-01-11 21:16:28,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:28,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:28,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:28,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:28,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:28,811 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:28,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:28,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:28,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:28,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:28,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:28,815 INFO L87 Difference]: Start difference. First operand 155 states and 247 transitions. Second operand 3 states. [2019-01-11 21:16:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:29,231 INFO L93 Difference]: Finished difference Result 351 states and 564 transitions. [2019-01-11 21:16:29,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:29,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-11 21:16:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:29,238 INFO L225 Difference]: With dead ends: 351 [2019-01-11 21:16:29,238 INFO L226 Difference]: Without dead ends: 201 [2019-01-11 21:16:29,239 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:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-11 21:16:29,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2019-01-11 21:16:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-11 21:16:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 319 transitions. [2019-01-11 21:16:29,259 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 319 transitions. Word has length 44 [2019-01-11 21:16:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:29,260 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 319 transitions. [2019-01-11 21:16:29,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 319 transitions. [2019-01-11 21:16:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-11 21:16:29,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:29,266 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:29,267 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:29,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:29,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2008911458, now seen corresponding path program 1 times [2019-01-11 21:16:29,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:29,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:29,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:29,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:29,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:29,364 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:29,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:29,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:29,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:29,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:29,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:29,367 INFO L87 Difference]: Start difference. First operand 196 states and 319 transitions. Second operand 3 states. [2019-01-11 21:16:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:29,485 INFO L93 Difference]: Finished difference Result 572 states and 934 transitions. [2019-01-11 21:16:29,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:29,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-01-11 21:16:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:29,492 INFO L225 Difference]: With dead ends: 572 [2019-01-11 21:16:29,492 INFO L226 Difference]: Without dead ends: 383 [2019-01-11 21:16:29,494 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:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-01-11 21:16:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2019-01-11 21:16:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-01-11 21:16:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 623 transitions. [2019-01-11 21:16:29,533 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 623 transitions. Word has length 59 [2019-01-11 21:16:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:29,534 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 623 transitions. [2019-01-11 21:16:29,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 623 transitions. [2019-01-11 21:16:29,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 21:16:29,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:29,539 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:29,539 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:29,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:29,540 INFO L82 PathProgramCache]: Analyzing trace with hash 44999767, now seen corresponding path program 1 times [2019-01-11 21:16:29,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:29,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:29,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:29,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:29,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:29,649 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:29,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:29,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:29,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:29,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:29,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:29,651 INFO L87 Difference]: Start difference. First operand 383 states and 623 transitions. Second operand 3 states. [2019-01-11 21:16:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:29,942 INFO L93 Difference]: Finished difference Result 811 states and 1316 transitions. [2019-01-11 21:16:29,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:29,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-01-11 21:16:29,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:29,948 INFO L225 Difference]: With dead ends: 811 [2019-01-11 21:16:29,948 INFO L226 Difference]: Without dead ends: 435 [2019-01-11 21:16:29,949 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:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-11 21:16:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2019-01-11 21:16:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-01-11 21:16:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 685 transitions. [2019-01-11 21:16:29,970 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 685 transitions. Word has length 80 [2019-01-11 21:16:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:29,970 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 685 transitions. [2019-01-11 21:16:29,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 685 transitions. [2019-01-11 21:16:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-11 21:16:29,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:29,975 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:29,975 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:29,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:29,976 INFO L82 PathProgramCache]: Analyzing trace with hash 586802411, now seen corresponding path program 1 times [2019-01-11 21:16:29,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:29,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:29,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:29,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:29,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:30,104 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:30,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:30,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:30,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:30,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:30,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:30,108 INFO L87 Difference]: Start difference. First operand 425 states and 685 transitions. Second operand 3 states. [2019-01-11 21:16:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:30,762 INFO L93 Difference]: Finished difference Result 853 states and 1374 transitions. [2019-01-11 21:16:30,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:30,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-01-11 21:16:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:30,768 INFO L225 Difference]: With dead ends: 853 [2019-01-11 21:16:30,769 INFO L226 Difference]: Without dead ends: 435 [2019-01-11 21:16:30,769 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:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-11 21:16:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2019-01-11 21:16:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-01-11 21:16:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 681 transitions. [2019-01-11 21:16:30,787 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 681 transitions. Word has length 81 [2019-01-11 21:16:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:30,787 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 681 transitions. [2019-01-11 21:16:30,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 681 transitions. [2019-01-11 21:16:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 21:16:30,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:30,790 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:30,791 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:30,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:30,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1514553016, now seen corresponding path program 1 times [2019-01-11 21:16:30,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:30,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:30,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:30,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:30,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:30,882 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:30,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:30,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:30,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:30,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:30,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:30,884 INFO L87 Difference]: Start difference. First operand 425 states and 681 transitions. Second operand 3 states. [2019-01-11 21:16:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:31,667 INFO L93 Difference]: Finished difference Result 971 states and 1575 transitions. [2019-01-11 21:16:31,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:31,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-11 21:16:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:31,673 INFO L225 Difference]: With dead ends: 971 [2019-01-11 21:16:31,673 INFO L226 Difference]: Without dead ends: 553 [2019-01-11 21:16:31,674 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:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-01-11 21:16:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 543. [2019-01-11 21:16:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-01-11 21:16:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 797 transitions. [2019-01-11 21:16:31,693 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 797 transitions. Word has length 96 [2019-01-11 21:16:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:31,694 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 797 transitions. [2019-01-11 21:16:31,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 797 transitions. [2019-01-11 21:16:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 21:16:31,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:31,725 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:31,727 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:31,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1948282102, now seen corresponding path program 1 times [2019-01-11 21:16:31,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:31,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:31,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:31,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:31,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:31,833 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:31,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:31,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:31,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:31,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:31,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:31,834 INFO L87 Difference]: Start difference. First operand 543 states and 797 transitions. Second operand 3 states. [2019-01-11 21:16:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:32,423 INFO L93 Difference]: Finished difference Result 1167 states and 1733 transitions. [2019-01-11 21:16:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:32,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-11 21:16:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:32,435 INFO L225 Difference]: With dead ends: 1167 [2019-01-11 21:16:32,436 INFO L226 Difference]: Without dead ends: 631 [2019-01-11 21:16:32,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-01-11 21:16:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 605. [2019-01-11 21:16:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-01-11 21:16:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 885 transitions. [2019-01-11 21:16:32,455 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 885 transitions. Word has length 96 [2019-01-11 21:16:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:32,457 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 885 transitions. [2019-01-11 21:16:32,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 885 transitions. [2019-01-11 21:16:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-11 21:16:32,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:32,461 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:32,461 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:32,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:32,462 INFO L82 PathProgramCache]: Analyzing trace with hash 564782516, now seen corresponding path program 1 times [2019-01-11 21:16:32,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:32,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:32,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:32,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:32,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:32,574 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:32,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:32,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:32,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:32,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:32,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:32,575 INFO L87 Difference]: Start difference. First operand 605 states and 885 transitions. Second operand 3 states. [2019-01-11 21:16:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:32,841 INFO L93 Difference]: Finished difference Result 905 states and 1324 transitions. [2019-01-11 21:16:32,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:32,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-01-11 21:16:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:32,848 INFO L225 Difference]: With dead ends: 905 [2019-01-11 21:16:32,848 INFO L226 Difference]: Without dead ends: 903 [2019-01-11 21:16:32,848 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:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-01-11 21:16:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2019-01-11 21:16:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-01-11 21:16:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1322 transitions. [2019-01-11 21:16:32,874 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1322 transitions. Word has length 120 [2019-01-11 21:16:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:32,874 INFO L480 AbstractCegarLoop]: Abstraction has 903 states and 1322 transitions. [2019-01-11 21:16:32,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1322 transitions. [2019-01-11 21:16:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-11 21:16:32,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:32,879 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:32,879 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:32,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:32,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1174075643, now seen corresponding path program 1 times [2019-01-11 21:16:32,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:32,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:32,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:32,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:32,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:32,973 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:32,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:32,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:32,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:32,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:32,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:32,975 INFO L87 Difference]: Start difference. First operand 903 states and 1322 transitions. Second operand 3 states. [2019-01-11 21:16:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:33,205 INFO L93 Difference]: Finished difference Result 1877 states and 2732 transitions. [2019-01-11 21:16:33,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:33,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-01-11 21:16:33,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:33,211 INFO L225 Difference]: With dead ends: 1877 [2019-01-11 21:16:33,211 INFO L226 Difference]: Without dead ends: 981 [2019-01-11 21:16:33,212 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:33,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-01-11 21:16:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 972. [2019-01-11 21:16:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-01-11 21:16:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1406 transitions. [2019-01-11 21:16:33,236 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1406 transitions. Word has length 184 [2019-01-11 21:16:33,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:33,237 INFO L480 AbstractCegarLoop]: Abstraction has 972 states and 1406 transitions. [2019-01-11 21:16:33,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1406 transitions. [2019-01-11 21:16:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-11 21:16:33,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:33,241 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:33,241 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:33,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:33,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1179429289, now seen corresponding path program 1 times [2019-01-11 21:16:33,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:33,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:33,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:33,342 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:33,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:33,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:33,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:33,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:33,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:33,343 INFO L87 Difference]: Start difference. First operand 972 states and 1406 transitions. Second operand 3 states. [2019-01-11 21:16:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:33,671 INFO L93 Difference]: Finished difference Result 2048 states and 2960 transitions. [2019-01-11 21:16:33,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:33,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-01-11 21:16:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:33,681 INFO L225 Difference]: With dead ends: 2048 [2019-01-11 21:16:33,681 INFO L226 Difference]: Without dead ends: 1083 [2019-01-11 21:16:33,683 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:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-01-11 21:16:33,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1047. [2019-01-11 21:16:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-01-11 21:16:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1496 transitions. [2019-01-11 21:16:33,711 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1496 transitions. Word has length 204 [2019-01-11 21:16:33,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:33,712 INFO L480 AbstractCegarLoop]: Abstraction has 1047 states and 1496 transitions. [2019-01-11 21:16:33,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1496 transitions. [2019-01-11 21:16:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-11 21:16:33,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:33,718 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:33,718 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1179962115, now seen corresponding path program 1 times [2019-01-11 21:16:33,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:33,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:33,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:33,857 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:33,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:33,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:33,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:33,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:33,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:33,859 INFO L87 Difference]: Start difference. First operand 1047 states and 1496 transitions. Second operand 3 states. [2019-01-11 21:16:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:33,977 INFO L93 Difference]: Finished difference Result 3109 states and 4430 transitions. [2019-01-11 21:16:33,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:33,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-01-11 21:16:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:33,989 INFO L225 Difference]: With dead ends: 3109 [2019-01-11 21:16:33,990 INFO L226 Difference]: Without dead ends: 2069 [2019-01-11 21:16:33,993 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:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-01-11 21:16:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1050. [2019-01-11 21:16:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-01-11 21:16:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1499 transitions. [2019-01-11 21:16:34,041 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1499 transitions. Word has length 230 [2019-01-11 21:16:34,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:34,041 INFO L480 AbstractCegarLoop]: Abstraction has 1050 states and 1499 transitions. [2019-01-11 21:16:34,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1499 transitions. [2019-01-11 21:16:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-11 21:16:34,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:34,047 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:34,048 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash -150020643, now seen corresponding path program 1 times [2019-01-11 21:16:34,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:34,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:34,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:34,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:34,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:34,246 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:34,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:34,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:34,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:34,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:34,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:34,247 INFO L87 Difference]: Start difference. First operand 1050 states and 1499 transitions. Second operand 3 states. [2019-01-11 21:16:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:35,026 INFO L93 Difference]: Finished difference Result 2195 states and 3134 transitions. [2019-01-11 21:16:35,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:35,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-01-11 21:16:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:35,033 INFO L225 Difference]: With dead ends: 2195 [2019-01-11 21:16:35,033 INFO L226 Difference]: Without dead ends: 1152 [2019-01-11 21:16:35,035 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:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-01-11 21:16:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1131. [2019-01-11 21:16:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2019-01-11 21:16:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1595 transitions. [2019-01-11 21:16:35,067 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1595 transitions. Word has length 230 [2019-01-11 21:16:35,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:35,068 INFO L480 AbstractCegarLoop]: Abstraction has 1131 states and 1595 transitions. [2019-01-11 21:16:35,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1595 transitions. [2019-01-11 21:16:35,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-11 21:16:35,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:35,073 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:35,073 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:35,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:35,074 INFO L82 PathProgramCache]: Analyzing trace with hash -336843366, now seen corresponding path program 1 times [2019-01-11 21:16:35,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:35,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:35,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:35,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:35,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:35,245 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:35,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:35,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:35,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:35,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:35,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:35,249 INFO L87 Difference]: Start difference. First operand 1131 states and 1595 transitions. Second operand 3 states. [2019-01-11 21:16:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:35,427 INFO L93 Difference]: Finished difference Result 3373 states and 4754 transitions. [2019-01-11 21:16:35,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:35,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-01-11 21:16:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:35,443 INFO L225 Difference]: With dead ends: 3373 [2019-01-11 21:16:35,444 INFO L226 Difference]: Without dead ends: 2249 [2019-01-11 21:16:35,447 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:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-01-11 21:16:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2247. [2019-01-11 21:16:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2247 states. [2019-01-11 21:16:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3163 transitions. [2019-01-11 21:16:35,552 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3163 transitions. Word has length 231 [2019-01-11 21:16:35,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:35,552 INFO L480 AbstractCegarLoop]: Abstraction has 2247 states and 3163 transitions. [2019-01-11 21:16:35,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3163 transitions. [2019-01-11 21:16:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-01-11 21:16:35,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:35,565 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:35,565 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:35,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:35,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1934345498, now seen corresponding path program 1 times [2019-01-11 21:16:35,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:35,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:35,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:35,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:35,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:35,717 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:35,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:35,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:35,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:35,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:35,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:35,720 INFO L87 Difference]: Start difference. First operand 2247 states and 3163 transitions. Second operand 3 states. [2019-01-11 21:16:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:37,014 INFO L93 Difference]: Finished difference Result 4733 states and 6735 transitions. [2019-01-11 21:16:37,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:37,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-01-11 21:16:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:37,027 INFO L225 Difference]: With dead ends: 4733 [2019-01-11 21:16:37,027 INFO L226 Difference]: Without dead ends: 2433 [2019-01-11 21:16:37,031 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:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2019-01-11 21:16:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2433. [2019-01-11 21:16:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2019-01-11 21:16:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3379 transitions. [2019-01-11 21:16:37,103 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3379 transitions. Word has length 232 [2019-01-11 21:16:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:37,103 INFO L480 AbstractCegarLoop]: Abstraction has 2433 states and 3379 transitions. [2019-01-11 21:16:37,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3379 transitions. [2019-01-11 21:16:37,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-11 21:16:37,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:37,111 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:37,111 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:37,113 INFO L82 PathProgramCache]: Analyzing trace with hash -462203708, now seen corresponding path program 1 times [2019-01-11 21:16:37,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:37,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:37,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:37,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:37,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:37,315 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:37,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:16:37,316 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:37,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:37,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:37,673 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:37,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:16:37,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:16:37,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:16:37,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:16:37,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:16:37,718 INFO L87 Difference]: Start difference. First operand 2433 states and 3379 transitions. Second operand 5 states. [2019-01-11 21:16:39,393 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-11 21:16:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:41,290 INFO L93 Difference]: Finished difference Result 9605 states and 13449 transitions. [2019-01-11 21:16:41,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:16:41,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-01-11 21:16:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:41,321 INFO L225 Difference]: With dead ends: 9605 [2019-01-11 21:16:41,321 INFO L226 Difference]: Without dead ends: 7179 [2019-01-11 21:16:41,327 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:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2019-01-11 21:16:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6121. [2019-01-11 21:16:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6121 states. [2019-01-11 21:16:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 8436 transitions. [2019-01-11 21:16:41,558 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 8436 transitions. Word has length 244 [2019-01-11 21:16:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:41,558 INFO L480 AbstractCegarLoop]: Abstraction has 6121 states and 8436 transitions. [2019-01-11 21:16:41,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:16:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 8436 transitions. [2019-01-11 21:16:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-11 21:16:41,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:41,573 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:41,573 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:41,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash 752836901, now seen corresponding path program 1 times [2019-01-11 21:16:41,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:41,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:41,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:41,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:41,736 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:41,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:41,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:41,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:41,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:41,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:41,741 INFO L87 Difference]: Start difference. First operand 6121 states and 8436 transitions. Second operand 3 states. [2019-01-11 21:16:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:42,100 INFO L93 Difference]: Finished difference Result 17917 states and 24774 transitions. [2019-01-11 21:16:42,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:42,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-01-11 21:16:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:42,166 INFO L225 Difference]: With dead ends: 17917 [2019-01-11 21:16:42,166 INFO L226 Difference]: Without dead ends: 11803 [2019-01-11 21:16:42,179 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:42,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11803 states. [2019-01-11 21:16:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11803 to 11761. [2019-01-11 21:16:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11761 states. [2019-01-11 21:16:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11761 states to 11761 states and 16256 transitions. [2019-01-11 21:16:42,682 INFO L78 Accepts]: Start accepts. Automaton has 11761 states and 16256 transitions. Word has length 252 [2019-01-11 21:16:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:42,683 INFO L480 AbstractCegarLoop]: Abstraction has 11761 states and 16256 transitions. [2019-01-11 21:16:42,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 11761 states and 16256 transitions. [2019-01-11 21:16:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-01-11 21:16:42,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:42,706 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:42,706 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:42,706 INFO L82 PathProgramCache]: Analyzing trace with hash 134593790, now seen corresponding path program 1 times [2019-01-11 21:16:42,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:42,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:42,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:42,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:42,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:42,939 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:42,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:16:42,940 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:42,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:43,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:43,151 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:43,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:16:43,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:16:43,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:16:43,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:16:43,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:16:43,170 INFO L87 Difference]: Start difference. First operand 11761 states and 16256 transitions. Second operand 5 states. [2019-01-11 21:16:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:43,899 INFO L93 Difference]: Finished difference Result 26031 states and 35776 transitions. [2019-01-11 21:16:43,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:16:43,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 298 [2019-01-11 21:16:43,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:43,921 INFO L225 Difference]: With dead ends: 26031 [2019-01-11 21:16:43,922 INFO L226 Difference]: Without dead ends: 10083 [2019-01-11 21:16:43,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 21:16:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10083 states. [2019-01-11 21:16:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10083 to 8984. [2019-01-11 21:16:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8984 states. [2019-01-11 21:16:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8984 states to 8984 states and 12019 transitions. [2019-01-11 21:16:44,304 INFO L78 Accepts]: Start accepts. Automaton has 8984 states and 12019 transitions. Word has length 298 [2019-01-11 21:16:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:44,304 INFO L480 AbstractCegarLoop]: Abstraction has 8984 states and 12019 transitions. [2019-01-11 21:16:44,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:16:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 8984 states and 12019 transitions. [2019-01-11 21:16:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-11 21:16:44,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:44,324 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:44,324 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:44,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:44,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1551518133, now seen corresponding path program 1 times [2019-01-11 21:16:44,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:44,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:44,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:44,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:44,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:44,458 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:44,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:44,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:44,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:44,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:44,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:44,461 INFO L87 Difference]: Start difference. First operand 8984 states and 12019 transitions. Second operand 3 states. [2019-01-11 21:16:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:44,765 INFO L93 Difference]: Finished difference Result 18177 states and 24396 transitions. [2019-01-11 21:16:44,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:44,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-01-11 21:16:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:44,782 INFO L225 Difference]: With dead ends: 18177 [2019-01-11 21:16:44,782 INFO L226 Difference]: Without dead ends: 9224 [2019-01-11 21:16:44,794 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:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9224 states. [2019-01-11 21:16:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9224 to 7756. [2019-01-11 21:16:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7756 states. [2019-01-11 21:16:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7756 states to 7756 states and 10407 transitions. [2019-01-11 21:16:45,009 INFO L78 Accepts]: Start accepts. Automaton has 7756 states and 10407 transitions. Word has length 321 [2019-01-11 21:16:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:45,010 INFO L480 AbstractCegarLoop]: Abstraction has 7756 states and 10407 transitions. [2019-01-11 21:16:45,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 7756 states and 10407 transitions. [2019-01-11 21:16:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-01-11 21:16:45,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:45,025 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:45,026 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:45,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:45,026 INFO L82 PathProgramCache]: Analyzing trace with hash -16053374, now seen corresponding path program 1 times [2019-01-11 21:16:45,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:45,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:45,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:45,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:45,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:45,238 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:45,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:16:45,239 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:45,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:45,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:45,558 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:45,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 21:16:45,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-11 21:16:45,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:16:45,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:16:45,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:16:45,577 INFO L87 Difference]: Start difference. First operand 7756 states and 10407 transitions. Second operand 5 states. [2019-01-11 21:16:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:46,393 INFO L93 Difference]: Finished difference Result 15646 states and 21041 transitions. [2019-01-11 21:16:46,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 21:16:46,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 354 [2019-01-11 21:16:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:46,406 INFO L225 Difference]: With dead ends: 15646 [2019-01-11 21:16:46,406 INFO L226 Difference]: Without dead ends: 7620 [2019-01-11 21:16:46,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-11 21:16:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2019-01-11 21:16:46,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 5286. [2019-01-11 21:16:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5286 states. [2019-01-11 21:16:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 7044 transitions. [2019-01-11 21:16:46,587 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 7044 transitions. Word has length 354 [2019-01-11 21:16:46,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:46,587 INFO L480 AbstractCegarLoop]: Abstraction has 5286 states and 7044 transitions. [2019-01-11 21:16:46,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:16:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 7044 transitions. [2019-01-11 21:16:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-01-11 21:16:46,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:46,607 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:16:46,607 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:46,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:46,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1296482981, now seen corresponding path program 1 times [2019-01-11 21:16:46,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:46,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:46,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:46,889 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:16:46,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:46,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:46,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:46,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:46,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:46,891 INFO L87 Difference]: Start difference. First operand 5286 states and 7044 transitions. Second operand 3 states. [2019-01-11 21:16:48,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:48,527 INFO L93 Difference]: Finished difference Result 11153 states and 14786 transitions. [2019-01-11 21:16:48,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:48,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 495 [2019-01-11 21:16:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:48,541 INFO L225 Difference]: With dead ends: 11153 [2019-01-11 21:16:48,542 INFO L226 Difference]: Without dead ends: 5898 [2019-01-11 21:16:48,550 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,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5898 states. [2019-01-11 21:16:48,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5898 to 5864. [2019-01-11 21:16:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5864 states. [2019-01-11 21:16:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 7707 transitions. [2019-01-11 21:16:48,854 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 7707 transitions. Word has length 495 [2019-01-11 21:16:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:48,855 INFO L480 AbstractCegarLoop]: Abstraction has 5864 states and 7707 transitions. [2019-01-11 21:16:48,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 7707 transitions. [2019-01-11 21:16:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-01-11 21:16:48,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:48,870 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:16:48,870 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:48,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1496383928, now seen corresponding path program 1 times [2019-01-11 21:16:48,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:48,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:48,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:48,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:48,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:49,175 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:16:49,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:16:49,176 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:16:49,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:49,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:49,764 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:16:50,342 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:16:50,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:16:50,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-01-11 21:16:50,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 21:16:50,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 21:16:50,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2019-01-11 21:16:50,381 INFO L87 Difference]: Start difference. First operand 5864 states and 7707 transitions. Second operand 7 states. [2019-01-11 21:16:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:52,086 INFO L93 Difference]: Finished difference Result 13978 states and 18470 transitions. [2019-01-11 21:16:52,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 21:16:52,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 512 [2019-01-11 21:16:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:52,088 INFO L225 Difference]: With dead ends: 13978 [2019-01-11 21:16:52,088 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:16:52,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=95, Unknown=1, NotChecked=20, Total=156 [2019-01-11 21:16:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:16:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:16:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:16:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:16:52,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 512 [2019-01-11 21:16:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:52,100 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:16:52,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 21:16:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:16:52,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:16:52,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:16:52,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:52,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:53,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:54,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,158 WARN L181 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 623 DAG size of output: 273 [2019-01-11 21:16:55,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,335 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 86 [2019-01-11 21:16:55,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:55,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,930 WARN L181 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 633 DAG size of output: 275 [2019-01-11 21:16:56,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:56,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:16:57,598 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-01-11 21:16:57,755 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2019-01-11 21:16:59,874 WARN L181 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 238 DAG size of output: 47 [2019-01-11 21:17:00,031 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 21 [2019-01-11 21:17:00,409 WARN L181 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 24 [2019-01-11 21:17:00,584 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 29 [2019-01-11 21:17:00,744 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 21 [2019-01-11 21:17:00,873 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2019-01-11 21:17:03,193 WARN L181 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 240 DAG size of output: 47 [2019-01-11 21:17:03,481 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 21 [2019-01-11 21:17:03,890 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 24 [2019-01-11 21:17:04,112 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 21 [2019-01-11 21:17:04,418 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-01-11 21:17:04,715 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 27 [2019-01-11 21:17:04,872 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2019-01-11 21:17:05,163 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 21 [2019-01-11 21:17:05,412 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 21 [2019-01-11 21:17:05,552 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 19 [2019-01-11 21:17:05,824 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 21 [2019-01-11 21:17:06,077 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 24 [2019-01-11 21:17:06,081 INFO L448 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-01-11 21:17:06,082 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 592) no Hoare annotation was computed. [2019-01-11 21:17:06,082 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 603) no Hoare annotation was computed. [2019-01-11 21:17:06,082 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 614) no Hoare annotation was computed. [2019-01-11 21:17:06,082 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 625) no Hoare annotation was computed. [2019-01-11 21:17:06,082 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 339) no Hoare annotation was computed. [2019-01-11 21:17:06,082 INFO L444 ceAbstractionStarter]: At program point L203(lines 199 593) 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:06,085 INFO L444 ceAbstractionStarter]: At program point L104(lines 103 625) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:17:06,085 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 479) no Hoare annotation was computed. [2019-01-11 21:17:06,085 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2019-01-11 21:17:06,085 INFO L444 ceAbstractionStarter]: At program point L369(lines 352 387) 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:06,085 INFO L444 ceAbstractionStarter]: At program point L403(lines 394 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:06,086 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 243) no Hoare annotation was computed. [2019-01-11 21:17:06,086 INFO L448 ceAbstractionStarter]: For program point L205(lines 205 591) no Hoare annotation was computed. [2019-01-11 21:17:06,086 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 602) no Hoare annotation was computed. [2019-01-11 21:17:06,086 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 613) no Hoare annotation was computed. [2019-01-11 21:17:06,086 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 624) no Hoare annotation was computed. [2019-01-11 21:17:06,086 INFO L448 ceAbstractionStarter]: For program point L371(lines 371 375) no Hoare annotation was computed. [2019-01-11 21:17:06,086 INFO L444 ceAbstractionStarter]: At program point L206(lines 205 591) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:17:06,086 INFO L444 ceAbstractionStarter]: At program point L173(lines 169 603) 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:06,087 INFO L444 ceAbstractionStarter]: At program point L140(lines 136 614) 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:06,088 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-01-11 21:17:06,088 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 411) no Hoare annotation was computed. [2019-01-11 21:17:06,088 INFO L448 ceAbstractionStarter]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-01-11 21:17:06,088 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-01-11 21:17:06,089 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 476) no Hoare annotation was computed. [2019-01-11 21:17:06,089 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 278) no Hoare annotation was computed. [2019-01-11 21:17:06,089 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 601) no Hoare annotation was computed. [2019-01-11 21:17:06,089 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 612) no Hoare annotation was computed. [2019-01-11 21:17:06,089 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 623) no Hoare annotation was computed. [2019-01-11 21:17:06,089 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 510) no Hoare annotation was computed. [2019-01-11 21:17:06,089 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 316) no Hoare annotation was computed. [2019-01-11 21:17:06,089 INFO L444 ceAbstractionStarter]: At program point L209(lines 208 590) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:17:06,090 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-01-11 21:17:06,090 INFO L448 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-01-11 21:17:06,095 INFO L451 ceAbstractionStarter]: At program point L672(lines 65 674) the Hoare annotation is: true [2019-01-11 21:17:06,095 INFO L448 ceAbstractionStarter]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-01-11 21:17:06,095 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-01-11 21:17:06,095 INFO L451 ceAbstractionStarter]: At program point L673(lines 8 675) the Hoare annotation is: true [2019-01-11 21:17:06,095 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-01-11 21:17:06,095 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 600) no Hoare annotation was computed. [2019-01-11 21:17:06,096 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 611) no Hoare annotation was computed. [2019-01-11 21:17:06,096 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 622) no Hoare annotation was computed. [2019-01-11 21:17:06,096 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 315) no Hoare annotation was computed. [2019-01-11 21:17:06,096 INFO L448 ceAbstractionStarter]: For program point L311-2(lines 210 587) no Hoare annotation was computed. [2019-01-11 21:17:06,096 INFO L444 ceAbstractionStarter]: At program point L179(lines 175 601) 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:06,096 INFO L444 ceAbstractionStarter]: At program point L146(lines 142 612) 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:06,096 INFO L444 ceAbstractionStarter]: At program point L213(lines 106 624) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:17:06,096 INFO L448 ceAbstractionStarter]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-01-11 21:17:06,097 INFO L448 ceAbstractionStarter]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-01-11 21:17:06,100 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 445 457) no Hoare annotation was computed. [2019-01-11 21:17:06,100 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 599) no Hoare annotation was computed. [2019-01-11 21:17:06,100 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 610) no Hoare annotation was computed. [2019-01-11 21:17:06,100 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 621) no Hoare annotation was computed. [2019-01-11 21:17:06,100 INFO L444 ceAbstractionStarter]: At program point L413(lines 404 424) 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:06,100 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 351) no Hoare annotation was computed. [2019-01-11 21:17:06,101 INFO L448 ceAbstractionStarter]: For program point L347-2(lines 210 587) no Hoare annotation was computed. [2019-01-11 21:17:06,101 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-01-11 21:17:06,101 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 65 674) no Hoare annotation was computed. [2019-01-11 21:17:06,101 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 453) no Hoare annotation was computed. [2019-01-11 21:17:06,101 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 598) no Hoare annotation was computed. [2019-01-11 21:17:06,101 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 609) no Hoare annotation was computed. [2019-01-11 21:17:06,101 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 620) no Hoare annotation was computed. [2019-01-11 21:17:06,101 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-01-11 21:17:06,101 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 420) no Hoare annotation was computed. [2019-01-11 21:17:06,102 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:17:06,105 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 222) no Hoare annotation was computed. [2019-01-11 21:17:06,105 INFO L444 ceAbstractionStarter]: At program point L185(lines 181 599) 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:06,105 INFO L444 ceAbstractionStarter]: At program point L152(lines 148 610) 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:06,105 INFO L448 ceAbstractionStarter]: For program point L218-2(lines 210 587) no Hoare annotation was computed. [2019-01-11 21:17:06,105 INFO L448 ceAbstractionStarter]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-01-11 21:17:06,106 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 488) no Hoare annotation was computed. [2019-01-11 21:17:06,106 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 597) no Hoare annotation was computed. [2019-01-11 21:17:06,106 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 608) no Hoare annotation was computed. [2019-01-11 21:17:06,106 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 619) no Hoare annotation was computed. [2019-01-11 21:17:06,106 INFO L444 ceAbstractionStarter]: At program point L551(lines 65 674) the Hoare annotation is: false [2019-01-11 21:17:06,106 INFO L444 ceAbstractionStarter]: At program point L122(lines 118 620) 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:06,106 INFO L448 ceAbstractionStarter]: For program point L255(lines 255 268) no Hoare annotation was computed. [2019-01-11 21:17:06,106 INFO L451 ceAbstractionStarter]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-01-11 21:17:06,107 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 386) no Hoare annotation was computed. [2019-01-11 21:17:06,109 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 326) no Hoare annotation was computed. [2019-01-11 21:17:06,109 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:17:06,110 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 261) no Hoare annotation was computed. [2019-01-11 21:17:06,110 INFO L448 ceAbstractionStarter]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2019-01-11 21:17:06,110 INFO L448 ceAbstractionStarter]: For program point L190(lines 190 596) no Hoare annotation was computed. [2019-01-11 21:17:06,110 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 607) no Hoare annotation was computed. [2019-01-11 21:17:06,110 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 618) no Hoare annotation was computed. [2019-01-11 21:17:06,110 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-01-11 21:17:06,110 INFO L444 ceAbstractionStarter]: At program point L191(lines 187 597) 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:06,110 INFO L444 ceAbstractionStarter]: At program point L158(lines 154 608) 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:06,111 INFO L444 ceAbstractionStarter]: At program point L125(lines 124 618) 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:06,111 INFO L444 ceAbstractionStarter]: At program point L588(lines 100 656) 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:06,111 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-01-11 21:17:06,111 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 295) no Hoare annotation was computed. [2019-01-11 21:17:06,111 INFO L448 ceAbstractionStarter]: For program point L291-2(lines 210 587) no Hoare annotation was computed. [2019-01-11 21:17:06,111 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 385) no Hoare annotation was computed. [2019-01-11 21:17:06,111 INFO L448 ceAbstractionStarter]: For program point L358-1(lines 358 385) no Hoare annotation was computed. [2019-01-11 21:17:06,112 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 595) no Hoare annotation was computed. [2019-01-11 21:17:06,115 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 606) no Hoare annotation was computed. [2019-01-11 21:17:06,115 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 617) no Hoare annotation was computed. [2019-01-11 21:17:06,115 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:17:06,115 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-01-11 21:17:06,115 INFO L451 ceAbstractionStarter]: At program point L657(lines 99 658) the Hoare annotation is: true [2019-01-11 21:17:06,115 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 668) no Hoare annotation was computed. [2019-01-11 21:17:06,116 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 425) no Hoare annotation was computed. [2019-01-11 21:17:06,116 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 594) no Hoare annotation was computed. [2019-01-11 21:17:06,116 INFO L448 ceAbstractionStarter]: For program point L163(lines 163 605) no Hoare annotation was computed. [2019-01-11 21:17:06,116 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 616) no Hoare annotation was computed. [2019-01-11 21:17:06,116 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-01-11 21:17:06,116 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 401) no Hoare annotation was computed. [2019-01-11 21:17:06,116 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 381) no Hoare annotation was computed. [2019-01-11 21:17:06,116 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 247) no Hoare annotation was computed. [2019-01-11 21:17:06,116 INFO L444 ceAbstractionStarter]: At program point L197(lines 193 595) 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:06,117 INFO L444 ceAbstractionStarter]: At program point L164(lines 160 606) 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:06,117 INFO L448 ceAbstractionStarter]: For program point L230-2(lines 210 587) no Hoare annotation was computed. [2019-01-11 21:17:06,117 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-01-11 21:17:06,117 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-01-11 21:17:06,117 INFO L448 ceAbstractionStarter]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-01-11 21:17:06,117 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 499) no Hoare annotation was computed. [2019-01-11 21:17:06,117 INFO L448 ceAbstractionStarter]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-01-11 21:17:06,117 INFO L448 ceAbstractionStarter]: For program point L528-2(lines 210 587) no Hoare annotation was computed. [2019-01-11 21:17:06,117 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 367) no Hoare annotation was computed. [2019-01-11 21:17:06,118 INFO L448 ceAbstractionStarter]: For program point L363-2(lines 362 379) no Hoare annotation was computed. [2019-01-11 21:17:06,121 INFO L448 ceAbstractionStarter]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-01-11 21:17:06,121 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-01-11 21:17:06,121 INFO L448 ceAbstractionStarter]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-01-11 21:17:06,121 INFO L448 ceAbstractionStarter]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-01-11 21:17:06,121 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 467) no Hoare annotation was computed. [2019-01-11 21:17:06,121 INFO L448 ceAbstractionStarter]: For program point L331-1(lines 331 340) no Hoare annotation was computed. [2019-01-11 21:17:06,121 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 237) no Hoare annotation was computed. [2019-01-11 21:17:06,121 INFO L448 ceAbstractionStarter]: For program point L199(lines 199 593) no Hoare annotation was computed. [2019-01-11 21:17:06,122 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 604) no Hoare annotation was computed. [2019-01-11 21:17:06,122 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 615) no Hoare annotation was computed. [2019-01-11 21:17:06,122 INFO L444 ceAbstractionStarter]: At program point L100-2(lines 100 656) 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:06,122 INFO L444 ceAbstractionStarter]: At program point L167(lines 166 604) 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:06,122 INFO L444 ceAbstractionStarter]: At program point L134(lines 127 617) 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:06,122 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-01-11 21:17:06,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:17:06 BoogieIcfgContainer [2019-01-11 21:17:06,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:17:06,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:17:06,182 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:17:06,182 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:17:06,182 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:27" (3/4) ... [2019-01-11 21:17:06,189 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:17:06,216 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:17:06,217 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:17:06,351 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:17:06,352 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:17:06,352 INFO L168 Benchmark]: Toolchain (without parser) took 40629.32 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 951.4 MB in the beginning and 866.9 MB in the end (delta: 84.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-01-11 21:17:06,354 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:17:06,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 447.73 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:06,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:06,355 INFO L168 Benchmark]: Boogie Preprocessor took 36.48 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:06,357 INFO L168 Benchmark]: RCFGBuilder took 1189.92 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.4 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:06,357 INFO L168 Benchmark]: TraceAbstraction took 38655.55 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 866.9 MB in the end (delta: 188.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-01-11 21:17:06,358 INFO L168 Benchmark]: Witness Printer took 170.09 ms. Allocated memory is still 2.3 GB. Free memory is still 866.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:17:06,363 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 447.73 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 123.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.48 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 1189.92 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.4 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38655.55 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 866.9 MB in the end (delta: 188.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 170.09 ms. Allocated memory is still 2.3 GB. Free memory is still 866.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 668]: 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: 676]: 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: 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: 65]: Loop Invariant Derived loop invariant: 1 - 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: 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: 404]: 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: 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: 352]: 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: 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: 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: 8]: 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: 394]: 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: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - 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, 38.5s OverallTime, 21 OverallIterations, 19 TraceHistogramMax, 16.3s AutomataDifference, 0.0s DeadEndRemovalTime, 13.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 4627 SDtfs, 2772 SDslu, 3774 SDs, 0 SdLazy, 3773 SolverSat, 582 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1496 GetRequests, 1450 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.3s 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.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 7188 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 1134 NumberOfFragments, 1082 HoareAnnotationTreeSize, 29 FomulaSimplifications, 165673 FormulaSimplificationTreeSizeReduction, 5.2s HoareSimplificationTime, 29 FomulaSimplificationsInter, 34240 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 5814 NumberOfCodeBlocks, 5814 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 5789 ConstructedInterpolants, 35 QuantifiedInterpolants, 3537802 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2269 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...