./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_6_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_srvr_6_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30944670c48cc2995b7d28a1cfa4117c8585a6fe ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:09:08,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:09:08,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:09:08,643 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:09:08,645 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:09:08,646 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:09:08,649 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:09:08,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:09:08,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:09:08,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:09:08,659 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:09:08,659 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:09:08,660 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:09:08,661 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:09:08,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:09:08,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:09:08,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:09:08,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:09:08,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:09:08,684 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:09:08,685 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:09:08,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:09:08,693 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:09:08,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:09:08,696 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:09:08,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:09:08,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:09:08,702 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:09:08,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:09:08,707 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:09:08,707 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:09:08,708 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:09:08,708 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:09:08,708 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:09:08,710 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:09:08,711 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:09:08,711 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:09:08,727 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:09:08,728 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:09:08,729 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:09:08,729 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:09:08,729 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:09:08,729 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:09:08,730 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:09:08,730 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:09:08,731 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:09:08,731 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:09:08,731 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:09:08,731 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:09:08,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:09:08,731 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:09:08,732 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:09:08,732 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:09:08,732 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:09:08,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:09:08,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:09:08,734 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:09:08,734 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:09:08,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:09:08,735 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:09:08,735 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:09:08,735 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:09:08,735 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:09:08,735 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:09:08,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:09:08,737 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 -> 30944670c48cc2995b7d28a1cfa4117c8585a6fe [2018-12-30 16:09:08,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:09:08,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:09:08,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:09:08,803 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:09:08,803 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:09:08,804 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_6_true-unreach-call_false-termination.cil.c [2018-12-30 16:09:08,868 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f2b3170/76acae0b02ce468f8d81e139f2afeebe/FLAG2b9d46eb4 [2018-12-30 16:09:09,440 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:09:09,441 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_6_true-unreach-call_false-termination.cil.c [2018-12-30 16:09:09,464 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f2b3170/76acae0b02ce468f8d81e139f2afeebe/FLAG2b9d46eb4 [2018-12-30 16:09:09,675 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f2b3170/76acae0b02ce468f8d81e139f2afeebe [2018-12-30 16:09:09,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:09:09,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:09:09,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:09:09,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:09:09,688 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:09:09,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:09:09" (1/1) ... [2018-12-30 16:09:09,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1923eb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09, skipping insertion in model container [2018-12-30 16:09:09,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:09:09" (1/1) ... [2018-12-30 16:09:09,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:09:09,745 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:09:10,039 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:09:10,043 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:09:10,114 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:09:10,140 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:09:10,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:10 WrapperNode [2018-12-30 16:09:10,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:09:10,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:09:10,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:09:10,142 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:09:10,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:10" (1/1) ... [2018-12-30 16:09:10,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:10" (1/1) ... [2018-12-30 16:09:10,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:09:10,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:09:10,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:09:10,342 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:09:10,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:10" (1/1) ... [2018-12-30 16:09:10,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:10" (1/1) ... [2018-12-30 16:09:10,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:10" (1/1) ... [2018-12-30 16:09:10,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:10" (1/1) ... [2018-12-30 16:09:10,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:10" (1/1) ... [2018-12-30 16:09:10,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:10" (1/1) ... [2018-12-30 16:09:10,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:10" (1/1) ... [2018-12-30 16:09:10,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:09:10,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:09:10,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:09:10,401 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:09:10,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:09:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:09:10,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:09:10,595 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:09:10,595 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:09:11,906 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:09:11,907 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:09:11,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:09:11 BoogieIcfgContainer [2018-12-30 16:09:11,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:09:11,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:09:11,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:09:11,912 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:09:11,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:09:09" (1/3) ... [2018-12-30 16:09:11,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d3b8751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:09:11, skipping insertion in model container [2018-12-30 16:09:11,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:10" (2/3) ... [2018-12-30 16:09:11,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d3b8751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:09:11, skipping insertion in model container [2018-12-30 16:09:11,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:09:11" (3/3) ... [2018-12-30 16:09:11,916 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_6_true-unreach-call_false-termination.cil.c [2018-12-30 16:09:11,927 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:09:11,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:09:11,954 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:09:11,989 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:09:11,990 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:09:11,990 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:09:11,990 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:09:11,991 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:09:11,991 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:09:11,991 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:09:11,991 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:09:11,992 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:09:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2018-12-30 16:09:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-30 16:09:12,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:12,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:12,028 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:12,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:12,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2127610309, now seen corresponding path program 1 times [2018-12-30 16:09:12,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:12,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:12,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:12,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:12,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:12,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:12,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:12,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:12,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:12,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:12,311 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 3 states. [2018-12-30 16:09:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:13,180 INFO L93 Difference]: Finished difference Result 362 states and 633 transitions. [2018-12-30 16:09:13,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:13,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-30 16:09:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:13,198 INFO L225 Difference]: With dead ends: 362 [2018-12-30 16:09:13,198 INFO L226 Difference]: Without dead ends: 192 [2018-12-30 16:09:13,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-30 16:09:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2018-12-30 16:09:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-30 16:09:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 300 transitions. [2018-12-30 16:09:13,263 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 300 transitions. Word has length 43 [2018-12-30 16:09:13,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:13,264 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 300 transitions. [2018-12-30 16:09:13,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 300 transitions. [2018-12-30 16:09:13,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-30 16:09:13,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:13,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:13,267 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:13,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:13,268 INFO L82 PathProgramCache]: Analyzing trace with hash -918181364, now seen corresponding path program 1 times [2018-12-30 16:09:13,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:13,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:13,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:13,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:13,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:13,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:13,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:13,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:13,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:13,406 INFO L87 Difference]: Start difference. First operand 182 states and 300 transitions. Second operand 3 states. [2018-12-30 16:09:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:13,926 INFO L93 Difference]: Finished difference Result 406 states and 678 transitions. [2018-12-30 16:09:13,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:13,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-30 16:09:13,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:13,931 INFO L225 Difference]: With dead ends: 406 [2018-12-30 16:09:13,931 INFO L226 Difference]: Without dead ends: 231 [2018-12-30 16:09:13,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-30 16:09:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2018-12-30 16:09:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-30 16:09:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 373 transitions. [2018-12-30 16:09:13,955 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 373 transitions. Word has length 44 [2018-12-30 16:09:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:13,956 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 373 transitions. [2018-12-30 16:09:13,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 373 transitions. [2018-12-30 16:09:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-30 16:09:13,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:13,961 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:13,961 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:13,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:13,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1182821184, now seen corresponding path program 1 times [2018-12-30 16:09:13,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:13,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:13,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:13,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:14,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:14,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:14,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:14,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:14,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:14,076 INFO L87 Difference]: Start difference. First operand 221 states and 373 transitions. Second operand 3 states. [2018-12-30 16:09:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:14,435 INFO L93 Difference]: Finished difference Result 466 states and 793 transitions. [2018-12-30 16:09:14,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:14,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-12-30 16:09:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:14,442 INFO L225 Difference]: With dead ends: 466 [2018-12-30 16:09:14,442 INFO L226 Difference]: Without dead ends: 252 [2018-12-30 16:09:14,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-12-30 16:09:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-12-30 16:09:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-30 16:09:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 429 transitions. [2018-12-30 16:09:14,485 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 429 transitions. Word has length 71 [2018-12-30 16:09:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:14,485 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 429 transitions. [2018-12-30 16:09:14,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:14,486 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 429 transitions. [2018-12-30 16:09:14,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-30 16:09:14,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:14,497 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:14,497 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:14,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:14,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2081183082, now seen corresponding path program 1 times [2018-12-30 16:09:14,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:14,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:14,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:14,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:14,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:14,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:14,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:14,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:14,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:14,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:14,587 INFO L87 Difference]: Start difference. First operand 252 states and 429 transitions. Second operand 3 states. [2018-12-30 16:09:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:15,037 INFO L93 Difference]: Finished difference Result 536 states and 918 transitions. [2018-12-30 16:09:15,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:15,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-30 16:09:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:15,042 INFO L225 Difference]: With dead ends: 536 [2018-12-30 16:09:15,042 INFO L226 Difference]: Without dead ends: 291 [2018-12-30 16:09:15,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:15,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-30 16:09:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2018-12-30 16:09:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-12-30 16:09:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 494 transitions. [2018-12-30 16:09:15,059 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 494 transitions. Word has length 77 [2018-12-30 16:09:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:15,059 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 494 transitions. [2018-12-30 16:09:15,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 494 transitions. [2018-12-30 16:09:15,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-30 16:09:15,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:15,062 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:15,063 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:15,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:15,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2046128707, now seen corresponding path program 1 times [2018-12-30 16:09:15,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:15,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:15,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:15,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:15,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:15,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:15,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:15,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:15,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:15,160 INFO L87 Difference]: Start difference. First operand 288 states and 494 transitions. Second operand 3 states. [2018-12-30 16:09:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:15,606 INFO L93 Difference]: Finished difference Result 572 states and 981 transitions. [2018-12-30 16:09:15,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:15,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-12-30 16:09:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:15,610 INFO L225 Difference]: With dead ends: 572 [2018-12-30 16:09:15,610 INFO L226 Difference]: Without dead ends: 291 [2018-12-30 16:09:15,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-30 16:09:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2018-12-30 16:09:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-12-30 16:09:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 492 transitions. [2018-12-30 16:09:15,626 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 492 transitions. Word has length 78 [2018-12-30 16:09:15,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:15,627 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 492 transitions. [2018-12-30 16:09:15,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:15,627 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 492 transitions. [2018-12-30 16:09:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-30 16:09:15,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:15,630 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:15,630 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:15,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1823459990, now seen corresponding path program 1 times [2018-12-30 16:09:15,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:15,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:15,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:15,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:15,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:15,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:15,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:15,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:15,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:15,722 INFO L87 Difference]: Start difference. First operand 288 states and 492 transitions. Second operand 3 states. [2018-12-30 16:09:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:15,942 INFO L93 Difference]: Finished difference Result 586 states and 1001 transitions. [2018-12-30 16:09:15,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:15,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-30 16:09:15,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:15,946 INFO L225 Difference]: With dead ends: 586 [2018-12-30 16:09:15,946 INFO L226 Difference]: Without dead ends: 305 [2018-12-30 16:09:15,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:15,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-30 16:09:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2018-12-30 16:09:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-30 16:09:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 514 transitions. [2018-12-30 16:09:15,959 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 514 transitions. Word has length 83 [2018-12-30 16:09:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:15,960 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 514 transitions. [2018-12-30 16:09:15,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 514 transitions. [2018-12-30 16:09:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:09:15,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:15,961 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:15,961 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:15,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1102198878, now seen corresponding path program 1 times [2018-12-30 16:09:15,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:15,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:15,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:15,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:15,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:16,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:16,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:16,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:16,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:16,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:16,045 INFO L87 Difference]: Start difference. First operand 303 states and 514 transitions. Second operand 3 states. [2018-12-30 16:09:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:16,712 INFO L93 Difference]: Finished difference Result 601 states and 1019 transitions. [2018-12-30 16:09:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:16,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:09:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:16,714 INFO L225 Difference]: With dead ends: 601 [2018-12-30 16:09:16,714 INFO L226 Difference]: Without dead ends: 305 [2018-12-30 16:09:16,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-30 16:09:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2018-12-30 16:09:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-30 16:09:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 510 transitions. [2018-12-30 16:09:16,727 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 510 transitions. Word has length 84 [2018-12-30 16:09:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:16,727 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 510 transitions. [2018-12-30 16:09:16,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 510 transitions. [2018-12-30 16:09:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-30 16:09:16,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:16,731 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:16,731 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:16,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:16,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2038845885, now seen corresponding path program 1 times [2018-12-30 16:09:16,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:16,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:16,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-30 16:09:16,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:16,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:16,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:16,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:16,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:16,787 INFO L87 Difference]: Start difference. First operand 303 states and 510 transitions. Second operand 3 states. [2018-12-30 16:09:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:17,206 INFO L93 Difference]: Finished difference Result 608 states and 1021 transitions. [2018-12-30 16:09:17,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:17,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-12-30 16:09:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:17,209 INFO L225 Difference]: With dead ends: 608 [2018-12-30 16:09:17,209 INFO L226 Difference]: Without dead ends: 312 [2018-12-30 16:09:17,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-12-30 16:09:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-12-30 16:09:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-12-30 16:09:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 516 transitions. [2018-12-30 16:09:17,224 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 516 transitions. Word has length 96 [2018-12-30 16:09:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:17,225 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 516 transitions. [2018-12-30 16:09:17,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 516 transitions. [2018-12-30 16:09:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-30 16:09:17,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:17,228 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:17,228 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:17,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2067402745, now seen corresponding path program 1 times [2018-12-30 16:09:17,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:17,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:17,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:17,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:17,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:17,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:17,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:17,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:17,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:17,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:17,320 INFO L87 Difference]: Start difference. First operand 312 states and 516 transitions. Second operand 3 states. [2018-12-30 16:09:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:18,331 INFO L93 Difference]: Finished difference Result 648 states and 1074 transitions. [2018-12-30 16:09:18,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:18,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-12-30 16:09:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:18,338 INFO L225 Difference]: With dead ends: 648 [2018-12-30 16:09:18,339 INFO L226 Difference]: Without dead ends: 343 [2018-12-30 16:09:18,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-12-30 16:09:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-12-30 16:09:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-12-30 16:09:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 563 transitions. [2018-12-30 16:09:18,354 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 563 transitions. Word has length 97 [2018-12-30 16:09:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:18,354 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 563 transitions. [2018-12-30 16:09:18,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 563 transitions. [2018-12-30 16:09:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-30 16:09:18,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:18,357 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:18,358 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:18,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:18,360 INFO L82 PathProgramCache]: Analyzing trace with hash -405291931, now seen corresponding path program 1 times [2018-12-30 16:09:18,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:18,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:18,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:18,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:18,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:18,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:18,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:18,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:18,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:18,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:18,442 INFO L87 Difference]: Start difference. First operand 341 states and 563 transitions. Second operand 3 states. [2018-12-30 16:09:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:18,984 INFO L93 Difference]: Finished difference Result 677 states and 1117 transitions. [2018-12-30 16:09:18,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:18,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-30 16:09:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:18,988 INFO L225 Difference]: With dead ends: 677 [2018-12-30 16:09:18,988 INFO L226 Difference]: Without dead ends: 343 [2018-12-30 16:09:18,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:18,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-12-30 16:09:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-12-30 16:09:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-12-30 16:09:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 559 transitions. [2018-12-30 16:09:19,002 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 559 transitions. Word has length 98 [2018-12-30 16:09:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:19,003 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 559 transitions. [2018-12-30 16:09:19,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 559 transitions. [2018-12-30 16:09:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-30 16:09:19,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:19,006 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:19,006 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:19,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:19,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1888540852, now seen corresponding path program 1 times [2018-12-30 16:09:19,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:19,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:19,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:19,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:19,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:19,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:19,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:19,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:19,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:19,097 INFO L87 Difference]: Start difference. First operand 341 states and 559 transitions. Second operand 3 states. [2018-12-30 16:09:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:19,598 INFO L93 Difference]: Finished difference Result 711 states and 1169 transitions. [2018-12-30 16:09:19,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:19,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-30 16:09:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:19,602 INFO L225 Difference]: With dead ends: 711 [2018-12-30 16:09:19,602 INFO L226 Difference]: Without dead ends: 377 [2018-12-30 16:09:19,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-12-30 16:09:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2018-12-30 16:09:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-30 16:09:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 601 transitions. [2018-12-30 16:09:19,616 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 601 transitions. Word has length 100 [2018-12-30 16:09:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:19,617 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 601 transitions. [2018-12-30 16:09:19,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 601 transitions. [2018-12-30 16:09:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-30 16:09:19,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:19,619 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:19,619 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:19,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:19,621 INFO L82 PathProgramCache]: Analyzing trace with hash -914923520, now seen corresponding path program 1 times [2018-12-30 16:09:19,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:19,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:19,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:19,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:19,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:19,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:19,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:19,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:19,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:19,712 INFO L87 Difference]: Start difference. First operand 368 states and 601 transitions. Second operand 3 states. [2018-12-30 16:09:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:19,930 INFO L93 Difference]: Finished difference Result 738 states and 1206 transitions. [2018-12-30 16:09:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:19,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-30 16:09:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:19,933 INFO L225 Difference]: With dead ends: 738 [2018-12-30 16:09:19,934 INFO L226 Difference]: Without dead ends: 377 [2018-12-30 16:09:19,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-12-30 16:09:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2018-12-30 16:09:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-30 16:09:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 596 transitions. [2018-12-30 16:09:19,946 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 596 transitions. Word has length 101 [2018-12-30 16:09:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:19,946 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 596 transitions. [2018-12-30 16:09:19,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 596 transitions. [2018-12-30 16:09:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-30 16:09:19,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:19,947 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:19,950 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:19,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:19,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1027811327, now seen corresponding path program 1 times [2018-12-30 16:09:19,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:19,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:19,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-30 16:09:20,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:20,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:20,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:20,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:20,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:20,024 INFO L87 Difference]: Start difference. First operand 368 states and 596 transitions. Second operand 3 states. [2018-12-30 16:09:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:20,760 INFO L93 Difference]: Finished difference Result 766 states and 1241 transitions. [2018-12-30 16:09:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:20,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-12-30 16:09:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:20,767 INFO L225 Difference]: With dead ends: 766 [2018-12-30 16:09:20,767 INFO L226 Difference]: Without dead ends: 405 [2018-12-30 16:09:20,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-12-30 16:09:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2018-12-30 16:09:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-12-30 16:09:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 649 transitions. [2018-12-30 16:09:20,786 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 649 transitions. Word has length 109 [2018-12-30 16:09:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:20,786 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 649 transitions. [2018-12-30 16:09:20,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 649 transitions. [2018-12-30 16:09:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-30 16:09:20,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:20,790 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:20,790 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:20,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1871752250, now seen corresponding path program 1 times [2018-12-30 16:09:20,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:20,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:20,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:20,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-30 16:09:20,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:20,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:20,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:20,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:20,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:20,904 INFO L87 Difference]: Start difference. First operand 402 states and 649 transitions. Second operand 3 states. [2018-12-30 16:09:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:21,305 INFO L93 Difference]: Finished difference Result 800 states and 1291 transitions. [2018-12-30 16:09:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:21,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-12-30 16:09:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:21,307 INFO L225 Difference]: With dead ends: 800 [2018-12-30 16:09:21,307 INFO L226 Difference]: Without dead ends: 405 [2018-12-30 16:09:21,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-12-30 16:09:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2018-12-30 16:09:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-12-30 16:09:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 646 transitions. [2018-12-30 16:09:21,322 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 646 transitions. Word has length 110 [2018-12-30 16:09:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:21,322 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 646 transitions. [2018-12-30 16:09:21,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 646 transitions. [2018-12-30 16:09:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-30 16:09:21,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:21,323 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:21,325 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:21,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:21,326 INFO L82 PathProgramCache]: Analyzing trace with hash -999335216, now seen corresponding path program 1 times [2018-12-30 16:09:21,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:21,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:21,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:21,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:21,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:21,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:21,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:21,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:21,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:21,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:21,402 INFO L87 Difference]: Start difference. First operand 402 states and 646 transitions. Second operand 3 states. [2018-12-30 16:09:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:21,819 INFO L93 Difference]: Finished difference Result 845 states and 1357 transitions. [2018-12-30 16:09:21,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:21,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-30 16:09:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:21,823 INFO L225 Difference]: With dead ends: 845 [2018-12-30 16:09:21,823 INFO L226 Difference]: Without dead ends: 450 [2018-12-30 16:09:21,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-30 16:09:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 444. [2018-12-30 16:09:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-12-30 16:09:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 711 transitions. [2018-12-30 16:09:21,838 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 711 transitions. Word has length 113 [2018-12-30 16:09:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:21,839 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 711 transitions. [2018-12-30 16:09:21,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 711 transitions. [2018-12-30 16:09:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-30 16:09:21,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:21,842 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:21,842 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:21,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:21,842 INFO L82 PathProgramCache]: Analyzing trace with hash 948766871, now seen corresponding path program 1 times [2018-12-30 16:09:21,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:21,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:21,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:21,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:21,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:21,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:21,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:21,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:21,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:21,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:21,917 INFO L87 Difference]: Start difference. First operand 444 states and 711 transitions. Second operand 3 states. [2018-12-30 16:09:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:22,502 INFO L93 Difference]: Finished difference Result 891 states and 1428 transitions. [2018-12-30 16:09:22,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:22,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-12-30 16:09:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:22,507 INFO L225 Difference]: With dead ends: 891 [2018-12-30 16:09:22,507 INFO L226 Difference]: Without dead ends: 452 [2018-12-30 16:09:22,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-12-30 16:09:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 446. [2018-12-30 16:09:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-12-30 16:09:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 714 transitions. [2018-12-30 16:09:22,521 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 714 transitions. Word has length 114 [2018-12-30 16:09:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:22,521 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 714 transitions. [2018-12-30 16:09:22,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 714 transitions. [2018-12-30 16:09:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-30 16:09:22,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:22,525 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:22,525 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:22,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:22,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1289805000, now seen corresponding path program 1 times [2018-12-30 16:09:22,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:22,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:22,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:22,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-30 16:09:22,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:22,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:22,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:22,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:22,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:22,603 INFO L87 Difference]: Start difference. First operand 446 states and 714 transitions. Second operand 3 states. [2018-12-30 16:09:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:22,830 INFO L93 Difference]: Finished difference Result 924 states and 1483 transitions. [2018-12-30 16:09:22,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:22,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-12-30 16:09:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:22,835 INFO L225 Difference]: With dead ends: 924 [2018-12-30 16:09:22,835 INFO L226 Difference]: Without dead ends: 485 [2018-12-30 16:09:22,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:22,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-12-30 16:09:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 471. [2018-12-30 16:09:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-12-30 16:09:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 749 transitions. [2018-12-30 16:09:22,851 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 749 transitions. Word has length 126 [2018-12-30 16:09:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:22,851 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 749 transitions. [2018-12-30 16:09:22,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 749 transitions. [2018-12-30 16:09:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-30 16:09:22,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:22,855 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:22,855 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:22,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:22,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1057341556, now seen corresponding path program 1 times [2018-12-30 16:09:22,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:22,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:22,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:22,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-30 16:09:22,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:22,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:22,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:22,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:22,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:22,950 INFO L87 Difference]: Start difference. First operand 471 states and 749 transitions. Second operand 3 states. [2018-12-30 16:09:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:23,768 INFO L93 Difference]: Finished difference Result 949 states and 1510 transitions. [2018-12-30 16:09:23,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:23,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-12-30 16:09:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:23,775 INFO L225 Difference]: With dead ends: 949 [2018-12-30 16:09:23,775 INFO L226 Difference]: Without dead ends: 485 [2018-12-30 16:09:23,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:23,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-12-30 16:09:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 471. [2018-12-30 16:09:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-12-30 16:09:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 741 transitions. [2018-12-30 16:09:23,790 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 741 transitions. Word has length 127 [2018-12-30 16:09:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:23,790 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 741 transitions. [2018-12-30 16:09:23,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 741 transitions. [2018-12-30 16:09:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-30 16:09:23,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:23,794 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:23,794 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1852729836, now seen corresponding path program 1 times [2018-12-30 16:09:23,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:23,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:23,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-30 16:09:23,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:23,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:23,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:23,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:23,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:23,846 INFO L87 Difference]: Start difference. First operand 471 states and 741 transitions. Second operand 3 states. [2018-12-30 16:09:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:24,065 INFO L93 Difference]: Finished difference Result 941 states and 1480 transitions. [2018-12-30 16:09:24,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:24,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2018-12-30 16:09:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:24,070 INFO L225 Difference]: With dead ends: 941 [2018-12-30 16:09:24,070 INFO L226 Difference]: Without dead ends: 477 [2018-12-30 16:09:24,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-12-30 16:09:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 471. [2018-12-30 16:09:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-12-30 16:09:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 736 transitions. [2018-12-30 16:09:24,085 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 736 transitions. Word has length 142 [2018-12-30 16:09:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:24,085 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 736 transitions. [2018-12-30 16:09:24,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 736 transitions. [2018-12-30 16:09:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-30 16:09:24,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:24,088 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:24,089 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:24,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:24,089 INFO L82 PathProgramCache]: Analyzing trace with hash -591047027, now seen corresponding path program 1 times [2018-12-30 16:09:24,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:24,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:24,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:24,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:24,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:24,176 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-30 16:09:24,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:24,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:24,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:24,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:24,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:24,178 INFO L87 Difference]: Start difference. First operand 471 states and 736 transitions. Second operand 3 states. [2018-12-30 16:09:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:24,924 INFO L93 Difference]: Finished difference Result 941 states and 1470 transitions. [2018-12-30 16:09:24,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:24,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-12-30 16:09:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:24,928 INFO L225 Difference]: With dead ends: 941 [2018-12-30 16:09:24,928 INFO L226 Difference]: Without dead ends: 477 [2018-12-30 16:09:24,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-12-30 16:09:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 471. [2018-12-30 16:09:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-12-30 16:09:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 731 transitions. [2018-12-30 16:09:24,943 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 731 transitions. Word has length 143 [2018-12-30 16:09:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:24,945 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 731 transitions. [2018-12-30 16:09:24,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 731 transitions. [2018-12-30 16:09:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-30 16:09:24,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:24,947 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:24,948 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:24,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:24,948 INFO L82 PathProgramCache]: Analyzing trace with hash -496968781, now seen corresponding path program 1 times [2018-12-30 16:09:24,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:24,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:24,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:24,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:24,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-12-30 16:09:25,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:25,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:25,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:25,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:25,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:25,028 INFO L87 Difference]: Start difference. First operand 471 states and 731 transitions. Second operand 3 states. [2018-12-30 16:09:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:25,265 INFO L93 Difference]: Finished difference Result 964 states and 1498 transitions. [2018-12-30 16:09:25,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:25,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-12-30 16:09:25,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:25,268 INFO L225 Difference]: With dead ends: 964 [2018-12-30 16:09:25,269 INFO L226 Difference]: Without dead ends: 500 [2018-12-30 16:09:25,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-12-30 16:09:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 495. [2018-12-30 16:09:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-12-30 16:09:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 762 transitions. [2018-12-30 16:09:25,288 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 762 transitions. Word has length 147 [2018-12-30 16:09:25,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:25,289 INFO L480 AbstractCegarLoop]: Abstraction has 495 states and 762 transitions. [2018-12-30 16:09:25,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 762 transitions. [2018-12-30 16:09:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-30 16:09:25,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:25,293 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:25,293 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:25,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:25,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1996412097, now seen corresponding path program 1 times [2018-12-30 16:09:25,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:25,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:25,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:25,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:25,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-12-30 16:09:25,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:25,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:25,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:25,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:25,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:25,408 INFO L87 Difference]: Start difference. First operand 495 states and 762 transitions. Second operand 3 states. [2018-12-30 16:09:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:25,679 INFO L93 Difference]: Finished difference Result 988 states and 1520 transitions. [2018-12-30 16:09:25,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:25,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-12-30 16:09:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:25,684 INFO L225 Difference]: With dead ends: 988 [2018-12-30 16:09:25,684 INFO L226 Difference]: Without dead ends: 500 [2018-12-30 16:09:25,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-12-30 16:09:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 495. [2018-12-30 16:09:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-12-30 16:09:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 753 transitions. [2018-12-30 16:09:25,697 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 753 transitions. Word has length 148 [2018-12-30 16:09:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:25,697 INFO L480 AbstractCegarLoop]: Abstraction has 495 states and 753 transitions. [2018-12-30 16:09:25,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 753 transitions. [2018-12-30 16:09:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-30 16:09:25,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:25,699 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:25,699 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:25,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:25,699 INFO L82 PathProgramCache]: Analyzing trace with hash 94488236, now seen corresponding path program 1 times [2018-12-30 16:09:25,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:25,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:25,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:25,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-30 16:09:25,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:25,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:25,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:25,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:25,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:25,789 INFO L87 Difference]: Start difference. First operand 495 states and 753 transitions. Second operand 3 states. [2018-12-30 16:09:26,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:26,166 INFO L93 Difference]: Finished difference Result 1031 states and 1563 transitions. [2018-12-30 16:09:26,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:26,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2018-12-30 16:09:26,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:26,169 INFO L225 Difference]: With dead ends: 1031 [2018-12-30 16:09:26,169 INFO L226 Difference]: Without dead ends: 543 [2018-12-30 16:09:26,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:26,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-30 16:09:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 536. [2018-12-30 16:09:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-12-30 16:09:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 808 transitions. [2018-12-30 16:09:26,185 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 808 transitions. Word has length 153 [2018-12-30 16:09:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:26,186 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 808 transitions. [2018-12-30 16:09:26,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 808 transitions. [2018-12-30 16:09:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-30 16:09:26,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:26,189 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:26,189 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:26,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1668084205, now seen corresponding path program 1 times [2018-12-30 16:09:26,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:26,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:26,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:26,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:26,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-30 16:09:26,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:26,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:26,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:26,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:26,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:26,275 INFO L87 Difference]: Start difference. First operand 536 states and 808 transitions. Second operand 3 states. [2018-12-30 16:09:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:26,828 INFO L93 Difference]: Finished difference Result 1072 states and 1616 transitions. [2018-12-30 16:09:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:26,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-12-30 16:09:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:26,832 INFO L225 Difference]: With dead ends: 1072 [2018-12-30 16:09:26,833 INFO L226 Difference]: Without dead ends: 524 [2018-12-30 16:09:26,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-12-30 16:09:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 517. [2018-12-30 16:09:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-12-30 16:09:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 778 transitions. [2018-12-30 16:09:26,849 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 778 transitions. Word has length 154 [2018-12-30 16:09:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:26,850 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 778 transitions. [2018-12-30 16:09:26,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 778 transitions. [2018-12-30 16:09:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-30 16:09:26,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:26,853 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:26,853 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:26,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:26,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1516216508, now seen corresponding path program 1 times [2018-12-30 16:09:26,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:26,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:26,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:26,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:26,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-12-30 16:09:26,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:26,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:26,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:26,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:26,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:26,945 INFO L87 Difference]: Start difference. First operand 517 states and 778 transitions. Second operand 3 states. [2018-12-30 16:09:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:27,671 INFO L93 Difference]: Finished difference Result 1052 states and 1586 transitions. [2018-12-30 16:09:27,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:27,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-12-30 16:09:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:27,674 INFO L225 Difference]: With dead ends: 1052 [2018-12-30 16:09:27,675 INFO L226 Difference]: Without dead ends: 542 [2018-12-30 16:09:27,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-12-30 16:09:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 538. [2018-12-30 16:09:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-12-30 16:09:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 802 transitions. [2018-12-30 16:09:27,692 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 802 transitions. Word has length 168 [2018-12-30 16:09:27,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:27,692 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 802 transitions. [2018-12-30 16:09:27,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 802 transitions. [2018-12-30 16:09:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-30 16:09:27,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:27,696 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:27,696 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:27,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:27,697 INFO L82 PathProgramCache]: Analyzing trace with hash 648643544, now seen corresponding path program 1 times [2018-12-30 16:09:27,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:27,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:27,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:27,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:27,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-12-30 16:09:27,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:27,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:27,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:27,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:27,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:27,787 INFO L87 Difference]: Start difference. First operand 538 states and 802 transitions. Second operand 3 states. [2018-12-30 16:09:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:28,475 INFO L93 Difference]: Finished difference Result 1073 states and 1599 transitions. [2018-12-30 16:09:28,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:28,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2018-12-30 16:09:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:28,480 INFO L225 Difference]: With dead ends: 1073 [2018-12-30 16:09:28,480 INFO L226 Difference]: Without dead ends: 540 [2018-12-30 16:09:28,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:28,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-12-30 16:09:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 536. [2018-12-30 16:09:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-12-30 16:09:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 788 transitions. [2018-12-30 16:09:28,497 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 788 transitions. Word has length 169 [2018-12-30 16:09:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:28,498 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 788 transitions. [2018-12-30 16:09:28,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 788 transitions. [2018-12-30 16:09:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-30 16:09:28,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:28,502 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:28,502 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:28,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:28,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1531494180, now seen corresponding path program 1 times [2018-12-30 16:09:28,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:28,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:28,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:28,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-30 16:09:28,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:28,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:28,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:28,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:28,587 INFO L87 Difference]: Start difference. First operand 536 states and 788 transitions. Second operand 3 states. [2018-12-30 16:09:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:28,701 INFO L93 Difference]: Finished difference Result 1587 states and 2329 transitions. [2018-12-30 16:09:28,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:28,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-12-30 16:09:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:28,707 INFO L225 Difference]: With dead ends: 1587 [2018-12-30 16:09:28,707 INFO L226 Difference]: Without dead ends: 1058 [2018-12-30 16:09:28,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2018-12-30 16:09:28,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 537. [2018-12-30 16:09:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-12-30 16:09:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 789 transitions. [2018-12-30 16:09:28,732 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 789 transitions. Word has length 184 [2018-12-30 16:09:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:28,732 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 789 transitions. [2018-12-30 16:09:28,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 789 transitions. [2018-12-30 16:09:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-30 16:09:28,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:28,735 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:28,736 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:28,736 INFO L82 PathProgramCache]: Analyzing trace with hash -335214494, now seen corresponding path program 1 times [2018-12-30 16:09:28,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:28,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:28,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:28,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:28,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-30 16:09:28,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:28,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:28,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:28,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:28,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:28,828 INFO L87 Difference]: Start difference. First operand 537 states and 789 transitions. Second operand 3 states. [2018-12-30 16:09:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:29,935 INFO L93 Difference]: Finished difference Result 1595 states and 2344 transitions. [2018-12-30 16:09:29,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:29,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-12-30 16:09:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:29,942 INFO L225 Difference]: With dead ends: 1595 [2018-12-30 16:09:29,943 INFO L226 Difference]: Without dead ends: 1065 [2018-12-30 16:09:29,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-12-30 16:09:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2018-12-30 16:09:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2018-12-30 16:09:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1547 transitions. [2018-12-30 16:09:29,986 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1547 transitions. Word has length 184 [2018-12-30 16:09:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:29,986 INFO L480 AbstractCegarLoop]: Abstraction has 1065 states and 1547 transitions. [2018-12-30 16:09:29,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1547 transitions. [2018-12-30 16:09:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-30 16:09:29,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:29,992 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:29,992 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash 613712652, now seen corresponding path program 1 times [2018-12-30 16:09:29,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:29,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:29,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:29,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:29,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-30 16:09:30,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:30,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:30,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:30,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:30,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:30,111 INFO L87 Difference]: Start difference. First operand 1065 states and 1547 transitions. Second operand 3 states. [2018-12-30 16:09:31,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:31,118 INFO L93 Difference]: Finished difference Result 2651 states and 3860 transitions. [2018-12-30 16:09:31,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:31,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-12-30 16:09:31,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:31,124 INFO L225 Difference]: With dead ends: 2651 [2018-12-30 16:09:31,125 INFO L226 Difference]: Without dead ends: 1593 [2018-12-30 16:09:31,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:31,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2018-12-30 16:09:31,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1593. [2018-12-30 16:09:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2018-12-30 16:09:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2306 transitions. [2018-12-30 16:09:31,173 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2306 transitions. Word has length 186 [2018-12-30 16:09:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:31,174 INFO L480 AbstractCegarLoop]: Abstraction has 1593 states and 2306 transitions. [2018-12-30 16:09:31,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2306 transitions. [2018-12-30 16:09:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-30 16:09:31,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:31,179 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:31,179 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:31,180 INFO L82 PathProgramCache]: Analyzing trace with hash 441366398, now seen corresponding path program 1 times [2018-12-30 16:09:31,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:31,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:31,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:31,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-12-30 16:09:31,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:09:31,301 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:09:31,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:31,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:09:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-12-30 16:09:31,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:09:31,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 16:09:31,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:09:31,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:09:31,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:09:31,580 INFO L87 Difference]: Start difference. First operand 1593 states and 2306 transitions. Second operand 5 states. [2018-12-30 16:09:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:35,014 INFO L93 Difference]: Finished difference Result 5825 states and 8426 transitions. [2018-12-30 16:09:35,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 16:09:35,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2018-12-30 16:09:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:35,035 INFO L225 Difference]: With dead ends: 5825 [2018-12-30 16:09:35,035 INFO L226 Difference]: Without dead ends: 4195 [2018-12-30 16:09:35,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-30 16:09:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2018-12-30 16:09:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 2389. [2018-12-30 16:09:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2018-12-30 16:09:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3415 transitions. [2018-12-30 16:09:35,161 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3415 transitions. Word has length 187 [2018-12-30 16:09:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:35,162 INFO L480 AbstractCegarLoop]: Abstraction has 2389 states and 3415 transitions. [2018-12-30 16:09:35,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:09:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3415 transitions. [2018-12-30 16:09:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-30 16:09:35,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:35,171 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:35,172 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:35,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:35,172 INFO L82 PathProgramCache]: Analyzing trace with hash 382109115, now seen corresponding path program 1 times [2018-12-30 16:09:35,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:35,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:35,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:35,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:35,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2018-12-30 16:09:35,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:35,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:35,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:35,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:35,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:35,408 INFO L87 Difference]: Start difference. First operand 2389 states and 3415 transitions. Second operand 3 states. [2018-12-30 16:09:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:35,798 INFO L93 Difference]: Finished difference Result 5358 states and 7670 transitions. [2018-12-30 16:09:35,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:35,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-12-30 16:09:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:35,810 INFO L225 Difference]: With dead ends: 5358 [2018-12-30 16:09:35,810 INFO L226 Difference]: Without dead ends: 2976 [2018-12-30 16:09:35,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2018-12-30 16:09:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2976. [2018-12-30 16:09:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2018-12-30 16:09:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 4248 transitions. [2018-12-30 16:09:35,916 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 4248 transitions. Word has length 286 [2018-12-30 16:09:35,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:35,917 INFO L480 AbstractCegarLoop]: Abstraction has 2976 states and 4248 transitions. [2018-12-30 16:09:35,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 4248 transitions. [2018-12-30 16:09:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-30 16:09:35,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:35,924 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:35,924 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:35,925 INFO L82 PathProgramCache]: Analyzing trace with hash 630255609, now seen corresponding path program 1 times [2018-12-30 16:09:35,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:35,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:35,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:35,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:35,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2018-12-30 16:09:36,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:36,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:36,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:36,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:36,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:36,061 INFO L87 Difference]: Start difference. First operand 2976 states and 4248 transitions. Second operand 3 states. [2018-12-30 16:09:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:36,419 INFO L93 Difference]: Finished difference Result 6501 states and 9297 transitions. [2018-12-30 16:09:36,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:36,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-12-30 16:09:36,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:36,448 INFO L225 Difference]: With dead ends: 6501 [2018-12-30 16:09:36,450 INFO L226 Difference]: Without dead ends: 3532 [2018-12-30 16:09:36,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3532 states. [2018-12-30 16:09:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3532 to 3532. [2018-12-30 16:09:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3532 states. [2018-12-30 16:09:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 5038 transitions. [2018-12-30 16:09:36,553 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 5038 transitions. Word has length 286 [2018-12-30 16:09:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:36,553 INFO L480 AbstractCegarLoop]: Abstraction has 3532 states and 5038 transitions. [2018-12-30 16:09:36,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 5038 transitions. [2018-12-30 16:09:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-30 16:09:36,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:36,558 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:36,558 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:36,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:36,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1447081289, now seen corresponding path program 1 times [2018-12-30 16:09:36,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:36,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:36,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:36,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:36,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-12-30 16:09:36,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:36,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:36,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:36,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:36,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:36,690 INFO L87 Difference]: Start difference. First operand 3532 states and 5038 transitions. Second operand 3 states. [2018-12-30 16:09:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:37,890 INFO L93 Difference]: Finished difference Result 7615 states and 10879 transitions. [2018-12-30 16:09:37,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:37,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-12-30 16:09:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:37,901 INFO L225 Difference]: With dead ends: 7615 [2018-12-30 16:09:37,901 INFO L226 Difference]: Without dead ends: 4090 [2018-12-30 16:09:37,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:37,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2018-12-30 16:09:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 4090. [2018-12-30 16:09:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4090 states. [2018-12-30 16:09:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4090 states to 4090 states and 5830 transitions. [2018-12-30 16:09:38,018 INFO L78 Accepts]: Start accepts. Automaton has 4090 states and 5830 transitions. Word has length 286 [2018-12-30 16:09:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:38,019 INFO L480 AbstractCegarLoop]: Abstraction has 4090 states and 5830 transitions. [2018-12-30 16:09:38,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4090 states and 5830 transitions. [2018-12-30 16:09:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-30 16:09:38,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:38,024 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:38,024 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:38,024 INFO L82 PathProgramCache]: Analyzing trace with hash 874720629, now seen corresponding path program 1 times [2018-12-30 16:09:38,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:38,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:38,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:38,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:38,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2018-12-30 16:09:38,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:38,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:38,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:38,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:38,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:38,147 INFO L87 Difference]: Start difference. First operand 4090 states and 5830 transitions. Second operand 3 states. [2018-12-30 16:09:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:39,243 INFO L93 Difference]: Finished difference Result 8733 states and 12465 transitions. [2018-12-30 16:09:39,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:39,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-12-30 16:09:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:39,255 INFO L225 Difference]: With dead ends: 8733 [2018-12-30 16:09:39,255 INFO L226 Difference]: Without dead ends: 4650 [2018-12-30 16:09:39,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2018-12-30 16:09:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4650. [2018-12-30 16:09:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4650 states. [2018-12-30 16:09:39,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4650 states to 4650 states and 6624 transitions. [2018-12-30 16:09:39,437 INFO L78 Accepts]: Start accepts. Automaton has 4650 states and 6624 transitions. Word has length 286 [2018-12-30 16:09:39,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:39,437 INFO L480 AbstractCegarLoop]: Abstraction has 4650 states and 6624 transitions. [2018-12-30 16:09:39,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:39,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4650 states and 6624 transitions. [2018-12-30 16:09:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-12-30 16:09:39,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:39,446 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:39,447 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:39,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1635721041, now seen corresponding path program 1 times [2018-12-30 16:09:39,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:39,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:39,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 842 proven. 0 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2018-12-30 16:09:39,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:39,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:39,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:39,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:39,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:39,747 INFO L87 Difference]: Start difference. First operand 4650 states and 6624 transitions. Second operand 3 states. [2018-12-30 16:09:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:39,958 INFO L93 Difference]: Finished difference Result 12648 states and 17917 transitions. [2018-12-30 16:09:39,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:39,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 434 [2018-12-30 16:09:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:39,972 INFO L225 Difference]: With dead ends: 12648 [2018-12-30 16:09:39,972 INFO L226 Difference]: Without dead ends: 8005 [2018-12-30 16:09:39,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8005 states. [2018-12-30 16:09:40,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8005 to 8003. [2018-12-30 16:09:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2018-12-30 16:09:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 11284 transitions. [2018-12-30 16:09:40,273 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 11284 transitions. Word has length 434 [2018-12-30 16:09:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:40,274 INFO L480 AbstractCegarLoop]: Abstraction has 8003 states and 11284 transitions. [2018-12-30 16:09:40,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 11284 transitions. [2018-12-30 16:09:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2018-12-30 16:09:40,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:40,288 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:40,289 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash -7772346, now seen corresponding path program 1 times [2018-12-30 16:09:40,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:40,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:40,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:40,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:40,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3069 backedges. 1596 proven. 26 refuted. 0 times theorem prover too weak. 1447 trivial. 0 not checked. [2018-12-30 16:09:40,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:09:40,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:09:40,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:40,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:09:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3069 backedges. 1437 proven. 0 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2018-12-30 16:09:41,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:09:41,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 16:09:41,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:09:41,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:09:41,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:09:41,163 INFO L87 Difference]: Start difference. First operand 8003 states and 11284 transitions. Second operand 5 states. [2018-12-30 16:09:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:42,464 INFO L93 Difference]: Finished difference Result 18691 states and 26495 transitions. [2018-12-30 16:09:42,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 16:09:42,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 533 [2018-12-30 16:09:42,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:42,485 INFO L225 Difference]: With dead ends: 18691 [2018-12-30 16:09:42,485 INFO L226 Difference]: Without dead ends: 9729 [2018-12-30 16:09:42,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-30 16:09:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9729 states. [2018-12-30 16:09:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9729 to 7703. [2018-12-30 16:09:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7703 states. [2018-12-30 16:09:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7703 states to 7703 states and 10675 transitions. [2018-12-30 16:09:42,854 INFO L78 Accepts]: Start accepts. Automaton has 7703 states and 10675 transitions. Word has length 533 [2018-12-30 16:09:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:42,855 INFO L480 AbstractCegarLoop]: Abstraction has 7703 states and 10675 transitions. [2018-12-30 16:09:42,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:09:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 7703 states and 10675 transitions. [2018-12-30 16:09:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2018-12-30 16:09:42,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:42,866 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:42,866 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:42,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:42,867 INFO L82 PathProgramCache]: Analyzing trace with hash 907719866, now seen corresponding path program 1 times [2018-12-30 16:09:42,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:42,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:42,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:42,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:42,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3735 backedges. 2120 proven. 0 refuted. 0 times theorem prover too weak. 1615 trivial. 0 not checked. [2018-12-30 16:09:43,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:43,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:43,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:43,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:43,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:43,086 INFO L87 Difference]: Start difference. First operand 7703 states and 10675 transitions. Second operand 3 states. [2018-12-30 16:09:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:43,768 INFO L93 Difference]: Finished difference Result 15559 states and 21531 transitions. [2018-12-30 16:09:43,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:43,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 564 [2018-12-30 16:09:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:43,781 INFO L225 Difference]: With dead ends: 15559 [2018-12-30 16:09:43,782 INFO L226 Difference]: Without dead ends: 7863 [2018-12-30 16:09:43,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7863 states. [2018-12-30 16:09:44,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7863 to 7703. [2018-12-30 16:09:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7703 states. [2018-12-30 16:09:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7703 states to 7703 states and 10535 transitions. [2018-12-30 16:09:44,259 INFO L78 Accepts]: Start accepts. Automaton has 7703 states and 10535 transitions. Word has length 564 [2018-12-30 16:09:44,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:44,259 INFO L480 AbstractCegarLoop]: Abstraction has 7703 states and 10535 transitions. [2018-12-30 16:09:44,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:44,260 INFO L276 IsEmpty]: Start isEmpty. Operand 7703 states and 10535 transitions. [2018-12-30 16:09:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2018-12-30 16:09:44,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:44,277 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 18, 18, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:44,277 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash 264667892, now seen corresponding path program 1 times [2018-12-30 16:09:44,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:44,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:44,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:44,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:44,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3853 backedges. 2121 proven. 0 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2018-12-30 16:09:44,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:44,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:44,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:44,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:44,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:44,542 INFO L87 Difference]: Start difference. First operand 7703 states and 10535 transitions. Second operand 3 states. [2018-12-30 16:09:45,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:45,365 INFO L93 Difference]: Finished difference Result 15588 states and 21276 transitions. [2018-12-30 16:09:45,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:45,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 578 [2018-12-30 16:09:45,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:45,377 INFO L225 Difference]: With dead ends: 15588 [2018-12-30 16:09:45,377 INFO L226 Difference]: Without dead ends: 7892 [2018-12-30 16:09:45,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2018-12-30 16:09:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7703. [2018-12-30 16:09:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7703 states. [2018-12-30 16:09:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7703 states to 7703 states and 10429 transitions. [2018-12-30 16:09:45,705 INFO L78 Accepts]: Start accepts. Automaton has 7703 states and 10429 transitions. Word has length 578 [2018-12-30 16:09:45,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:45,705 INFO L480 AbstractCegarLoop]: Abstraction has 7703 states and 10429 transitions. [2018-12-30 16:09:45,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 7703 states and 10429 transitions. [2018-12-30 16:09:45,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-12-30 16:09:45,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:45,725 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:45,725 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:45,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:45,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1121952208, now seen corresponding path program 1 times [2018-12-30 16:09:45,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:45,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:45,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:45,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:45,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4327 backedges. 2362 proven. 0 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked. [2018-12-30 16:09:46,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:46,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:46,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:46,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:46,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:46,154 INFO L87 Difference]: Start difference. First operand 7703 states and 10429 transitions. Second operand 3 states. [2018-12-30 16:09:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:46,583 INFO L93 Difference]: Finished difference Result 15511 states and 20973 transitions. [2018-12-30 16:09:46,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:46,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 618 [2018-12-30 16:09:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:46,592 INFO L225 Difference]: With dead ends: 15511 [2018-12-30 16:09:46,592 INFO L226 Difference]: Without dead ends: 7815 [2018-12-30 16:09:46,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7815 states. [2018-12-30 16:09:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7815 to 7703. [2018-12-30 16:09:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7703 states. [2018-12-30 16:09:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7703 states to 7703 states and 10401 transitions. [2018-12-30 16:09:46,813 INFO L78 Accepts]: Start accepts. Automaton has 7703 states and 10401 transitions. Word has length 618 [2018-12-30 16:09:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:46,814 INFO L480 AbstractCegarLoop]: Abstraction has 7703 states and 10401 transitions. [2018-12-30 16:09:46,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 7703 states and 10401 transitions. [2018-12-30 16:09:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2018-12-30 16:09:46,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:46,827 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 20, 20, 20, 18, 18, 16, 16, 14, 14, 12, 12, 12, 12, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:46,827 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:46,827 INFO L82 PathProgramCache]: Analyzing trace with hash -555578645, now seen corresponding path program 1 times [2018-12-30 16:09:46,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:46,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:46,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4706 backedges. 2741 proven. 0 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked. [2018-12-30 16:09:47,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:47,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:47,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:47,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:47,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:47,174 INFO L87 Difference]: Start difference. First operand 7703 states and 10401 transitions. Second operand 3 states. [2018-12-30 16:09:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:47,430 INFO L93 Difference]: Finished difference Result 11393 states and 15371 transitions. [2018-12-30 16:09:47,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:47,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 647 [2018-12-30 16:09:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:47,438 INFO L225 Difference]: With dead ends: 11393 [2018-12-30 16:09:47,438 INFO L226 Difference]: Without dead ends: 7749 [2018-12-30 16:09:47,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7749 states. [2018-12-30 16:09:47,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7749 to 7749. [2018-12-30 16:09:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7749 states. [2018-12-30 16:09:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7749 states to 7749 states and 10452 transitions. [2018-12-30 16:09:47,658 INFO L78 Accepts]: Start accepts. Automaton has 7749 states and 10452 transitions. Word has length 647 [2018-12-30 16:09:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:47,659 INFO L480 AbstractCegarLoop]: Abstraction has 7749 states and 10452 transitions. [2018-12-30 16:09:47,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 7749 states and 10452 transitions. [2018-12-30 16:09:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-12-30 16:09:47,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:47,670 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 20, 20, 20, 18, 18, 16, 16, 14, 14, 12, 12, 12, 12, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:47,671 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:47,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:47,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1827923157, now seen corresponding path program 1 times [2018-12-30 16:09:47,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:47,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:47,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4706 backedges. 2739 proven. 0 refuted. 0 times theorem prover too weak. 1967 trivial. 0 not checked. [2018-12-30 16:09:47,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:47,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:47,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:47,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:47,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:47,968 INFO L87 Difference]: Start difference. First operand 7749 states and 10452 transitions. Second operand 3 states. [2018-12-30 16:09:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:48,378 INFO L93 Difference]: Finished difference Result 11485 states and 15473 transitions. [2018-12-30 16:09:48,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:48,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 648 [2018-12-30 16:09:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:48,384 INFO L225 Difference]: With dead ends: 11485 [2018-12-30 16:09:48,384 INFO L226 Difference]: Without dead ends: 7795 [2018-12-30 16:09:48,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7795 states. [2018-12-30 16:09:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7795 to 7795. [2018-12-30 16:09:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7795 states. [2018-12-30 16:09:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7795 states to 7795 states and 10503 transitions. [2018-12-30 16:09:48,590 INFO L78 Accepts]: Start accepts. Automaton has 7795 states and 10503 transitions. Word has length 648 [2018-12-30 16:09:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:48,590 INFO L480 AbstractCegarLoop]: Abstraction has 7795 states and 10503 transitions. [2018-12-30 16:09:48,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:48,590 INFO L276 IsEmpty]: Start isEmpty. Operand 7795 states and 10503 transitions. [2018-12-30 16:09:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2018-12-30 16:09:48,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:48,603 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 33, 33, 31, 31, 31, 28, 28, 25, 25, 22, 22, 19, 19, 19, 19, 16, 13, 13, 10, 10, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:48,603 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:48,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:48,603 INFO L82 PathProgramCache]: Analyzing trace with hash -760233511, now seen corresponding path program 1 times [2018-12-30 16:09:48,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:48,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:48,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:48,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:48,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 11676 backedges. 5840 proven. 0 refuted. 0 times theorem prover too weak. 5836 trivial. 0 not checked. [2018-12-30 16:09:49,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:49,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:49,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:49,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:49,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:49,326 INFO L87 Difference]: Start difference. First operand 7795 states and 10503 transitions. Second operand 3 states. [2018-12-30 16:09:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:49,721 INFO L93 Difference]: Finished difference Result 15833 states and 21340 transitions. [2018-12-30 16:09:49,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:49,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1009 [2018-12-30 16:09:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:49,729 INFO L225 Difference]: With dead ends: 15833 [2018-12-30 16:09:49,730 INFO L226 Difference]: Without dead ends: 7991 [2018-12-30 16:09:49,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states. [2018-12-30 16:09:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 7921. [2018-12-30 16:09:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7921 states. [2018-12-30 16:09:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 10614 transitions. [2018-12-30 16:09:49,959 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 10614 transitions. Word has length 1009 [2018-12-30 16:09:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:49,960 INFO L480 AbstractCegarLoop]: Abstraction has 7921 states and 10614 transitions. [2018-12-30 16:09:49,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 10614 transitions. [2018-12-30 16:09:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2018-12-30 16:09:49,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:49,973 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 34, 34, 34, 34, 34, 34, 31, 31, 31, 28, 28, 25, 25, 22, 22, 19, 19, 19, 19, 16, 13, 13, 10, 10, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-12-30 16:09:49,973 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:49,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1252321953, now seen corresponding path program 1 times [2018-12-30 16:09:49,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:49,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:49,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:49,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:49,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12163 backedges. 5892 proven. 0 refuted. 0 times theorem prover too weak. 6271 trivial. 0 not checked. [2018-12-30 16:09:50,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:50,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:50,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:50,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:50,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:50,857 INFO L87 Difference]: Start difference. First operand 7921 states and 10614 transitions. Second operand 3 states. [2018-12-30 16:09:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:51,198 INFO L93 Difference]: Finished difference Result 15015 states and 20100 transitions. [2018-12-30 16:09:51,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:51,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1039 [2018-12-30 16:09:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:51,199 INFO L225 Difference]: With dead ends: 15015 [2018-12-30 16:09:51,199 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:09:51,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:09:51,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:09:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:09:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:09:51,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1039 [2018-12-30 16:09:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:51,206 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:09:51,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:09:51,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:09:51,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:09:51,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,365 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 123 [2018-12-30 16:09:51,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,595 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 153 [2018-12-30 16:09:51,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:51,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,908 WARN L181 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 645 DAG size of output: 133 [2018-12-30 16:09:52,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:52,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,591 WARN L181 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 252 [2018-12-30 16:09:53,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:53,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,233 WARN L181 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 645 DAG size of output: 133 [2018-12-30 16:09:54,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:54,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:55,396 WARN L181 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 63 [2018-12-30 16:09:55,938 WARN L181 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2018-12-30 16:09:56,539 WARN L181 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 59 [2018-12-30 16:09:57,524 WARN L181 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 65 [2018-12-30 16:09:58,183 WARN L181 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 57 [2018-12-30 16:09:59,013 WARN L181 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2018-12-30 16:09:59,694 WARN L181 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 38 [2018-12-30 16:10:00,422 WARN L181 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 57 [2018-12-30 16:10:00,990 WARN L181 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 59 [2018-12-30 16:10:01,537 WARN L181 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 94 [2018-12-30 16:10:01,912 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 44 [2018-12-30 16:10:02,555 WARN L181 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 56 [2018-12-30 16:10:02,996 WARN L181 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 31 [2018-12-30 16:10:03,513 WARN L181 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2018-12-30 16:10:07,886 WARN L181 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 251 DAG size of output: 102 [2018-12-30 16:10:08,736 WARN L181 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 57 [2018-12-30 16:10:09,240 WARN L181 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 59 [2018-12-30 16:10:09,617 WARN L181 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 44 [2018-12-30 16:10:10,231 WARN L181 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2018-12-30 16:10:10,909 WARN L181 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 56 [2018-12-30 16:10:11,528 WARN L181 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 56 [2018-12-30 16:10:12,087 WARN L181 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 39 [2018-12-30 16:10:12,095 INFO L448 ceAbstractionStarter]: For program point L564(lines 564 574) no Hoare annotation was computed. [2018-12-30 16:10:12,095 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 374) no Hoare annotation was computed. [2018-12-30 16:10:12,095 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 606) no Hoare annotation was computed. [2018-12-30 16:10:12,095 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 617) no Hoare annotation was computed. [2018-12-30 16:10:12,095 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 628) no Hoare annotation was computed. [2018-12-30 16:10:12,097 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 639) no Hoare annotation was computed. [2018-12-30 16:10:12,098 INFO L448 ceAbstractionStarter]: For program point L664(lines 664 666) no Hoare annotation was computed. [2018-12-30 16:10:12,098 INFO L448 ceAbstractionStarter]: For program point L664-2(lines 664 666) no Hoare annotation was computed. [2018-12-30 16:10:12,098 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 513) no Hoare annotation was computed. [2018-12-30 16:10:12,098 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 607) the Hoare annotation is: (let ((.cse0 (and (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)))) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 11)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5)) .cse1) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse1) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse0 .cse1))) [2018-12-30 16:10:12,102 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 639) the Hoare annotation is: (let ((.cse0 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)))) [2018-12-30 16:10:12,102 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 668) no Hoare annotation was computed. [2018-12-30 16:10:12,103 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 547) no Hoare annotation was computed. [2018-12-30 16:10:12,103 INFO L448 ceAbstractionStarter]: For program point L567(lines 567 573) no Hoare annotation was computed. [2018-12-30 16:10:12,103 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 435 443) no Hoare annotation was computed. [2018-12-30 16:10:12,103 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 373) no Hoare annotation was computed. [2018-12-30 16:10:12,103 INFO L448 ceAbstractionStarter]: For program point L336-1(lines 336 373) no Hoare annotation was computed. [2018-12-30 16:10:12,103 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 605) no Hoare annotation was computed. [2018-12-30 16:10:12,103 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 616) no Hoare annotation was computed. [2018-12-30 16:10:12,103 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 627) no Hoare annotation was computed. [2018-12-30 16:10:12,103 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 638) no Hoare annotation was computed. [2018-12-30 16:10:12,103 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 512) no Hoare annotation was computed. [2018-12-30 16:10:12,104 INFO L444 ceAbstractionStarter]: At program point L403(lines 394 415) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12 .cse13) .cse3) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse13))) [2018-12-30 16:10:12,104 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 370) no Hoare annotation was computed. [2018-12-30 16:10:12,104 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 314) no Hoare annotation was computed. [2018-12-30 16:10:12,104 INFO L448 ceAbstractionStarter]: For program point L304-2(lines 304 314) no Hoare annotation was computed. [2018-12-30 16:10:12,104 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 605) the Hoare annotation is: (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) [2018-12-30 16:10:12,104 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 617) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse2 (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse2)) (and .cse0 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse1) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse0 .cse2 .cse1) (and .cse0 .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6)) (and .cse0 .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)))) [2018-12-30 16:10:12,104 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 628) the Hoare annotation is: (let ((.cse2 (and (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (let ((.cse0 (and .cse2 .cse3)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse1) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse0 .cse1) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse2 .cse3) .cse1) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6))))) [2018-12-30 16:10:12,104 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 546) no Hoare annotation was computed. [2018-12-30 16:10:12,104 INFO L451 ceAbstractionStarter]: At program point L669(lines 11 671) the Hoare annotation is: true [2018-12-30 16:10:12,105 INFO L444 ceAbstractionStarter]: At program point L603(lines 99 658) the Hoare annotation is: (let ((.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 .cse1 (and (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 11)) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656) .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 10)) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) (and (and (= 12 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2018-12-30 16:10:12,108 INFO L448 ceAbstractionStarter]: For program point L570(lines 570 572) no Hoare annotation was computed. [2018-12-30 16:10:12,108 INFO L448 ceAbstractionStarter]: For program point L570-2(lines 208 602) no Hoare annotation was computed. [2018-12-30 16:10:12,108 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 441) no Hoare annotation was computed. [2018-12-30 16:10:12,108 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 605) the Hoare annotation is: (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) [2018-12-30 16:10:12,108 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 615) no Hoare annotation was computed. [2018-12-30 16:10:12,108 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 626) no Hoare annotation was computed. [2018-12-30 16:10:12,108 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 637) no Hoare annotation was computed. [2018-12-30 16:10:12,108 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 511) no Hoare annotation was computed. [2018-12-30 16:10:12,108 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2018-12-30 16:10:12,108 INFO L448 ceAbstractionStarter]: For program point L505-2(lines 208 602) no Hoare annotation was computed. [2018-12-30 16:10:12,108 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 408) no Hoare annotation was computed. [2018-12-30 16:10:12,108 INFO L448 ceAbstractionStarter]: For program point L472-2(lines 208 602) no Hoare annotation was computed. [2018-12-30 16:10:12,109 INFO L448 ceAbstractionStarter]: For program point L406-2(lines 402 415) no Hoare annotation was computed. [2018-12-30 16:10:12,109 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2018-12-30 16:10:12,109 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 602) no Hoare annotation was computed. [2018-12-30 16:10:12,109 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 545) no Hoare annotation was computed. [2018-12-30 16:10:12,109 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2018-12-30 16:10:12,109 INFO L448 ceAbstractionStarter]: For program point L308-2(lines 306 314) no Hoare annotation was computed. [2018-12-30 16:10:12,109 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 368) no Hoare annotation was computed. [2018-12-30 16:10:12,109 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2018-12-30 16:10:12,109 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 614) no Hoare annotation was computed. [2018-12-30 16:10:12,109 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 625) no Hoare annotation was computed. [2018-12-30 16:10:12,109 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 636) no Hoare annotation was computed. [2018-12-30 16:10:12,113 INFO L448 ceAbstractionStarter]: For program point L640(lines 640 656) no Hoare annotation was computed. [2018-12-30 16:10:12,113 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 510) no Hoare annotation was computed. [2018-12-30 16:10:12,113 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2018-12-30 16:10:12,113 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 638) the Hoare annotation is: (let ((.cse7 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse25 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse26 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse27 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (let ((.cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8)) (.cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6)) (.cse28 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15 .cse3 .cse16 .cse4 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27)) (.cse30 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15 .cse3 .cse16 .cse4 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5)) (and .cse28 .cse29) (and .cse5 .cse29) (and .cse29 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse30) (and .cse29 .cse30)))) [2018-12-30 16:10:12,114 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 615) the Hoare annotation is: (let ((.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse1 (and .cse3 .cse4 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse17 .cse18 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse19 .cse11 .cse20 .cse12 .cse21 .cse22 .cse13 .cse14 .cse15 .cse16)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9))))) [2018-12-30 16:10:12,114 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 626) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse13) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse13))) [2018-12-30 16:10:12,114 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 655) no Hoare annotation was computed. [2018-12-30 16:10:12,114 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 544) no Hoare annotation was computed. [2018-12-30 16:10:12,114 INFO L444 ceAbstractionStarter]: At program point L509(lines 72 670) the Hoare annotation is: false [2018-12-30 16:10:12,114 INFO L448 ceAbstractionStarter]: For program point L542-2(lines 208 602) no Hoare annotation was computed. [2018-12-30 16:10:12,114 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 647) no Hoare annotation was computed. [2018-12-30 16:10:12,114 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 641 655) no Hoare annotation was computed. [2018-12-30 16:10:12,114 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2018-12-30 16:10:12,117 INFO L448 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2018-12-30 16:10:12,117 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 613) no Hoare annotation was computed. [2018-12-30 16:10:12,117 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 624) no Hoare annotation was computed. [2018-12-30 16:10:12,117 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 635) no Hoare annotation was computed. [2018-12-30 16:10:12,117 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2018-12-30 16:10:12,117 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 646) no Hoare annotation was computed. [2018-12-30 16:10:12,117 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2018-12-30 16:10:12,117 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 612) no Hoare annotation was computed. [2018-12-30 16:10:12,117 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 623) no Hoare annotation was computed. [2018-12-30 16:10:12,118 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2018-12-30 16:10:12,118 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 634) no Hoare annotation was computed. [2018-12-30 16:10:12,118 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 584) no Hoare annotation was computed. [2018-12-30 16:10:12,118 INFO L448 ceAbstractionStarter]: For program point L580-2(lines 580 584) no Hoare annotation was computed. [2018-12-30 16:10:12,118 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 417) no Hoare annotation was computed. [2018-12-30 16:10:12,118 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 613) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) (or (and .cse0 .cse1 (and .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5))) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse2) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse1 .cse2))) [2018-12-30 16:10:12,119 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 624) the Hoare annotation is: (let ((.cse0 (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (let ((.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (and .cse0 .cse1))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse0 .cse1) .cse2) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse2 .cse3) (and .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse3) (and .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse2 .cse3)))) [2018-12-30 16:10:12,121 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2018-12-30 16:10:12,121 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2018-12-30 16:10:12,121 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2018-12-30 16:10:12,121 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 389) no Hoare annotation was computed. [2018-12-30 16:10:12,121 INFO L448 ceAbstractionStarter]: For program point L449-2(lines 208 602) no Hoare annotation was computed. [2018-12-30 16:10:12,121 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:10:12,121 INFO L451 ceAbstractionStarter]: At program point L681(lines 672 683) the Hoare annotation is: true [2018-12-30 16:10:12,121 INFO L448 ceAbstractionStarter]: For program point $Ultimate##90(lines 208 604) no Hoare annotation was computed. [2018-12-30 16:10:12,121 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 611) no Hoare annotation was computed. [2018-12-30 16:10:12,121 INFO L448 ceAbstractionStarter]: For program point $Ultimate##91(lines 208 604) no Hoare annotation was computed. [2018-12-30 16:10:12,122 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 622) no Hoare annotation was computed. [2018-12-30 16:10:12,122 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 633) no Hoare annotation was computed. [2018-12-30 16:10:12,122 INFO L448 ceAbstractionStarter]: For program point L649(lines 649 653) no Hoare annotation was computed. [2018-12-30 16:10:12,122 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 486) no Hoare annotation was computed. [2018-12-30 16:10:12,122 INFO L448 ceAbstractionStarter]: For program point L484-2(lines 208 602) no Hoare annotation was computed. [2018-12-30 16:10:12,122 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 634) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse13))) [2018-12-30 16:10:12,122 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 522) no Hoare annotation was computed. [2018-12-30 16:10:12,122 INFO L448 ceAbstractionStarter]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2018-12-30 16:10:12,122 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 364) no Hoare annotation was computed. [2018-12-30 16:10:12,123 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2018-12-30 16:10:12,123 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-12-30 16:10:12,123 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 208 602) no Hoare annotation was computed. [2018-12-30 16:10:12,123 INFO L444 ceAbstractionStarter]: At program point L354(lines 330 375) the Hoare annotation is: (let ((.cse0 (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (let ((.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (and .cse0 .cse1))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse0 .cse1) .cse2) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse2 .cse3) (and .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse3) (and .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse2 .cse3)))) [2018-12-30 16:10:12,123 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 610) no Hoare annotation was computed. [2018-12-30 16:10:12,123 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 621) no Hoare annotation was computed. [2018-12-30 16:10:12,123 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 632) no Hoare annotation was computed. [2018-12-30 16:10:12,123 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2018-12-30 16:10:12,123 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 670) no Hoare annotation was computed. [2018-12-30 16:10:12,124 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 556) no Hoare annotation was computed. [2018-12-30 16:10:12,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:10:12,127 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 611) the Hoare annotation is: (let ((.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (let ((.cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse10 .cse19 .cse11 .cse20 .cse12 .cse21 .cse22 .cse13 .cse14 .cse15 .cse16)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse2) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse1 .cse2) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) .cse1 .cse2) (and .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6))))) [2018-12-30 16:10:12,127 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 622) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12 .cse13) .cse3) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse13))) [2018-12-30 16:10:12,128 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 632) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse12 .cse13 .cse14))) [2018-12-30 16:10:12,128 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-12-30 16:10:12,128 INFO L448 ceAbstractionStarter]: For program point L455(lines 455 467) no Hoare annotation was computed. [2018-12-30 16:10:12,128 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2018-12-30 16:10:12,128 INFO L448 ceAbstractionStarter]: For program point L356-2(lines 353 362) no Hoare annotation was computed. [2018-12-30 16:10:12,128 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2018-12-30 16:10:12,128 INFO L448 ceAbstractionStarter]: For program point L324-2(lines 208 602) no Hoare annotation was computed. [2018-12-30 16:10:12,128 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 609) no Hoare annotation was computed. [2018-12-30 16:10:12,128 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 620) no Hoare annotation was computed. [2018-12-30 16:10:12,129 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 631) no Hoare annotation was computed. [2018-12-30 16:10:12,132 INFO L444 ceAbstractionStarter]: At program point L391(lines 382 417) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12 .cse13) .cse3) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse13))) [2018-12-30 16:10:12,132 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-12-30 16:10:12,132 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-12-30 16:10:12,132 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 602) no Hoare annotation was computed. [2018-12-30 16:10:12,132 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:10:12,132 INFO L448 ceAbstractionStarter]: For program point L590(lines 590 596) no Hoare annotation was computed. [2018-12-30 16:10:12,132 INFO L448 ceAbstractionStarter]: For program point L590-1(lines 590 596) no Hoare annotation was computed. [2018-12-30 16:10:12,132 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2018-12-30 16:10:12,133 INFO L448 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2018-12-30 16:10:12,133 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 461) no Hoare annotation was computed. [2018-12-30 16:10:12,133 INFO L448 ceAbstractionStarter]: For program point L459-2(lines 457 467) no Hoare annotation was computed. [2018-12-30 16:10:12,133 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2018-12-30 16:10:12,133 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 608) no Hoare annotation was computed. [2018-12-30 16:10:12,133 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 619) no Hoare annotation was computed. [2018-12-30 16:10:12,133 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 630) no Hoare annotation was computed. [2018-12-30 16:10:12,133 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2018-12-30 16:10:12,133 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 415) no Hoare annotation was computed. [2018-12-30 16:10:12,133 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 609) the Hoare annotation is: (let ((.cse3 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (and (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)))) (.cse2 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse1 .cse2)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse1 .cse2) (and .cse2 .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656) (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 10)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9))))) [2018-12-30 16:10:12,134 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 620) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2018-12-30 16:10:12,134 INFO L451 ceAbstractionStarter]: At program point L659(lines 98 660) the Hoare annotation is: true [2018-12-30 16:10:12,134 INFO L448 ceAbstractionStarter]: For program point L593(lines 593 595) no Hoare annotation was computed. [2018-12-30 16:10:12,134 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 401) no Hoare annotation was computed. [2018-12-30 16:10:12,134 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 575) no Hoare annotation was computed. [2018-12-30 16:10:12,134 INFO L448 ceAbstractionStarter]: For program point L528(lines 528 531) no Hoare annotation was computed. [2018-12-30 16:10:12,134 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 607) no Hoare annotation was computed. [2018-12-30 16:10:12,134 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 618) no Hoare annotation was computed. [2018-12-30 16:10:12,134 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 629) no Hoare annotation was computed. [2018-12-30 16:10:12,134 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 658) the Hoare annotation is: (let ((.cse1 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 .cse1 (and (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 11)) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656) .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 10)) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) (and (and (= 12 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2018-12-30 16:10:12,135 INFO L448 ceAbstractionStarter]: For program point L496(lines 496 514) no Hoare annotation was computed. [2018-12-30 16:10:12,135 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2018-12-30 16:10:12,135 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 618) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9)) (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)) (= ULTIMATE.start_ssl3_accept_~s__hit~0 0) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2018-12-30 16:10:12,135 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 631) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 9) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 8) .cse13 .cse14 .cse15) (and (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 5) .cse15) .cse2))) [2018-12-30 16:10:12,135 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 16:10:12,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:10:12 BoogieIcfgContainer [2018-12-30 16:10:12,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:10:12,274 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:10:12,274 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:10:12,274 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:10:12,275 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:09:11" (3/4) ... [2018-12-30 16:10:12,280 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:10:12,314 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 16:10:12,315 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:10:12,481 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:10:12,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:10:12,482 INFO L168 Benchmark]: Toolchain (without parser) took 62803.26 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 952.7 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 874.3 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:12,482 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:10:12,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.90 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:12,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 195.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:12,483 INFO L168 Benchmark]: Boogie Preprocessor took 62.73 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. [2018-12-30 16:10:12,483 INFO L168 Benchmark]: RCFGBuilder took 1507.09 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: 67.9 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:12,488 INFO L168 Benchmark]: TraceAbstraction took 60365.00 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -970.7 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-30 16:10:12,489 INFO L168 Benchmark]: Witness Printer took 206.99 ms. Allocated memory is still 3.0 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:10:12,493 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 460.90 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 195.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.73 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 1507.09 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: 67.9 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60365.00 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -970.7 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 206.99 ms. Allocated memory is still 3.0 GB. Free memory is still 2.0 GB. 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: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 9) && s__state <= 8576) || ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && blastFlag == 6) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && blastFlag == 8) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag <= 5) && s__state <= 8576) && 8448 <= s__state) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((8448 <= s__state && s__state <= 8448) && blastFlag == 8) || ((8448 <= s__state && s__state <= 8448) && blastFlag == 7)) || ((8448 <= s__state && s__state <= 8448) && blastFlag <= 5)) || ((8448 <= s__state && s__state <= 8448) && blastFlag == 6)) || ((8448 <= s__state && s__state <= 8448) && blastFlag == 9)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__hit == 0) && !(8576 == s__state)) && s__s3__tmp__next_state___0 <= 3) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 5 && ((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 8448 <= s__state) || ((blastFlag == 7 && 8448 <= s__state) && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576)) || ((8448 <= s__state && blastFlag == 6) && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576)) || ((8448 <= s__state && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && blastFlag == 9)) || ((blastFlag == 8 && 8448 <= s__state) && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag <= 5) && s__state <= 8576)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && blastFlag == 6) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 9) && s__state <= 8576)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && blastFlag == 8) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 9) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 6) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && 8448 <= s__state)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag <= 5) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 8) && s__state <= 8576) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8656) && blastFlag == 8) && 8448 <= s__state) || ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 7) && s__state <= 8656) && 8448 <= s__state)) || ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 9) && s__state <= 8656) && 8448 <= s__state)) || ((s__state <= 8656 && 8448 <= s__state) && (((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag <= 5)) || ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8656) && 8448 <= s__state) && blastFlag == 6) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((!(8657 == s__state) && !(12292 == s__state)) && !(8656 == s__state)) && blastFlag == 8) && 8656 <= s__state) || ((((s__state <= 8672 && (!(8657 == s__state) && !(12292 == s__state)) && !(8656 == s__state)) && s__hit == 0) && 8656 <= s__state) && blastFlag == 11)) || ((((!(8657 == s__state) && !(12292 == s__state)) && !(8656 == s__state)) && 8656 <= s__state) && blastFlag == 9)) || ((((!(8657 == s__state) && !(12292 == s__state)) && !(8656 == s__state)) && blastFlag <= 5) && 8656 <= s__state)) || ((((!(8657 == s__state) && !(12292 == s__state)) && !(8656 == s__state)) && blastFlag == 6) && 8656 <= s__state)) || ((blastFlag == 7 && (!(8657 == s__state) && !(12292 == s__state)) && !(8656 == s__state)) && 8656 <= s__state) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 9) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 6) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && 8448 <= s__state)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag <= 5) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 8) && s__state <= 8576) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 5 && ((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 8448 <= s__state) || ((blastFlag == 7 && 8448 <= s__state) && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576)) || ((8448 <= s__state && blastFlag == 6) && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576)) || ((8448 <= s__state && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && blastFlag == 9)) || ((blastFlag == 8 && 8448 <= s__state) && (((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((s__state <= 3 || ((((s__state <= 8672 && s__hit == 0) && 8656 <= s__state) && !(8657 == s__state) && !(8656 == s__state)) && blastFlag == 11)) || blastFlag == 7) || blastFlag == 8) || (((s__state <= 8656 && s__hit == 0) && 8656 <= s__state) && blastFlag == 10)) || blastFlag == 6) || blastFlag <= 5) || blastFlag == 9) || ((((12 == blastFlag && s__hit == 0) && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((s__state <= 8656 && 8448 <= s__state) && (((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag <= 5) || (((blastFlag == 7 && s__state <= 8656) && 8448 <= s__state) && ((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__state <= 8656 && 8448 <= s__state) && blastFlag == 6) && ((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__state <= 8656 && 8448 <= s__state) && ((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 9)) || (((s__state <= 8656 && blastFlag == 8) && 8448 <= s__state) && ((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8640 == s__state) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8544 == s__state)) && blastFlag == 6) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 8) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 9) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag <= 5) && s__state <= 8576) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag <= 5) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 8)) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 6)) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 9)) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 7) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((blastFlag == 7 && s__state <= 8656) && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) || ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8656 == s__state)) && s__state <= 8656) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag <= 5)) || (((s__state <= 8656 && blastFlag == 8) && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((s__state <= 8656 && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && blastFlag == 6)) || (((s__state <= 8656 && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8576 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8577 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && blastFlag == 9) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 8) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 6)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag <= 5)) || (blastFlag == 7 && ((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state))) || (blastFlag == 8 && ((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state))) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 6)) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 7)) || (((((!(8657 == s__state) && 8656 <= s__state) && !(8672 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 9)) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 9) - InvariantResult [Line: 672]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 9) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 6) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && 8448 <= s__state)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag <= 5) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 8) && s__state <= 8576) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 8448 <= s__state) && blastFlag == 9) || ((((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && blastFlag == 8) && 8448 <= s__state)) || ((blastFlag == 7 && (((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 8448 <= s__state)) || (((blastFlag <= 5 && ((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 8448 <= s__state)) || ((((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 8448 <= s__state) && blastFlag == 6) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((s__state <= 3 || ((((s__state <= 8672 && s__hit == 0) && 8656 <= s__state) && !(8657 == s__state) && !(8656 == s__state)) && blastFlag == 11)) || blastFlag == 7) || blastFlag == 8) || (((s__state <= 8656 && s__hit == 0) && 8656 <= s__state) && blastFlag == 10)) || blastFlag == 6) || blastFlag <= 5) || blastFlag == 9) || ((((12 == blastFlag && s__hit == 0) && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((s__state <= 8656 && 8448 <= s__state) && blastFlag <= 5 && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) || (((s__state <= 8656 && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && blastFlag == 8) && 8448 <= s__state)) || (((blastFlag == 7 && s__state <= 8656) && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((s__state <= 8656 && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && blastFlag == 6)) || (((s__state <= 8656 && ((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(12292 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && blastFlag == 9) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8640 == s__state) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && blastFlag <= 5) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && blastFlag == 9) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && blastFlag == 8) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && blastFlag == 6) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 8) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && blastFlag == 6) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && blastFlag == 7) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag <= 5) && s__state <= 8576)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 9) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && (blastFlag == 8 && (!(12292 == s__state) && !(8672 == s__state)) && !(8673 == s__state)) && 8656 <= s__state) || (((s__state <= 8672 && blastFlag == 6) && (!(12292 == s__state) && !(8672 == s__state)) && !(8673 == s__state)) && 8656 <= s__state)) || (((8656 <= s__state && !(8672 == s__state)) && s__state <= 8672) && blastFlag <= 5)) || (((s__state <= 8672 && blastFlag == 7) && (!(12292 == s__state) && !(8672 == s__state)) && !(8673 == s__state)) && 8656 <= s__state)) || (((s__state <= 8656 && s__hit == 0) && 8656 <= s__state) && blastFlag == 10)) || (((s__state <= 8672 && (!(12292 == s__state) && !(8672 == s__state)) && !(8673 == s__state)) && 8656 <= s__state) && blastFlag == 9) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 159 locations, 1 error locations. SAFE Result, 60.1s OverallTime, 43 OverallIterations, 36 TraceHistogramMax, 27.2s AutomataDifference, 0.0s DeadEndRemovalTime, 20.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 9374 SDtfs, 7699 SDslu, 4058 SDs, 0 SdLazy, 4350 SolverSat, 1694 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 839 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8003occurred in iteration=35, 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: 3.4s AutomataMinimizationTime, 43 MinimizatonAttempts, 5028 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 800 NumberOfFragments, 6678 HoareAnnotationTreeSize, 28 FomulaSimplifications, 621655 FormulaSimplificationTreeSizeReduction, 3.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 146347 FormulaSimplificationTreeSizeReductionInter, 17.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 11570 NumberOfCodeBlocks, 11570 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 11525 ConstructedInterpolants, 0 QuantifiedInterpolants, 6648076 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1193 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 45 InterpolantComputations, 43 PerfectInterpolantSequences, 61080/61132 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...