./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_4_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_4_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9636d7d6107e60711fab246dfc2abf2798468aa .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:09:08,058 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:09:08,060 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:09:08,073 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:09:08,074 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:09:08,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:09:08,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:09:08,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:09:08,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:09:08,087 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:09:08,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:09:08,090 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:09:08,091 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:09:08,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:09:08,100 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:09:08,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:09:08,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:09:08,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:09:08,113 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:09:08,115 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:09:08,117 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:09:08,118 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:09:08,122 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:09:08,122 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:09:08,122 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:09:08,123 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:09:08,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:09:08,127 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:09:08,128 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:09:08,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:09:08,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:09:08,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:09:08,131 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:09:08,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:09:08,134 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:09:08,135 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:09:08,135 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,162 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:09:08,163 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:09:08,164 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:09:08,164 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:09:08,164 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:09:08,164 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:09:08,165 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:09:08,165 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:09:08,166 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:09:08,166 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:09:08,166 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:09:08,166 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:09:08,166 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:09:08,166 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:09:08,166 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:09:08,167 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:09:08,167 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:09:08,167 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:09:08,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:09:08,167 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:09:08,167 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:09:08,169 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:09:08,169 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:09:08,169 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:09:08,169 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:09:08,170 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:09:08,170 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:09:08,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:09:08,170 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9636d7d6107e60711fab246dfc2abf2798468aa [2018-12-30 16:09:08,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:09:08,232 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:09:08,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:09:08,238 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:09:08,238 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:09:08,239 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_4_true-unreach-call_false-termination.cil.c [2018-12-30 16:09:08,301 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038a702e0/6a35ec5c5f314ab0bb407eb9038123c6/FLAGd184a745b [2018-12-30 16:09:08,788 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:09:08,788 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_4_true-unreach-call_false-termination.cil.c [2018-12-30 16:09:08,812 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038a702e0/6a35ec5c5f314ab0bb407eb9038123c6/FLAGd184a745b [2018-12-30 16:09:09,112 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038a702e0/6a35ec5c5f314ab0bb407eb9038123c6 [2018-12-30 16:09:09,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:09:09,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:09:09,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:09:09,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:09:09,122 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:09:09,123 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,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4129fb41 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,128 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,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:09:09,206 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:09:09,535 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:09:09,540 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:09:09,611 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:09:09,632 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:09:09,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09 WrapperNode [2018-12-30 16:09:09,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:09:09,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:09:09,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:09:09,634 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:09:09,645 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:09" (1/1) ... [2018-12-30 16:09:09,663 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:09" (1/1) ... [2018-12-30 16:09:09,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:09:09,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:09:09,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:09:09,844 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:09:09,855 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:09" (1/1) ... [2018-12-30 16:09:09,855 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:09" (1/1) ... [2018-12-30 16:09:09,859 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:09" (1/1) ... [2018-12-30 16:09:09,859 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:09" (1/1) ... [2018-12-30 16:09:09,868 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:09" (1/1) ... [2018-12-30 16:09:09,878 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:09" (1/1) ... [2018-12-30 16:09:09,881 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:09" (1/1) ... [2018-12-30 16:09:09,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:09:09,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:09:09,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:09:09,886 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:09:09,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (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:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:09:09,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:09:10,092 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:09:10,093 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:09:11,217 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:09:11,218 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:09:11,218 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,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:09:11,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:09:11,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:09:11,223 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:09:11,223 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,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e6ca16 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,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:09" (2/3) ... [2018-12-30 16:09:11,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e6ca16 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,225 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,227 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_4_true-unreach-call_false-termination.cil.c [2018-12-30 16:09:11,237 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:09:11,248 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:09:11,267 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:09:11,303 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:09:11,304 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:09:11,305 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:09:11,305 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:09:11,305 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:09:11,305 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:09:11,305 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:09:11,305 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:09:11,306 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:09:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-12-30 16:09:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-30 16:09:11,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:11,337 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:11,340 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:11,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2018-12-30 16:09:11,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:11,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:11,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:11,645 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:11,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:11,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:11,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:11,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:11,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:11,673 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2018-12-30 16:09:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:12,558 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2018-12-30 16:09:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:12,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-30 16:09:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:12,578 INFO L225 Difference]: With dead ends: 327 [2018-12-30 16:09:12,578 INFO L226 Difference]: Without dead ends: 174 [2018-12-30 16:09:12,583 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:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-30 16:09:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2018-12-30 16:09:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-30 16:09:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2018-12-30 16:09:12,641 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2018-12-30 16:09:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:12,642 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2018-12-30 16:09:12,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2018-12-30 16:09:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-30 16:09:12,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:12,645 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:12,645 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:12,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:12,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2018-12-30 16:09:12,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:12,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:12,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:12,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:12,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:12,756 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,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:12,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:12,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:12,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:12,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:12,760 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2018-12-30 16:09:13,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:13,221 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2018-12-30 16:09:13,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:13,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-30 16:09:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:13,226 INFO L225 Difference]: With dead ends: 379 [2018-12-30 16:09:13,226 INFO L226 Difference]: Without dead ends: 215 [2018-12-30 16:09:13,228 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,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-30 16:09:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2018-12-30 16:09:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-30 16:09:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2018-12-30 16:09:13,250 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2018-12-30 16:09:13,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:13,251 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2018-12-30 16:09:13,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2018-12-30 16:09:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-30 16:09:13,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:13,256 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,256 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash 25102818, now seen corresponding path program 1 times [2018-12-30 16:09:13,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:13,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:13,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:13,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:13,391 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:13,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:13,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:13,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:13,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:13,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:13,394 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2018-12-30 16:09:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:13,751 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2018-12-30 16:09:13,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:13,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-12-30 16:09:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:13,756 INFO L225 Difference]: With dead ends: 444 [2018-12-30 16:09:13,757 INFO L226 Difference]: Without dead ends: 241 [2018-12-30 16:09:13,759 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,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-12-30 16:09:13,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-12-30 16:09:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-30 16:09:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2018-12-30 16:09:13,779 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2018-12-30 16:09:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:13,779 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2018-12-30 16:09:13,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2018-12-30 16:09:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-30 16:09:13,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:13,785 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:13,785 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:13,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1824447496, now seen corresponding path program 1 times [2018-12-30 16:09:13,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:13,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:13,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:13,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:13,920 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:13,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:13,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:13,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:13,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:13,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:13,921 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2018-12-30 16:09:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:14,253 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2018-12-30 16:09:14,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:14,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-30 16:09:14,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:14,255 INFO L225 Difference]: With dead ends: 492 [2018-12-30 16:09:14,255 INFO L226 Difference]: Without dead ends: 258 [2018-12-30 16:09:14,257 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,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-30 16:09:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-12-30 16:09:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-30 16:09:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2018-12-30 16:09:14,277 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2018-12-30 16:09:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:14,278 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2018-12-30 16:09:14,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2018-12-30 16:09:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-30 16:09:14,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:14,282 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:14,282 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:14,283 INFO L82 PathProgramCache]: Analyzing trace with hash 471399807, now seen corresponding path program 1 times [2018-12-30 16:09:14,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:14,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:14,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:14,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:14,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:14,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:14,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:14,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:14,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:14,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:14,381 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2018-12-30 16:09:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:14,661 INFO L93 Difference]: Finished difference Result 552 states and 932 transitions. [2018-12-30 16:09:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:14,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-30 16:09:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:14,665 INFO L225 Difference]: With dead ends: 552 [2018-12-30 16:09:14,665 INFO L226 Difference]: Without dead ends: 303 [2018-12-30 16:09:14,666 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,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-30 16:09:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 298. [2018-12-30 16:09:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-30 16:09:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2018-12-30 16:09:14,684 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2018-12-30 16:09:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:14,684 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2018-12-30 16:09:14,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2018-12-30 16:09:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:09:14,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:14,687 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:14,687 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:14,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:14,688 INFO L82 PathProgramCache]: Analyzing trace with hash -455139068, now seen corresponding path program 1 times [2018-12-30 16:09:14,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:14,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:14,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:14,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:14,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:14,775 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:14,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:14,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:14,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:14,778 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2018-12-30 16:09:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:15,435 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2018-12-30 16:09:15,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:15,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:09:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:15,439 INFO L225 Difference]: With dead ends: 591 [2018-12-30 16:09:15,440 INFO L226 Difference]: Without dead ends: 300 [2018-12-30 16:09:15,441 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,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-30 16:09:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2018-12-30 16:09:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-30 16:09:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2018-12-30 16:09:15,457 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2018-12-30 16:09:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:15,458 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2018-12-30 16:09:15,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2018-12-30 16:09:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:09:15,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:15,461 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:15,461 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:15,462 INFO L82 PathProgramCache]: Analyzing trace with hash -190163418, now seen corresponding path program 1 times [2018-12-30 16:09:15,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:15,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:15,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:15,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:15,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:15,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:15,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:15,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:15,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:15,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:15,598 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2018-12-30 16:09:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:16,881 INFO L93 Difference]: Finished difference Result 594 states and 996 transitions. [2018-12-30 16:09:16,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:16,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:09:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:16,885 INFO L225 Difference]: With dead ends: 594 [2018-12-30 16:09:16,885 INFO L226 Difference]: Without dead ends: 301 [2018-12-30 16:09:16,886 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,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-30 16:09:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2018-12-30 16:09:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-30 16:09:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2018-12-30 16:09:16,897 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2018-12-30 16:09:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:16,898 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2018-12-30 16:09:16,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2018-12-30 16:09:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-30 16:09:16,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:16,899 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,900 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:16,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:16,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1935111195, now seen corresponding path program 1 times [2018-12-30 16:09:16,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:16,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:16,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:16,982 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,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:16,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:16,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:16,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:16,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:16,984 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2018-12-30 16:09:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:17,224 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2018-12-30 16:09:17,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:17,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-12-30 16:09:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:17,229 INFO L225 Difference]: With dead ends: 594 [2018-12-30 16:09:17,229 INFO L226 Difference]: Without dead ends: 305 [2018-12-30 16:09:17,230 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,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-30 16:09:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-12-30 16:09:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-30 16:09:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2018-12-30 16:09:17,251 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2018-12-30 16:09:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:17,251 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2018-12-30 16:09:17,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2018-12-30 16:09:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-30 16:09:17,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:17,255 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,255 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:17,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1438087397, now seen corresponding path program 1 times [2018-12-30 16:09:17,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:17,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:17,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:17,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:17,377 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,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:17,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:17,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:17,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:17,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:17,379 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2018-12-30 16:09:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:18,183 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2018-12-30 16:09:18,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:18,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-12-30 16:09:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:18,187 INFO L225 Difference]: With dead ends: 634 [2018-12-30 16:09:18,187 INFO L226 Difference]: Without dead ends: 336 [2018-12-30 16:09:18,188 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,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-12-30 16:09:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2018-12-30 16:09:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-12-30 16:09:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2018-12-30 16:09:18,201 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2018-12-30 16:09:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:18,202 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2018-12-30 16:09:18,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2018-12-30 16:09:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-30 16:09:18,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:18,205 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,205 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:18,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:18,205 INFO L82 PathProgramCache]: Analyzing trace with hash 384185223, now seen corresponding path program 1 times [2018-12-30 16:09:18,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:18,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:18,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:18,276 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,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:18,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:18,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:18,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:18,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:18,279 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2018-12-30 16:09:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:18,600 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2018-12-30 16:09:18,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:18,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-30 16:09:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:18,603 INFO L225 Difference]: With dead ends: 663 [2018-12-30 16:09:18,603 INFO L226 Difference]: Without dead ends: 336 [2018-12-30 16:09:18,604 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,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-12-30 16:09:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2018-12-30 16:09:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-12-30 16:09:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2018-12-30 16:09:18,619 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2018-12-30 16:09:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:18,622 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2018-12-30 16:09:18,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:18,623 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2018-12-30 16:09:18,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-30 16:09:18,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:18,624 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] [2018-12-30 16:09:18,626 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:18,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1845992555, now seen corresponding path program 1 times [2018-12-30 16:09:18,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:18,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:18,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:18,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:18,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:18,721 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:18,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:18,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:18,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:18,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:18,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:18,723 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2018-12-30 16:09:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:19,377 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2018-12-30 16:09:19,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:19,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-30 16:09:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:19,384 INFO L225 Difference]: With dead ends: 696 [2018-12-30 16:09:19,384 INFO L226 Difference]: Without dead ends: 369 [2018-12-30 16:09:19,386 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,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-30 16:09:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2018-12-30 16:09:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-30 16:09:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2018-12-30 16:09:19,401 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2018-12-30 16:09:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:19,402 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2018-12-30 16:09:19,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2018-12-30 16:09:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-30 16:09:19,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:19,406 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] [2018-12-30 16:09:19,406 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:19,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:19,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1032094409, now seen corresponding path program 1 times [2018-12-30 16:09:19,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:19,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:19,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:19,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:19,493 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,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:19,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:19,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:19,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:19,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:19,494 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2018-12-30 16:09:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:20,656 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2018-12-30 16:09:20,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:20,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-30 16:09:20,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:20,660 INFO L225 Difference]: With dead ends: 723 [2018-12-30 16:09:20,660 INFO L226 Difference]: Without dead ends: 369 [2018-12-30 16:09:20,661 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,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-30 16:09:20,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2018-12-30 16:09:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-30 16:09:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2018-12-30 16:09:20,678 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2018-12-30 16:09:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:20,678 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2018-12-30 16:09:20,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2018-12-30 16:09:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-30 16:09:20,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:20,682 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:20,683 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:20,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:20,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2114438894, now seen corresponding path program 1 times [2018-12-30 16:09:20,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:20,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:20,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:20,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:20,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:09:20,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:20,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:20,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:20,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:20,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:20,767 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2018-12-30 16:09:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:22,270 INFO L93 Difference]: Finished difference Result 740 states and 1192 transitions. [2018-12-30 16:09:22,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:22,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-30 16:09:22,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:22,274 INFO L225 Difference]: With dead ends: 740 [2018-12-30 16:09:22,274 INFO L226 Difference]: Without dead ends: 386 [2018-12-30 16:09:22,275 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,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-30 16:09:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2018-12-30 16:09:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-30 16:09:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2018-12-30 16:09:22,290 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2018-12-30 16:09:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:22,291 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2018-12-30 16:09:22,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2018-12-30 16:09:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-30 16:09:22,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:22,294 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:22,294 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:22,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:22,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1334837850, now seen corresponding path program 1 times [2018-12-30 16:09:22,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:22,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:22,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:22,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:09:22,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:22,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:22,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:22,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:22,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:22,403 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2018-12-30 16:09:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:22,845 INFO L93 Difference]: Finished difference Result 761 states and 1215 transitions. [2018-12-30 16:09:22,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:22,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-12-30 16:09:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:22,848 INFO L225 Difference]: With dead ends: 761 [2018-12-30 16:09:22,849 INFO L226 Difference]: Without dead ends: 386 [2018-12-30 16:09:22,850 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,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-30 16:09:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2018-12-30 16:09:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-30 16:09:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2018-12-30 16:09:22,869 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2018-12-30 16:09:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:22,870 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2018-12-30 16:09:22,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2018-12-30 16:09:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-30 16:09:22,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:22,872 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:22,872 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:22,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash -457491278, now seen corresponding path program 1 times [2018-12-30 16:09:22,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:22,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:22,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:22,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-30 16:09:22,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:22,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:22,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:22,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:22,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:22,963 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2018-12-30 16:09:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:23,182 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2018-12-30 16:09:23,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:23,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-12-30 16:09:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:23,188 INFO L225 Difference]: With dead ends: 757 [2018-12-30 16:09:23,189 INFO L226 Difference]: Without dead ends: 755 [2018-12-30 16:09:23,190 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:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-12-30 16:09:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2018-12-30 16:09:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-12-30 16:09:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2018-12-30 16:09:23,234 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2018-12-30 16:09:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:23,235 INFO L480 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2018-12-30 16:09:23,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2018-12-30 16:09:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-30 16:09:23,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:23,239 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:23,240 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:23,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1678103130, now seen corresponding path program 1 times [2018-12-30 16:09:23,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:23,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:23,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-30 16:09:23,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:23,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:23,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:23,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:23,331 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2018-12-30 16:09:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:23,457 INFO L93 Difference]: Finished difference Result 1831 states and 2899 transitions. [2018-12-30 16:09:23,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:23,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-12-30 16:09:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:23,464 INFO L225 Difference]: With dead ends: 1831 [2018-12-30 16:09:23,464 INFO L226 Difference]: Without dead ends: 1083 [2018-12-30 16:09:23,466 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:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-12-30 16:09:23,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2018-12-30 16:09:23,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-12-30 16:09:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1712 transitions. [2018-12-30 16:09:23,499 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1712 transitions. Word has length 121 [2018-12-30 16:09:23,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:23,499 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 1712 transitions. [2018-12-30 16:09:23,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1712 transitions. [2018-12-30 16:09:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-30 16:09:23,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:23,502 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:23,502 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:23,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:23,502 INFO L82 PathProgramCache]: Analyzing trace with hash -740381348, now seen corresponding path program 1 times [2018-12-30 16:09:23,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:23,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:23,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:23,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 16:09:23,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:23,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:23,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:23,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:23,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:23,582 INFO L87 Difference]: Start difference. First operand 1083 states and 1712 transitions. Second operand 3 states. [2018-12-30 16:09:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:23,853 INFO L93 Difference]: Finished difference Result 2528 states and 3999 transitions. [2018-12-30 16:09:23,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:23,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-12-30 16:09:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:23,860 INFO L225 Difference]: With dead ends: 2528 [2018-12-30 16:09:23,861 INFO L226 Difference]: Without dead ends: 1452 [2018-12-30 16:09:23,863 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:23,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2018-12-30 16:09:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1452. [2018-12-30 16:09:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2018-12-30 16:09:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2294 transitions. [2018-12-30 16:09:23,911 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2294 transitions. Word has length 121 [2018-12-30 16:09:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:23,911 INFO L480 AbstractCegarLoop]: Abstraction has 1452 states and 2294 transitions. [2018-12-30 16:09:23,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2294 transitions. [2018-12-30 16:09:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-30 16:09:23,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:23,915 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:23,915 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash 648912666, now seen corresponding path program 1 times [2018-12-30 16:09:23,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:23,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:23,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:23,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:23,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-30 16:09:23,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:23,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:23,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:23,982 INFO L87 Difference]: Start difference. First operand 1452 states and 2294 transitions. Second operand 3 states. [2018-12-30 16:09:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:24,265 INFO L93 Difference]: Finished difference Result 3248 states and 5132 transitions. [2018-12-30 16:09:24,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:24,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-12-30 16:09:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:24,273 INFO L225 Difference]: With dead ends: 3248 [2018-12-30 16:09:24,274 INFO L226 Difference]: Without dead ends: 1803 [2018-12-30 16:09:24,276 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,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2018-12-30 16:09:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2018-12-30 16:09:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2018-12-30 16:09:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2845 transitions. [2018-12-30 16:09:24,333 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2845 transitions. Word has length 121 [2018-12-30 16:09:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:24,333 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2845 transitions. [2018-12-30 16:09:24,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2845 transitions. [2018-12-30 16:09:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-30 16:09:24,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:24,340 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:24,340 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:24,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1430663259, now seen corresponding path program 1 times [2018-12-30 16:09:24,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:24,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:24,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:24,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:24,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-30 16:09:24,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:24,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:24,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:24,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:24,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:24,453 INFO L87 Difference]: Start difference. First operand 1803 states and 2845 transitions. Second operand 3 states. [2018-12-30 16:09:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:26,233 INFO L93 Difference]: Finished difference Result 3649 states and 5739 transitions. [2018-12-30 16:09:26,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:26,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2018-12-30 16:09:26,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:26,246 INFO L225 Difference]: With dead ends: 3649 [2018-12-30 16:09:26,247 INFO L226 Difference]: Without dead ends: 1853 [2018-12-30 16:09:26,249 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:26,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2018-12-30 16:09:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1803. [2018-12-30 16:09:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2018-12-30 16:09:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2773 transitions. [2018-12-30 16:09:26,299 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2773 transitions. Word has length 198 [2018-12-30 16:09:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:26,300 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2773 transitions. [2018-12-30 16:09:26,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2773 transitions. [2018-12-30 16:09:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-30 16:09:26,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:26,307 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:26,307 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:26,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:26,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1183282719, now seen corresponding path program 1 times [2018-12-30 16:09:26,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:26,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:26,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:26,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:26,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-30 16:09:26,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:26,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:26,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:26,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:26,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:26,412 INFO L87 Difference]: Start difference. First operand 1803 states and 2773 transitions. Second operand 3 states. [2018-12-30 16:09:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:26,841 INFO L93 Difference]: Finished difference Result 3666 states and 5612 transitions. [2018-12-30 16:09:26,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:26,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-12-30 16:09:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:26,852 INFO L225 Difference]: With dead ends: 3666 [2018-12-30 16:09:26,852 INFO L226 Difference]: Without dead ends: 1870 [2018-12-30 16:09:26,856 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:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2018-12-30 16:09:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1803. [2018-12-30 16:09:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2018-12-30 16:09:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2697 transitions. [2018-12-30 16:09:26,924 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2697 transitions. Word has length 212 [2018-12-30 16:09:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:26,924 INFO L480 AbstractCegarLoop]: Abstraction has 1803 states and 2697 transitions. [2018-12-30 16:09:26,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2697 transitions. [2018-12-30 16:09:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-12-30 16:09:26,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:26,931 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:26,932 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:26,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash 317822775, now seen corresponding path program 1 times [2018-12-30 16:09:26,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:26,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:26,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:26,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:26,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-30 16:09:27,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:09:27,191 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:27,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:27,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:09:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-30 16:09:27,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:09:27,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:09:27,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:09:27,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:09:27,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:09:27,438 INFO L87 Difference]: Start difference. First operand 1803 states and 2697 transitions. Second operand 4 states. [2018-12-30 16:09:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:30,814 INFO L93 Difference]: Finished difference Result 4264 states and 6328 transitions. [2018-12-30 16:09:30,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:09:30,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2018-12-30 16:09:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:30,830 INFO L225 Difference]: With dead ends: 4264 [2018-12-30 16:09:30,830 INFO L226 Difference]: Without dead ends: 2435 [2018-12-30 16:09:30,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:09:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2018-12-30 16:09:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1603. [2018-12-30 16:09:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2018-12-30 16:09:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2361 transitions. [2018-12-30 16:09:30,913 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2361 transitions. Word has length 231 [2018-12-30 16:09:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:30,914 INFO L480 AbstractCegarLoop]: Abstraction has 1603 states and 2361 transitions. [2018-12-30 16:09:30,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:09:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2361 transitions. [2018-12-30 16:09:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-30 16:09:30,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:30,921 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:30,921 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:30,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:30,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1244258795, now seen corresponding path program 1 times [2018-12-30 16:09:30,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:30,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:30,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:30,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:30,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-12-30 16:09:31,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:31,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:31,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:31,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:31,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:31,084 INFO L87 Difference]: Start difference. First operand 1603 states and 2361 transitions. Second operand 3 states. [2018-12-30 16:09:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:31,973 INFO L93 Difference]: Finished difference Result 3394 states and 5016 transitions. [2018-12-30 16:09:31,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:31,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-12-30 16:09:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:31,984 INFO L225 Difference]: With dead ends: 3394 [2018-12-30 16:09:31,985 INFO L226 Difference]: Without dead ends: 1678 [2018-12-30 16:09:31,988 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,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2018-12-30 16:09:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2018-12-30 16:09:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2018-12-30 16:09:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2426 transitions. [2018-12-30 16:09:32,045 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2426 transitions. Word has length 240 [2018-12-30 16:09:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:32,046 INFO L480 AbstractCegarLoop]: Abstraction has 1678 states and 2426 transitions. [2018-12-30 16:09:32,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2426 transitions. [2018-12-30 16:09:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-30 16:09:32,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:32,053 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:32,054 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:32,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:32,054 INFO L82 PathProgramCache]: Analyzing trace with hash -2075878606, now seen corresponding path program 1 times [2018-12-30 16:09:32,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:32,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:32,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:32,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:32,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-30 16:09:32,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:09:32,279 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:32,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:32,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:09:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-30 16:09:32,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:09:32,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:09:32,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:09:32,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:09:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:09:32,436 INFO L87 Difference]: Start difference. First operand 1678 states and 2426 transitions. Second operand 4 states. [2018-12-30 16:09:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:33,408 INFO L93 Difference]: Finished difference Result 5319 states and 7732 transitions. [2018-12-30 16:09:33,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:09:33,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2018-12-30 16:09:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:33,421 INFO L225 Difference]: With dead ends: 5319 [2018-12-30 16:09:33,422 INFO L226 Difference]: Without dead ends: 3648 [2018-12-30 16:09:33,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:09:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2018-12-30 16:09:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 2003. [2018-12-30 16:09:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2003 states. [2018-12-30 16:09:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 2728 transitions. [2018-12-30 16:09:33,506 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 2728 transitions. Word has length 252 [2018-12-30 16:09:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:33,506 INFO L480 AbstractCegarLoop]: Abstraction has 2003 states and 2728 transitions. [2018-12-30 16:09:33,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:09:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2728 transitions. [2018-12-30 16:09:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-30 16:09:33,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:33,515 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:33,515 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:33,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:33,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1787059216, now seen corresponding path program 1 times [2018-12-30 16:09:33,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:33,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:33,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:33,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:33,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-30 16:09:33,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:33,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:33,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:33,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:33,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:33,660 INFO L87 Difference]: Start difference. First operand 2003 states and 2728 transitions. Second operand 3 states. [2018-12-30 16:09:33,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:33,779 INFO L93 Difference]: Finished difference Result 5741 states and 7863 transitions. [2018-12-30 16:09:33,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:33,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2018-12-30 16:09:33,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:33,806 INFO L225 Difference]: With dead ends: 5741 [2018-12-30 16:09:33,812 INFO L226 Difference]: Without dead ends: 3745 [2018-12-30 16:09:33,816 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:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2018-12-30 16:09:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3743. [2018-12-30 16:09:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2018-12-30 16:09:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5133 transitions. [2018-12-30 16:09:33,950 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5133 transitions. Word has length 252 [2018-12-30 16:09:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:33,950 INFO L480 AbstractCegarLoop]: Abstraction has 3743 states and 5133 transitions. [2018-12-30 16:09:33,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5133 transitions. [2018-12-30 16:09:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-30 16:09:33,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:33,960 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:33,960 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:33,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1938581061, now seen corresponding path program 1 times [2018-12-30 16:09:33,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:33,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:33,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:33,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:33,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-12-30 16:09:34,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:34,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:34,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:34,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:34,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:34,091 INFO L87 Difference]: Start difference. First operand 3743 states and 5133 transitions. Second operand 3 states. [2018-12-30 16:09:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:34,507 INFO L93 Difference]: Finished difference Result 7697 states and 10553 transitions. [2018-12-30 16:09:34,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:34,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2018-12-30 16:09:34,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:34,523 INFO L225 Difference]: With dead ends: 7697 [2018-12-30 16:09:34,524 INFO L226 Difference]: Without dead ends: 3961 [2018-12-30 16:09:34,528 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:34,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2018-12-30 16:09:34,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3743. [2018-12-30 16:09:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2018-12-30 16:09:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5029 transitions. [2018-12-30 16:09:34,660 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5029 transitions. Word has length 255 [2018-12-30 16:09:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:34,661 INFO L480 AbstractCegarLoop]: Abstraction has 3743 states and 5029 transitions. [2018-12-30 16:09:34,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5029 transitions. [2018-12-30 16:09:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-12-30 16:09:34,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:34,667 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:34,667 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:34,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:34,669 INFO L82 PathProgramCache]: Analyzing trace with hash 501059335, now seen corresponding path program 1 times [2018-12-30 16:09:34,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:34,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:34,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:34,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:34,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2018-12-30 16:09:34,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:34,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:34,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:34,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:34,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:34,784 INFO L87 Difference]: Start difference. First operand 3743 states and 5029 transitions. Second operand 3 states. [2018-12-30 16:09:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:36,210 INFO L93 Difference]: Finished difference Result 7611 states and 10229 transitions. [2018-12-30 16:09:36,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:36,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2018-12-30 16:09:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:36,218 INFO L225 Difference]: With dead ends: 7611 [2018-12-30 16:09:36,218 INFO L226 Difference]: Without dead ends: 3875 [2018-12-30 16:09:36,223 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,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2018-12-30 16:09:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3835. [2018-12-30 16:09:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3835 states. [2018-12-30 16:09:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5141 transitions. [2018-12-30 16:09:36,350 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5141 transitions. Word has length 289 [2018-12-30 16:09:36,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:36,350 INFO L480 AbstractCegarLoop]: Abstraction has 3835 states and 5141 transitions. [2018-12-30 16:09:36,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5141 transitions. [2018-12-30 16:09:36,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-12-30 16:09:36,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:36,356 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:36,357 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:36,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1381959862, now seen corresponding path program 1 times [2018-12-30 16:09:36,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:36,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:36,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:36,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:36,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:36,479 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2018-12-30 16:09:36,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:36,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:36,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:36,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:36,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:36,482 INFO L87 Difference]: Start difference. First operand 3835 states and 5141 transitions. Second operand 3 states. [2018-12-30 16:09:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:36,793 INFO L93 Difference]: Finished difference Result 8043 states and 10851 transitions. [2018-12-30 16:09:36,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:36,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2018-12-30 16:09:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:36,804 INFO L225 Difference]: With dead ends: 8043 [2018-12-30 16:09:36,804 INFO L226 Difference]: Without dead ends: 4215 [2018-12-30 16:09:36,809 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,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4215 states. [2018-12-30 16:09:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4215 to 4085. [2018-12-30 16:09:37,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4085 states. [2018-12-30 16:09:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 5441 transitions. [2018-12-30 16:09:37,007 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 5441 transitions. Word has length 310 [2018-12-30 16:09:37,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:37,008 INFO L480 AbstractCegarLoop]: Abstraction has 4085 states and 5441 transitions. [2018-12-30 16:09:37,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 5441 transitions. [2018-12-30 16:09:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-12-30 16:09:37,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:37,017 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:37,017 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:37,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash -978123879, now seen corresponding path program 1 times [2018-12-30 16:09:37,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:37,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:37,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:37,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:37,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:37,155 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2018-12-30 16:09:37,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:37,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:37,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:37,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:37,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:37,156 INFO L87 Difference]: Start difference. First operand 4085 states and 5441 transitions. Second operand 3 states. [2018-12-30 16:09:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:37,378 INFO L93 Difference]: Finished difference Result 6854 states and 9018 transitions. [2018-12-30 16:09:37,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:37,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2018-12-30 16:09:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:37,384 INFO L225 Difference]: With dead ends: 6854 [2018-12-30 16:09:37,384 INFO L226 Difference]: Without dead ends: 2132 [2018-12-30 16:09:37,390 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,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2018-12-30 16:09:37,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2132. [2018-12-30 16:09:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2018-12-30 16:09:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2773 transitions. [2018-12-30 16:09:37,459 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2773 transitions. Word has length 320 [2018-12-30 16:09:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:37,460 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2773 transitions. [2018-12-30 16:09:37,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2773 transitions. [2018-12-30 16:09:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-12-30 16:09:37,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:37,466 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:37,468 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:37,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1544826379, now seen corresponding path program 1 times [2018-12-30 16:09:37,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:37,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:37,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:37,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:37,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-12-30 16:09:37,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:37,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:37,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:37,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:37,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:37,616 INFO L87 Difference]: Start difference. First operand 2132 states and 2773 transitions. Second operand 3 states. [2018-12-30 16:09:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:37,997 INFO L93 Difference]: Finished difference Result 4297 states and 5600 transitions. [2018-12-30 16:09:37,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:37,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2018-12-30 16:09:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:38,006 INFO L225 Difference]: With dead ends: 4297 [2018-12-30 16:09:38,006 INFO L226 Difference]: Without dead ends: 2172 [2018-12-30 16:09:38,009 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:38,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2018-12-30 16:09:38,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2132. [2018-12-30 16:09:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2018-12-30 16:09:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2733 transitions. [2018-12-30 16:09:38,080 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2733 transitions. Word has length 336 [2018-12-30 16:09:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:38,081 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2733 transitions. [2018-12-30 16:09:38,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2733 transitions. [2018-12-30 16:09:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-12-30 16:09:38,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:38,087 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:38,087 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:38,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:38,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1385591610, now seen corresponding path program 1 times [2018-12-30 16:09:38,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:38,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:38,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2018-12-30 16:09:38,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:38,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:38,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:38,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:38,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:38,270 INFO L87 Difference]: Start difference. First operand 2132 states and 2733 transitions. Second operand 3 states. [2018-12-30 16:09:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:39,827 INFO L93 Difference]: Finished difference Result 4267 states and 5465 transitions. [2018-12-30 16:09:39,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:39,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2018-12-30 16:09:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:39,835 INFO L225 Difference]: With dead ends: 4267 [2018-12-30 16:09:39,836 INFO L226 Difference]: Without dead ends: 2142 [2018-12-30 16:09:39,839 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,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2018-12-30 16:09:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2132. [2018-12-30 16:09:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2018-12-30 16:09:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2693 transitions. [2018-12-30 16:09:39,917 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2693 transitions. Word has length 359 [2018-12-30 16:09:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:39,917 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2693 transitions. [2018-12-30 16:09:39,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2693 transitions. [2018-12-30 16:09:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-12-30 16:09:39,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:39,925 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:39,925 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:39,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:39,926 INFO L82 PathProgramCache]: Analyzing trace with hash 228313073, now seen corresponding path program 1 times [2018-12-30 16:09:39,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:39,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:39,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:39,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:39,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-12-30 16:09:40,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:09:40,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:09:40,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:40,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:09:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2018-12-30 16:09:40,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:09:40,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 16:09:40,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:09:40,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:09:40,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:09:40,585 INFO L87 Difference]: Start difference. First operand 2132 states and 2693 transitions. Second operand 5 states. [2018-12-30 16:09:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:41,819 INFO L93 Difference]: Finished difference Result 5817 states and 7440 transitions. [2018-12-30 16:09:41,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 16:09:41,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 392 [2018-12-30 16:09:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:41,826 INFO L225 Difference]: With dead ends: 5817 [2018-12-30 16:09:41,826 INFO L226 Difference]: Without dead ends: 3638 [2018-12-30 16:09:41,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 396 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:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2018-12-30 16:09:41,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 2156. [2018-12-30 16:09:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2018-12-30 16:09:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2759 transitions. [2018-12-30 16:09:41,959 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2759 transitions. Word has length 392 [2018-12-30 16:09:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:41,960 INFO L480 AbstractCegarLoop]: Abstraction has 2156 states and 2759 transitions. [2018-12-30 16:09:41,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:09:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2759 transitions. [2018-12-30 16:09:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-12-30 16:09:41,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:41,968 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:41,968 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:41,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:41,970 INFO L82 PathProgramCache]: Analyzing trace with hash 276993037, now seen corresponding path program 1 times [2018-12-30 16:09:41,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:41,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:41,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:41,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:41,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2018-12-30 16:09:42,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:42,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:42,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:42,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:42,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:42,181 INFO L87 Difference]: Start difference. First operand 2156 states and 2759 transitions. Second operand 3 states. [2018-12-30 16:09:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:42,418 INFO L93 Difference]: Finished difference Result 4485 states and 5762 transitions. [2018-12-30 16:09:42,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:42,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2018-12-30 16:09:42,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:42,421 INFO L225 Difference]: With dead ends: 4485 [2018-12-30 16:09:42,422 INFO L226 Difference]: Without dead ends: 2336 [2018-12-30 16:09:42,424 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:42,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2018-12-30 16:09:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2326. [2018-12-30 16:09:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2018-12-30 16:09:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 2954 transitions. [2018-12-30 16:09:42,501 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 2954 transitions. Word has length 470 [2018-12-30 16:09:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:42,502 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 2954 transitions. [2018-12-30 16:09:42,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2954 transitions. [2018-12-30 16:09:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-12-30 16:09:42,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:42,507 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:42,507 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:42,508 INFO L82 PathProgramCache]: Analyzing trace with hash 373235815, now seen corresponding path program 1 times [2018-12-30 16:09:42,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:42,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:42,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:42,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:42,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2018-12-30 16:09:42,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:42,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:09:42,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:42,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:42,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:42,766 INFO L87 Difference]: Start difference. First operand 2326 states and 2954 transitions. Second operand 3 states. [2018-12-30 16:09:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:43,027 INFO L93 Difference]: Finished difference Result 4640 states and 5887 transitions. [2018-12-30 16:09:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:43,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 532 [2018-12-30 16:09:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:43,031 INFO L225 Difference]: With dead ends: 4640 [2018-12-30 16:09:43,031 INFO L226 Difference]: Without dead ends: 2321 [2018-12-30 16:09:43,034 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,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2018-12-30 16:09:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2018-12-30 16:09:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2018-12-30 16:09:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 2884 transitions. [2018-12-30 16:09:43,154 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 2884 transitions. Word has length 532 [2018-12-30 16:09:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:43,154 INFO L480 AbstractCegarLoop]: Abstraction has 2321 states and 2884 transitions. [2018-12-30 16:09:43,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2884 transitions. [2018-12-30 16:09:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-12-30 16:09:43,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:43,164 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:43,166 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:43,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:43,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1632000361, now seen corresponding path program 1 times [2018-12-30 16:09:43,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:43,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:43,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:43,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:43,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-12-30 16:09:43,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:09:43,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:09:43,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:43,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:09:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-12-30 16:09:44,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:09:44,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-30 16:09:44,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:09:44,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:09:44,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:09:44,011 INFO L87 Difference]: Start difference. First operand 2321 states and 2884 transitions. Second operand 4 states. [2018-12-30 16:09:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:44,517 INFO L93 Difference]: Finished difference Result 3916 states and 4894 transitions. [2018-12-30 16:09:44,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:09:44,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 598 [2018-12-30 16:09:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:44,519 INFO L225 Difference]: With dead ends: 3916 [2018-12-30 16:09:44,519 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:09:44,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:09:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:09:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:09:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:09:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:09:44,526 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2018-12-30 16:09:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:44,526 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:09:44,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:09:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:09:44,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:09:44,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:09:44,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:44,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,899 WARN L181 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 322 DAG size of output: 201 [2018-12-30 16:09:45,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:45,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,533 WARN L181 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 322 DAG size of output: 201 [2018-12-30 16:09:46,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:46,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:09:47,344 WARN L181 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2018-12-30 16:09:47,924 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 30 [2018-12-30 16:09:48,240 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2018-12-30 16:09:48,865 WARN L181 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2018-12-30 16:09:49,323 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2018-12-30 16:09:50,355 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 82 DAG size of output: 34 [2018-12-30 16:09:51,467 WARN L181 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 66 DAG size of output: 24 [2018-12-30 16:09:51,872 WARN L181 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2018-12-30 16:09:52,033 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 19 [2018-12-30 16:09:52,482 WARN L181 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2018-12-30 16:09:52,742 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2018-12-30 16:09:53,052 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2018-12-30 16:09:53,430 WARN L181 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 25 [2018-12-30 16:09:56,044 WARN L181 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 177 DAG size of output: 107 [2018-12-30 16:09:56,950 WARN L181 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2018-12-30 16:09:57,338 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2018-12-30 16:09:59,910 WARN L181 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 177 DAG size of output: 107 [2018-12-30 16:10:00,174 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2018-12-30 16:10:00,556 WARN L181 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2018-12-30 16:10:00,819 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2018-12-30 16:10:01,055 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2018-12-30 16:10:01,058 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 367) no Hoare annotation was computed. [2018-12-30 16:10:01,058 INFO L448 ceAbstractionStarter]: For program point L333-1(lines 333 367) no Hoare annotation was computed. [2018-12-30 16:10:01,058 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 546) no Hoare annotation was computed. [2018-12-30 16:10:01,058 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 557) no Hoare annotation was computed. [2018-12-30 16:10:01,059 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 568) no Hoare annotation was computed. [2018-12-30 16:10:01,059 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 579) no Hoare annotation was computed. [2018-12-30 16:10:01,059 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-12-30 16:10:01,059 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-12-30 16:10:01,059 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 364) no Hoare annotation was computed. [2018-12-30 16:10:01,059 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 547) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse2 .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (and .cse2 .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2018-12-30 16:10:01,059 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 579) the Hoare annotation is: false [2018-12-30 16:10:01,060 INFO L451 ceAbstractionStarter]: At program point L599(lines 98 600) the Hoare annotation is: true [2018-12-30 16:10:01,061 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 535) no Hoare annotation was computed. [2018-12-30 16:10:01,061 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 545) no Hoare annotation was computed. [2018-12-30 16:10:01,061 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 556) no Hoare annotation was computed. [2018-12-30 16:10:01,061 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 567) no Hoare annotation was computed. [2018-12-30 16:10:01,061 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 578) no Hoare annotation was computed. [2018-12-30 16:10:01,061 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 311) no Hoare annotation was computed. [2018-12-30 16:10:01,061 INFO L448 ceAbstractionStarter]: For program point L304-2(lines 304 311) no Hoare annotation was computed. [2018-12-30 16:10:01,061 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 545) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2018-12-30 16:10:01,061 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 557) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-30 16:10:01,063 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 568) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8) (and .cse9 .cse0 .cse8 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7))) [2018-12-30 16:10:01,063 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 362) no Hoare annotation was computed. [2018-12-30 16:10:01,063 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 545) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2018-12-30 16:10:01,063 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 555) no Hoare annotation was computed. [2018-12-30 16:10:01,063 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 566) no Hoare annotation was computed. [2018-12-30 16:10:01,063 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 577) no Hoare annotation was computed. [2018-12-30 16:10:01,064 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 606) no Hoare annotation was computed. [2018-12-30 16:10:01,064 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 606) no Hoare annotation was computed. [2018-12-30 16:10:01,064 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 508) no Hoare annotation was computed. [2018-12-30 16:10:01,064 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2018-12-30 16:10:01,064 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 542) no Hoare annotation was computed. [2018-12-30 16:10:01,064 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2018-12-30 16:10:01,064 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2018-12-30 16:10:01,064 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 346) no Hoare annotation was computed. [2018-12-30 16:10:01,064 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 346) no Hoare annotation was computed. [2018-12-30 16:10:01,064 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2018-12-30 16:10:01,064 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 554) no Hoare annotation was computed. [2018-12-30 16:10:01,065 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 565) no Hoare annotation was computed. [2018-12-30 16:10:01,065 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 576) no Hoare annotation was computed. [2018-12-30 16:10:01,065 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 477) no Hoare annotation was computed. [2018-12-30 16:10:01,065 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 408) no Hoare annotation was computed. [2018-12-30 16:10:01,065 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2018-12-30 16:10:01,065 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 578) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2) (and .cse0 (and .cse2 (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1))) (and .cse0 (and .cse2 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2))) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2018-12-30 16:10:01,065 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 555) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-30 16:10:01,065 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 566) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-30 16:10:01,066 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2018-12-30 16:10:01,066 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 383) no Hoare annotation was computed. [2018-12-30 16:10:01,066 INFO L451 ceAbstractionStarter]: At program point L609(lines 11 611) the Hoare annotation is: true [2018-12-30 16:10:01,066 INFO L444 ceAbstractionStarter]: At program point L543(lines 99 598) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse22 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse31 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse30 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse16 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse32 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (let ((.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse27 (and .cse7 (and .cse15 .cse30 .cse5 .cse16 .cse17 .cse18 .cse19 .cse29 .cse32 .cse20))) (.cse28 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse25 (and .cse15 .cse30 .cse16 .cse22 .cse17 .cse18 .cse19 .cse31 .cse29 .cse32 .cse20)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse12 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse24 (and .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse31 .cse2 .cse29 .cse32 .cse20)) (.cse26 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse8 .cse9 .cse4) (and .cse5 .cse10) (and .cse10 .cse8) (and .cse0 .cse11 .cse12 .cse4) (and .cse13 .cse5 .cse14) (and .cse15 .cse7 .cse5 .cse16 .cse17 .cse18 .cse19 .cse14 .cse20) (and .cse11 .cse7 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse9) (and .cse21 .cse22) (and .cse13 .cse22 .cse14) (and .cse0 .cse1 .cse22 .cse3) (and .cse22 .cse23) (and .cse24 .cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse7 .cse14 .cse25) (and .cse0 .cse1 .cse13 .cse2 .cse3) (and .cse10 .cse2) (and .cse23 .cse6 .cse2) (and .cse24 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse6) (and .cse26 .cse27) (and .cse13 .cse24 .cse28 .cse6) (and .cse5 .cse29 .cse3) (and .cse21 .cse6 .cse2) (and .cse27 .cse28) (and .cse28 .cse25) (and (and .cse8 .cse29 .cse3) .cse4) (and .cse26 .cse25) (and .cse10 .cse22) (and .cse0 .cse11 .cse12 .cse13) (and .cse13 .cse2 .cse14 .cse6) (and .cse13 .cse24 .cse26 .cse6)))) [2018-12-30 16:10:01,066 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 553) no Hoare annotation was computed. [2018-12-30 16:10:01,066 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 564) no Hoare annotation was computed. [2018-12-30 16:10:01,066 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 575) no Hoare annotation was computed. [2018-12-30 16:10:01,067 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2018-12-30 16:10:01,067 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 482) no Hoare annotation was computed. [2018-12-30 16:10:01,067 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2018-12-30 16:10:01,067 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 515) no Hoare annotation was computed. [2018-12-30 16:10:01,067 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2018-12-30 16:10:01,067 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2018-12-30 16:10:01,067 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 552) no Hoare annotation was computed. [2018-12-30 16:10:01,067 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 563) no Hoare annotation was computed. [2018-12-30 16:10:01,067 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2018-12-30 16:10:01,067 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 574) no Hoare annotation was computed. [2018-12-30 16:10:01,067 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 596) no Hoare annotation was computed. [2018-12-30 16:10:01,067 INFO L444 ceAbstractionStarter]: At program point L514(lines 72 610) the Hoare annotation is: false [2018-12-30 16:10:01,068 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 553) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse0) (and (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0))) [2018-12-30 16:10:01,068 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 564) the Hoare annotation is: (let ((.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9) (and .cse10 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2018-12-30 16:10:01,068 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2018-12-30 16:10:01,068 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2018-12-30 16:10:01,068 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 595) no Hoare annotation was computed. [2018-12-30 16:10:01,068 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 358) no Hoare annotation was computed. [2018-12-30 16:10:01,068 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:10:01,068 INFO L448 ceAbstractionStarter]: For program point L582(lines 582 587) no Hoare annotation was computed. [2018-12-30 16:10:01,068 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 518) no Hoare annotation was computed. [2018-12-30 16:10:01,069 INFO L448 ceAbstractionStarter]: For program point L582-2(lines 581 595) no Hoare annotation was computed. [2018-12-30 16:10:01,069 INFO L448 ceAbstractionStarter]: For program point $Ultimate##90(lines 208 544) no Hoare annotation was computed. [2018-12-30 16:10:01,069 INFO L444 ceAbstractionStarter]: At program point L351(lines 327 369) the Hoare annotation is: (let ((.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9) (and .cse10 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2018-12-30 16:10:01,069 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 551) no Hoare annotation was computed. [2018-12-30 16:10:01,069 INFO L448 ceAbstractionStarter]: For program point $Ultimate##91(lines 208 544) no Hoare annotation was computed. [2018-12-30 16:10:01,069 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 562) no Hoare annotation was computed. [2018-12-30 16:10:01,069 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 573) no Hoare annotation was computed. [2018-12-30 16:10:01,069 INFO L448 ceAbstractionStarter]: For program point L418(lines 418 420) no Hoare annotation was computed. [2018-12-30 16:10:01,070 INFO L444 ceAbstractionStarter]: At program point L385(lines 376 408) the Hoare annotation is: (let ((.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7)) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse8 (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7) .cse0)) (and (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7) .cse0) .cse8))) [2018-12-30 16:10:01,073 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 574) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9))) [2018-12-30 16:10:01,073 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-12-30 16:10:01,073 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 355) no Hoare annotation was computed. [2018-12-30 16:10:01,073 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2018-12-30 16:10:01,074 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-12-30 16:10:01,074 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 208 542) no Hoare annotation was computed. [2018-12-30 16:10:01,074 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 325) no Hoare annotation was computed. [2018-12-30 16:10:01,074 INFO L448 ceAbstractionStarter]: For program point L321-2(lines 208 542) no Hoare annotation was computed. [2018-12-30 16:10:01,074 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 550) no Hoare annotation was computed. [2018-12-30 16:10:01,074 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 561) no Hoare annotation was computed. [2018-12-30 16:10:01,074 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 572) no Hoare annotation was computed. [2018-12-30 16:10:01,074 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2018-12-30 16:10:01,074 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 610) no Hoare annotation was computed. [2018-12-30 16:10:01,074 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 524) no Hoare annotation was computed. [2018-12-30 16:10:01,074 INFO L448 ceAbstractionStarter]: For program point L520-2(lines 520 524) no Hoare annotation was computed. [2018-12-30 16:10:01,074 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 406) no Hoare annotation was computed. [2018-12-30 16:10:01,075 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:10:01,075 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 551) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4) .cse5) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5))) [2018-12-30 16:10:01,075 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 562) the Hoare annotation is: (let ((.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7)) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse8 (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7) .cse0)) (and (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7) .cse0) .cse8))) [2018-12-30 16:10:01,075 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 572) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-30 16:10:01,075 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-12-30 16:10:01,075 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 491) no Hoare annotation was computed. [2018-12-30 16:10:01,075 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L451 ceAbstractionStarter]: At program point L621(lines 612 623) the Hoare annotation is: true [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 549) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 560) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 571) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 542) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 426 434) no Hoare annotation was computed. [2018-12-30 16:10:01,076 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2018-12-30 16:10:01,077 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 548) no Hoare annotation was computed. [2018-12-30 16:10:01,077 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 559) no Hoare annotation was computed. [2018-12-30 16:10:01,077 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 570) no Hoare annotation was computed. [2018-12-30 16:10:01,077 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2018-12-30 16:10:01,077 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 499) no Hoare annotation was computed. [2018-12-30 16:10:01,077 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 549) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse3) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse3) (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2018-12-30 16:10:01,077 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 560) the Hoare annotation is: (let ((.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7)) .cse8) (and (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7) .cse0) .cse8) (and (and (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse7) .cse0) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) [2018-12-30 16:10:01,077 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2018-12-30 16:10:01,078 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 368) no Hoare annotation was computed. [2018-12-30 16:10:01,078 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 547) no Hoare annotation was computed. [2018-12-30 16:10:01,078 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 558) no Hoare annotation was computed. [2018-12-30 16:10:01,078 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 569) no Hoare annotation was computed. [2018-12-30 16:10:01,078 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 598) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse22 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0)) (.cse31 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse30 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse16 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse32 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (let ((.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (.cse21 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (.cse27 (and .cse7 (and .cse15 .cse30 .cse5 .cse16 .cse17 .cse18 .cse19 .cse29 .cse32 .cse20))) (.cse28 (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse25 (and .cse15 .cse30 .cse16 .cse22 .cse17 .cse18 .cse19 .cse31 .cse29 .cse32 .cse20)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse12 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse24 (and .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse31 .cse2 .cse29 .cse32 .cse20)) (.cse26 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse3) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse7 .cse8 .cse9 .cse4) (and .cse5 .cse10) (and .cse10 .cse8) (and .cse0 .cse11 .cse12 .cse4) (and .cse13 .cse5 .cse14) (and .cse15 .cse7 .cse5 .cse16 .cse17 .cse18 .cse19 .cse14 .cse20) (and .cse11 .cse7 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse9) (and .cse21 .cse22) (and .cse13 .cse22 .cse14) (and .cse0 .cse1 .cse22 .cse3) (and .cse22 .cse23) (and .cse24 .cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (and .cse7 .cse14 .cse25) (and .cse0 .cse1 .cse13 .cse2 .cse3) (and .cse10 .cse2) (and .cse23 .cse6 .cse2) (and .cse24 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528) .cse6) (and .cse26 .cse27) (and .cse13 .cse24 .cse28 .cse6) (and .cse5 .cse29 .cse3) (and .cse21 .cse6 .cse2) (and .cse27 .cse28) (and .cse28 .cse25) (and (and .cse8 .cse29 .cse3) .cse4) (and .cse26 .cse25) (and .cse10 .cse22) (and .cse0 .cse11 .cse12 .cse13) (and .cse13 .cse2 .cse14 .cse6) (and .cse13 .cse24 .cse26 .cse6)))) [2018-12-30 16:10:01,078 INFO L448 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2018-12-30 16:10:01,078 INFO L448 ceAbstractionStarter]: For program point L496-2(lines 208 542) no Hoare annotation was computed. [2018-12-30 16:10:01,079 INFO L444 ceAbstractionStarter]: At program point L397(lines 388 406) the Hoare annotation is: (let ((.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7)) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse8 (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7) .cse0)) (and (and (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse4 .cse5 .cse6 .cse7) .cse0) .cse8))) [2018-12-30 16:10:01,079 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2018-12-30 16:10:01,079 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 558) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse2 .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse1) (and .cse0 .cse3 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1))) [2018-12-30 16:10:01,079 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 571) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse8 .cse9 .cse10))) [2018-12-30 16:10:01,079 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 16:10:01,079 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 536) no Hoare annotation was computed. [2018-12-30 16:10:01,079 INFO L448 ceAbstractionStarter]: For program point L530-1(lines 530 536) no Hoare annotation was computed. [2018-12-30 16:10:01,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:10:01 BoogieIcfgContainer [2018-12-30 16:10:01,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:10:01,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:10:01,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:10:01,183 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:10:01,188 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:01,193 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:10:01,219 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 16:10:01,220 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:10:01,371 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:10:01,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:10:01,372 INFO L168 Benchmark]: Toolchain (without parser) took 52256.85 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 870.3 MB). Free memory was 952.7 MB in the beginning and 903.2 MB in the end (delta: 49.5 MB). Peak memory consumption was 919.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:01,374 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:10:01,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.95 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.3 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:01,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 209.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:01,378 INFO L168 Benchmark]: Boogie Preprocessor took 41.46 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:01,378 INFO L168 Benchmark]: RCFGBuilder took 1333.05 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: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:01,378 INFO L168 Benchmark]: TraceAbstraction took 49963.33 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 748.2 MB). Free memory was 1.1 GB in the beginning and 924.8 MB in the end (delta: 127.7 MB). Peak memory consumption was 880.2 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:01,379 INFO L168 Benchmark]: Witness Printer took 188.63 ms. Allocated memory is still 1.9 GB. Free memory was 924.8 MB in the beginning and 903.2 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:01,385 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 514.95 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.3 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 209.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.46 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 1333.05 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: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49963.33 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 748.2 MB). Free memory was 1.1 GB in the beginning and 924.8 MB in the end (delta: 127.7 MB). Peak memory consumption was 880.2 MB. Max. memory is 11.5 GB. * Witness Printer took 188.63 ms. Allocated memory is still 1.9 GB. Free memory was 924.8 MB in the beginning and 903.2 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(s__hit == 0)) || (((8448 <= s__state && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (((8448 <= s__state && blastFlag == 1) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((8448 <= s__state && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && s__state <= 8448) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((8448 <= s__state && ((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 0 == s__hit) || (s__state <= 8576 && (((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((8448 <= s__state && ((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 0 == s__hit) || (s__state <= 8576 && (((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((s__state <= 8672 && !(8657 == s__state)) && !(8672 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state) && !(s__hit == 0)) || (((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 1) && !(8672 == s__state)) && !(8656 == s__state)) && 8640 <= s__state)) || (((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 0) && !(8672 == s__state)) && !(8656 == s__state)) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(8657 == s__state)) && !(8672 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8656 == s__state)) && blastFlag == 2) && 8640 <= s__state)) || ((((((s__state <= 8672 && !(8657 == s__state)) && !(8672 == s__state)) && !(8656 == s__state)) && blastFlag == 2) && 8640 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((8672 <= s__state && !(12292 == s__state)) && blastFlag == 1) || (((blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state)) && !(s__hit == 0))) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || (((blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state)) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((s__state <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && s__state == 8608) || (((0 == s__hit && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && s__state == 8608)) || (blastFlag == 1 && s__state == 8608) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((8448 <= s__state && ((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) && 0 == s__hit) || (s__state <= 8576 && (((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state)) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) || (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && s__state <= 8448) || (s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448 && blastFlag == 1 && !(8448 == s__state))) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448 && !(8448 == s__state) && blastFlag == 2) && 0 == s__hit) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 2) && 8640 <= s__state) && !(s__hit == 0)) || ((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 1) && 0 == s__hit) && 8640 <= s__state)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(s__hit == 0))) || (blastFlag == 1 && s__state <= 3)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(s__hit == 0))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || ((((((((!(8497 == s__state) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag == 0)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 0) && 8640 <= s__state)) || (blastFlag == 0 && s__state == 8560)) || ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && s__state == 8512)) || ((8448 <= s__state && s__state <= 8576) && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || ((((s__state <= 8672 && !(8657 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && 8640 <= s__state)) || (s__state <= 3 && blastFlag == 2)) || ((s__state == 8560 && 0 == s__hit) && blastFlag == 2)) || ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8528) && 0 == s__hit)) || (s__state == 8592 && 8448 <= s__state && ((((((((!(8497 == s__state) && !(8496 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8608) && 0 == s__hit)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((s__state == 8544 && 0 == s__hit) && blastFlag == 2)) || ((8448 <= s__state && ((((((((!(8497 == s__state) && !(8496 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8608)) || (s__state == 8608 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (s__state == 8592 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (s__state <= 3 && blastFlag == 0)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 2) && s__state <= 8576) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8592) && 0 == s__hit) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((s__state <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((8448 <= s__state && ((((((!(8481 == s__state) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || ((((s__s3__tmp__next_state___0 <= 8576 && 8448 <= s__state) && s__state <= 8576) && ((((((!(8481 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit)) || ((((((((((8448 <= s__state && !(8481 == s__state)) && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 2) && 8640 <= s__state) && !(s__hit == 0)) || ((((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 1) && 0 == s__hit) && 8640 <= s__state)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(s__hit == 0))) || (blastFlag == 1 && s__state <= 3)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && !(s__hit == 0))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || ((((((((!(8497 == s__state) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(8480 == s__state))) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (s__state == 8544 && blastFlag == 0)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((s__state <= 8672 && !(8657 == s__state)) && blastFlag == 0) && 8640 <= s__state)) || (blastFlag == 0 && s__state == 8560)) || ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && s__state == 8512)) || ((8448 <= s__state && s__state <= 8576) && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || ((((s__state <= 8672 && !(8657 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && 8640 <= s__state)) || (s__state <= 3 && blastFlag == 2)) || ((s__state == 8560 && 0 == s__hit) && blastFlag == 2)) || ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8528) && 0 == s__hit)) || (s__state == 8592 && 8448 <= s__state && ((((((((!(8497 == s__state) && !(8496 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8608) && 0 == s__hit)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || ((s__state == 8544 && 0 == s__hit) && blastFlag == 2)) || ((8448 <= s__state && ((((((((!(8497 == s__state) && !(8496 == s__state)) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8608)) || (s__state == 8608 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (s__state == 8592 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (s__state <= 3 && blastFlag == 0)) || (((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 2) && s__state <= 8576) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) && s__state == 8592) && 0 == s__hit) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) || (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state))) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((8448 <= s__state && ((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8480 == s__state)) && s__state <= 8576) || (((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(8448 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576)) || ((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8480 == s__state)) && 8448 <= s__state) && s__state <= 8576) && 0 == s__hit) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 1) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && blastFlag == 0) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 2) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((s__state <= 8672 && !(8672 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 2) && 8640 <= s__state) || ((((s__state <= 8672 && blastFlag == 1) && !(8672 == s__state)) && 8640 <= s__state) && 0 == s__hit)) || (((s__state <= 8672 && !(8672 == s__state)) && blastFlag == 0) && 8640 <= s__state)) || ((((s__state <= 8672 && !(8672 == s__state)) && blastFlag == 2) && 8640 <= s__state) && !(s__hit == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. SAFE Result, 49.7s OverallTime, 34 OverallIterations, 19 TraceHistogramMax, 24.8s AutomataDifference, 0.0s DeadEndRemovalTime, 16.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 6488 SDtfs, 4148 SDslu, 3265 SDs, 0 SdLazy, 3730 SolverSat, 959 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1574 GetRequests, 1528 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4085occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 4578 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 241 NumberOfFragments, 3659 HoareAnnotationTreeSize, 28 FomulaSimplifications, 121494 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 32552 FormulaSimplificationTreeSizeReductionInter, 14.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 8393 NumberOfCodeBlocks, 8393 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 8355 ConstructedInterpolants, 0 QuantifiedInterpolants, 3514509 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2325 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 38 InterpolantComputations, 31 PerfectInterpolantSequences, 27180/27342 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...