java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:51:01,204 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:51:01,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:51:01,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:51:01,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:51:01,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:51:01,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:51:01,223 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:51:01,224 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:51:01,225 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:51:01,226 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:51:01,226 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:51:01,227 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:51:01,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:51:01,232 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:51:01,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:51:01,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:51:01,235 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:51:01,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:51:01,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:51:01,240 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:51:01,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:51:01,244 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:51:01,244 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:51:01,244 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:51:01,245 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:51:01,246 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:51:01,247 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:51:01,248 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:51:01,249 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:51:01,249 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:51:01,250 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:51:01,250 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:51:01,250 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:51:01,251 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:51:01,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:51:01,254 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:51:01,277 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:51:01,277 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:51:01,279 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:51:01,279 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:51:01,280 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:51:01,280 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:51:01,280 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:51:01,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:51:01,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:51:01,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:51:01,283 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:51:01,283 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:51:01,284 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:51:01,284 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:51:01,284 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:51:01,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:51:01,285 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:51:01,285 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:51:01,285 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:51:01,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:51:01,285 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:51:01,286 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:51:01,286 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:51:01,286 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:51:01,286 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:51:01,286 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:51:01,287 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:51:01,288 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:51:01,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:51:01,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:51:01,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:51:01,389 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:51:01,390 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:51:01,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2018-10-24 14:51:01,450 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5736a6e29/cafc231f3a594844b486b3d813f9e5ec/FLAG101270c2d [2018-10-24 14:51:02,006 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:51:02,008 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2018-10-24 14:51:02,025 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5736a6e29/cafc231f3a594844b486b3d813f9e5ec/FLAG101270c2d [2018-10-24 14:51:02,051 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5736a6e29/cafc231f3a594844b486b3d813f9e5ec [2018-10-24 14:51:02,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:51:02,064 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:51:02,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:51:02,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:51:02,072 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:51:02,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:51:02" (1/1) ... [2018-10-24 14:51:02,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea74f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02, skipping insertion in model container [2018-10-24 14:51:02,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:51:02" (1/1) ... [2018-10-24 14:51:02,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:51:02,159 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:51:02,672 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:51:02,677 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:51:02,779 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:51:02,796 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:51:02,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02 WrapperNode [2018-10-24 14:51:02,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:51:02,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:51:02,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:51:02,798 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:51:02,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02" (1/1) ... [2018-10-24 14:51:02,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02" (1/1) ... [2018-10-24 14:51:02,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:51:02,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:51:02,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:51:02,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:51:03,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02" (1/1) ... [2018-10-24 14:51:03,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02" (1/1) ... [2018-10-24 14:51:03,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02" (1/1) ... [2018-10-24 14:51:03,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02" (1/1) ... [2018-10-24 14:51:03,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02" (1/1) ... [2018-10-24 14:51:03,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02" (1/1) ... [2018-10-24 14:51:03,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02" (1/1) ... [2018-10-24 14:51:03,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:51:03,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:51:03,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:51:03,056 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:51:03,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:51:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:51:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:51:03,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:51:06,254 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:51:06,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:51:06 BoogieIcfgContainer [2018-10-24 14:51:06,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:51:06,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:51:06,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:51:06,260 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:51:06,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:51:02" (1/3) ... [2018-10-24 14:51:06,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae3198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:51:06, skipping insertion in model container [2018-10-24 14:51:06,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:02" (2/3) ... [2018-10-24 14:51:06,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae3198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:51:06, skipping insertion in model container [2018-10-24 14:51:06,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:51:06" (3/3) ... [2018-10-24 14:51:06,265 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label30_true-unreach-call_false-termination.c [2018-10-24 14:51:06,276 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:51:06,293 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:51:06,314 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:51:06,361 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:51:06,362 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:51:06,362 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:51:06,363 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:51:06,363 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:51:06,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:51:06,364 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:51:06,364 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:51:06,365 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:51:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:51:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-24 14:51:06,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:06,423 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:51:06,426 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:06,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:06,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1027439751, now seen corresponding path program 1 times [2018-10-24 14:51:06,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:06,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:06,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:06,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:06,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:06,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:06,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:06,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:06,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:06,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:06,985 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 3 states. [2018-10-24 14:51:08,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:08,544 INFO L93 Difference]: Finished difference Result 531 states and 918 transitions. [2018-10-24 14:51:08,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:08,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-10-24 14:51:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:08,565 INFO L225 Difference]: With dead ends: 531 [2018-10-24 14:51:08,566 INFO L226 Difference]: Without dead ends: 328 [2018-10-24 14:51:08,571 INFO L605 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-10-24 14:51:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-24 14:51:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-10-24 14:51:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-24 14:51:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 527 transitions. [2018-10-24 14:51:08,638 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 527 transitions. Word has length 126 [2018-10-24 14:51:08,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:08,639 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 527 transitions. [2018-10-24 14:51:08,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 527 transitions. [2018-10-24 14:51:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-24 14:51:08,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:08,644 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:51:08,644 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:08,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:08,645 INFO L82 PathProgramCache]: Analyzing trace with hash -898922017, now seen corresponding path program 1 times [2018-10-24 14:51:08,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:08,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:08,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:08,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:08,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:08,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:08,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:08,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:08,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:08,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:08,917 INFO L87 Difference]: Start difference. First operand 328 states and 527 transitions. Second operand 3 states. [2018-10-24 14:51:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:09,869 INFO L93 Difference]: Finished difference Result 918 states and 1516 transitions. [2018-10-24 14:51:09,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:09,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-10-24 14:51:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:09,883 INFO L225 Difference]: With dead ends: 918 [2018-10-24 14:51:09,883 INFO L226 Difference]: Without dead ends: 592 [2018-10-24 14:51:09,888 INFO L605 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-10-24 14:51:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-10-24 14:51:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2018-10-24 14:51:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-10-24 14:51:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 901 transitions. [2018-10-24 14:51:09,952 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 901 transitions. Word has length 131 [2018-10-24 14:51:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:09,953 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 901 transitions. [2018-10-24 14:51:09,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 901 transitions. [2018-10-24 14:51:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-24 14:51:09,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:09,958 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:51:09,959 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:09,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:09,959 INFO L82 PathProgramCache]: Analyzing trace with hash 449729837, now seen corresponding path program 1 times [2018-10-24 14:51:09,959 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:09,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:09,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:09,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:51:10,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:10,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:10,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:10,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:10,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:10,123 INFO L87 Difference]: Start difference. First operand 592 states and 901 transitions. Second operand 3 states. [2018-10-24 14:51:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:11,182 INFO L93 Difference]: Finished difference Result 1446 states and 2264 transitions. [2018-10-24 14:51:11,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:11,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-10-24 14:51:11,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:11,188 INFO L225 Difference]: With dead ends: 1446 [2018-10-24 14:51:11,188 INFO L226 Difference]: Without dead ends: 856 [2018-10-24 14:51:11,190 INFO L605 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-10-24 14:51:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-24 14:51:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-10-24 14:51:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-24 14:51:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1329 transitions. [2018-10-24 14:51:11,218 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1329 transitions. Word has length 151 [2018-10-24 14:51:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:11,219 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1329 transitions. [2018-10-24 14:51:11,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1329 transitions. [2018-10-24 14:51:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-24 14:51:11,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:11,223 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:51:11,223 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:11,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:11,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1397931721, now seen corresponding path program 1 times [2018-10-24 14:51:11,224 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:11,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:11,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:11,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:11,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-24 14:51:11,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:11,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:11,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:11,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:11,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:11,570 INFO L87 Difference]: Start difference. First operand 856 states and 1329 transitions. Second operand 4 states. [2018-10-24 14:51:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:14,582 INFO L93 Difference]: Finished difference Result 1845 states and 2828 transitions. [2018-10-24 14:51:14,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:14,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-10-24 14:51:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:14,589 INFO L225 Difference]: With dead ends: 1845 [2018-10-24 14:51:14,589 INFO L226 Difference]: Without dead ends: 991 [2018-10-24 14:51:14,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-24 14:51:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-10-24 14:51:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 988. [2018-10-24 14:51:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-10-24 14:51:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1467 transitions. [2018-10-24 14:51:14,614 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1467 transitions. Word has length 155 [2018-10-24 14:51:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:14,614 INFO L481 AbstractCegarLoop]: Abstraction has 988 states and 1467 transitions. [2018-10-24 14:51:14,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1467 transitions. [2018-10-24 14:51:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-24 14:51:14,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:14,618 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:51:14,618 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:14,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash 374428383, now seen corresponding path program 1 times [2018-10-24 14:51:14,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:14,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:14,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:14,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:14,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-24 14:51:14,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:14,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:14,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:14,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:14,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:14,745 INFO L87 Difference]: Start difference. First operand 988 states and 1467 transitions. Second operand 3 states. [2018-10-24 14:51:15,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:15,608 INFO L93 Difference]: Finished difference Result 2370 states and 3596 transitions. [2018-10-24 14:51:15,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:15,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2018-10-24 14:51:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:15,617 INFO L225 Difference]: With dead ends: 2370 [2018-10-24 14:51:15,617 INFO L226 Difference]: Without dead ends: 1516 [2018-10-24 14:51:15,619 INFO L605 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-10-24 14:51:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2018-10-24 14:51:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1516. [2018-10-24 14:51:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2018-10-24 14:51:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2134 transitions. [2018-10-24 14:51:15,650 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2134 transitions. Word has length 160 [2018-10-24 14:51:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:15,650 INFO L481 AbstractCegarLoop]: Abstraction has 1516 states and 2134 transitions. [2018-10-24 14:51:15,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2134 transitions. [2018-10-24 14:51:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-24 14:51:15,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:15,655 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:51:15,655 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:15,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash 303990096, now seen corresponding path program 1 times [2018-10-24 14:51:15,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:15,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:15,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-24 14:51:15,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:15,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:51:15,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:15,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:15,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:15,760 INFO L87 Difference]: Start difference. First operand 1516 states and 2134 transitions. Second operand 4 states. [2018-10-24 14:51:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:18,040 INFO L93 Difference]: Finished difference Result 5004 states and 7042 transitions. [2018-10-24 14:51:18,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:18,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-10-24 14:51:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:18,058 INFO L225 Difference]: With dead ends: 5004 [2018-10-24 14:51:18,058 INFO L226 Difference]: Without dead ends: 3622 [2018-10-24 14:51:18,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2018-10-24 14:51:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3622. [2018-10-24 14:51:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3622 states. [2018-10-24 14:51:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4668 transitions. [2018-10-24 14:51:18,130 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4668 transitions. Word has length 170 [2018-10-24 14:51:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:18,130 INFO L481 AbstractCegarLoop]: Abstraction has 3622 states and 4668 transitions. [2018-10-24 14:51:18,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4668 transitions. [2018-10-24 14:51:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-24 14:51:18,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:18,138 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:51:18,138 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:18,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:18,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1666411743, now seen corresponding path program 1 times [2018-10-24 14:51:18,138 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:18,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:18,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:18,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:18,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-24 14:51:18,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:18,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:18,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:18,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:18,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:18,393 INFO L87 Difference]: Start difference. First operand 3622 states and 4668 transitions. Second operand 4 states. [2018-10-24 14:51:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:19,712 INFO L93 Difference]: Finished difference Result 7242 states and 9391 transitions. [2018-10-24 14:51:19,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:19,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-10-24 14:51:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:19,728 INFO L225 Difference]: With dead ends: 7242 [2018-10-24 14:51:19,729 INFO L226 Difference]: Without dead ends: 3754 [2018-10-24 14:51:19,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2018-10-24 14:51:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3754. [2018-10-24 14:51:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2018-10-24 14:51:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 4768 transitions. [2018-10-24 14:51:19,818 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 4768 transitions. Word has length 176 [2018-10-24 14:51:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:19,818 INFO L481 AbstractCegarLoop]: Abstraction has 3754 states and 4768 transitions. [2018-10-24 14:51:19,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 4768 transitions. [2018-10-24 14:51:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-24 14:51:19,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:19,827 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:51:19,828 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:19,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:19,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1774375715, now seen corresponding path program 1 times [2018-10-24 14:51:19,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:19,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:19,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:19,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:19,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-24 14:51:19,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:19,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:19,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:19,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:19,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:19,960 INFO L87 Difference]: Start difference. First operand 3754 states and 4768 transitions. Second operand 3 states. [2018-10-24 14:51:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:20,928 INFO L93 Difference]: Finished difference Result 7374 states and 9396 transitions. [2018-10-24 14:51:20,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:20,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2018-10-24 14:51:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:20,938 INFO L225 Difference]: With dead ends: 7374 [2018-10-24 14:51:20,938 INFO L226 Difference]: Without dead ends: 3214 [2018-10-24 14:51:20,943 INFO L605 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-10-24 14:51:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2018-10-24 14:51:20,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3214. [2018-10-24 14:51:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3214 states. [2018-10-24 14:51:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 3648 transitions. [2018-10-24 14:51:20,993 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 3648 transitions. Word has length 179 [2018-10-24 14:51:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:20,993 INFO L481 AbstractCegarLoop]: Abstraction has 3214 states and 3648 transitions. [2018-10-24 14:51:20,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 3648 transitions. [2018-10-24 14:51:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-24 14:51:21,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:21,001 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:21,001 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:21,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:21,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2031020270, now seen corresponding path program 1 times [2018-10-24 14:51:21,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:21,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:21,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:21,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:21,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 14:51:21,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:21,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:51:21,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:21,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:21,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:21,163 INFO L87 Difference]: Start difference. First operand 3214 states and 3648 transitions. Second operand 3 states. [2018-10-24 14:51:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:21,790 INFO L93 Difference]: Finished difference Result 6294 states and 7159 transitions. [2018-10-24 14:51:21,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:51:21,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2018-10-24 14:51:21,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:21,802 INFO L225 Difference]: With dead ends: 6294 [2018-10-24 14:51:21,802 INFO L226 Difference]: Without dead ends: 2944 [2018-10-24 14:51:21,806 INFO L605 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-10-24 14:51:21,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2018-10-24 14:51:21,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2680. [2018-10-24 14:51:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2680 states. [2018-10-24 14:51:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3027 transitions. [2018-10-24 14:51:21,846 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3027 transitions. Word has length 193 [2018-10-24 14:51:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:21,847 INFO L481 AbstractCegarLoop]: Abstraction has 2680 states and 3027 transitions. [2018-10-24 14:51:21,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:51:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3027 transitions. [2018-10-24 14:51:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-24 14:51:21,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:21,854 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:51:21,854 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:21,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1444568145, now seen corresponding path program 1 times [2018-10-24 14:51:21,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:21,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:21,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:21,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:21,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 27 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-24 14:51:22,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:51:22,352 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:51:22,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:22,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:51:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-24 14:51:22,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:51:22,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 14:51:22,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:51:22,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:51:22,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:51:22,743 INFO L87 Difference]: Start difference. First operand 2680 states and 3027 transitions. Second operand 8 states. [2018-10-24 14:51:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:28,380 INFO L93 Difference]: Finished difference Result 5374 states and 6088 transitions. [2018-10-24 14:51:28,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:51:28,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 223 [2018-10-24 14:51:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:28,391 INFO L225 Difference]: With dead ends: 5374 [2018-10-24 14:51:28,391 INFO L226 Difference]: Without dead ends: 2423 [2018-10-24 14:51:28,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:51:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2018-10-24 14:51:28,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2407. [2018-10-24 14:51:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2407 states. [2018-10-24 14:51:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 2615 transitions. [2018-10-24 14:51:28,455 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 2615 transitions. Word has length 223 [2018-10-24 14:51:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:28,456 INFO L481 AbstractCegarLoop]: Abstraction has 2407 states and 2615 transitions. [2018-10-24 14:51:28,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:51:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 2615 transitions. [2018-10-24 14:51:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-24 14:51:28,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:28,465 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 14:51:28,466 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:28,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash -259377170, now seen corresponding path program 1 times [2018-10-24 14:51:28,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:28,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:28,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-24 14:51:28,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:28,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:51:28,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:28,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:28,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:28,908 INFO L87 Difference]: Start difference. First operand 2407 states and 2615 transitions. Second operand 4 states. [2018-10-24 14:51:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:29,881 INFO L93 Difference]: Finished difference Result 4812 states and 5239 transitions. [2018-10-24 14:51:29,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:29,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 280 [2018-10-24 14:51:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:29,889 INFO L225 Difference]: With dead ends: 4812 [2018-10-24 14:51:29,890 INFO L226 Difference]: Without dead ends: 2539 [2018-10-24 14:51:29,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2018-10-24 14:51:29,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2407. [2018-10-24 14:51:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2407 states. [2018-10-24 14:51:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 2574 transitions. [2018-10-24 14:51:29,926 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 2574 transitions. Word has length 280 [2018-10-24 14:51:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:29,927 INFO L481 AbstractCegarLoop]: Abstraction has 2407 states and 2574 transitions. [2018-10-24 14:51:29,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 2574 transitions. [2018-10-24 14:51:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-24 14:51:29,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:29,935 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:51:29,935 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:29,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1461161897, now seen corresponding path program 1 times [2018-10-24 14:51:29,936 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:29,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:29,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:29,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:29,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:30,498 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 14:51:30,930 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-10-24 14:51:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 283 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-24 14:51:31,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:51:31,769 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 14:51:31,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:31,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:51:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-24 14:51:32,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:51:32,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-10-24 14:51:32,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 14:51:32,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 14:51:32,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-24 14:51:32,042 INFO L87 Difference]: Start difference. First operand 2407 states and 2574 transitions. Second operand 14 states. [2018-10-24 14:51:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:34,981 INFO L93 Difference]: Finished difference Result 4469 states and 4790 transitions. [2018-10-24 14:51:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:51:34,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 302 [2018-10-24 14:51:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:34,982 INFO L225 Difference]: With dead ends: 4469 [2018-10-24 14:51:34,982 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:51:34,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 306 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-10-24 14:51:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:51:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:51:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:51:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:51:34,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 302 [2018-10-24 14:51:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:34,986 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:51:34,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 14:51:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:51:34,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:51:34,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:51:35,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:35,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:51:35,962 WARN L179 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2018-10-24 14:51:36,508 WARN L179 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2018-10-24 14:51:36,512 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:51:36,512 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:51:36,512 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,512 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,512 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,512 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,512 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,512 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,512 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:51:36,513 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:51:36,513 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:51:36,513 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:51:36,513 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:51:36,513 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:51:36,513 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:51:36,513 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:51:36,513 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:51:36,513 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:51:36,513 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,513 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,514 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,514 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,514 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,514 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,514 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:51:36,514 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:51:36,514 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:51:36,514 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:51:36,514 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:51:36,515 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:51:36,515 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:51:36,515 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:51:36,515 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:51:36,515 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:51:36,515 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:51:36,515 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:51:36,515 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:51:36,515 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:51:36,516 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:51:36,516 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,516 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,516 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,516 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,516 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,516 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:51:36,516 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:51:36,516 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:51:36,517 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:51:36,517 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:51:36,517 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:51:36,517 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:51:36,517 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:51:36,517 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:51:36,518 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1))) (let ((.cse1 (= ~a20~0 1)) (.cse9 (= ~a16~0 5)) (.cse10 (not .cse0)) (.cse7 (<= ~a17~0 0)) (.cse11 (= ~a16~0 6)) (.cse8 (= ~a21~0 1)) (.cse2 (<= ~a21~0 0)) (.cse6 (= ~a16~0 4)) (.cse3 (= ~a8~0 13)) (.cse4 (= ~a17~0 1)) (.cse5 (= ~a12~0 8))) (or (and (and .cse0 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse8) (and .cse0 .cse7 .cse8 .cse9) (and .cse10 .cse4 .cse5 .cse8 .cse9) (and .cse2 (and .cse0 .cse7 .cse1) .cse5) (and .cse0 .cse8 .cse1) (and .cse10 .cse4 .cse5 .cse8 .cse11) (and .cse6 .cse5 .cse7 .cse8) (and .cse5 .cse7 .cse8 .cse9) (and .cse10 .cse5 .cse7 .cse8 .cse11) (and .cse6 .cse4 .cse5 .cse8) (and .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse6 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) .cse3 .cse4 .cse5 (<= ~a20~0 0))))) [2018-10-24 14:51:36,518 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,518 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,518 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,518 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,519 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,519 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:51:36,519 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 551) no Hoare annotation was computed. [2018-10-24 14:51:36,519 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:51:36,519 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:51:36,519 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:51:36,519 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:51:36,520 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:51:36,520 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:51:36,520 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:51:36,520 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:51:36,520 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:51:36,520 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:51:36,520 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:51:36,520 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:51:36,520 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:51:36,521 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:51:36,522 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:51:36,523 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:51:36,523 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:51:36,523 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:51:36,523 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:51:36,523 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:51:36,523 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:51:36,523 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:51:36,523 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:51:36,523 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,523 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,523 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,524 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1))) (let ((.cse1 (= ~a20~0 1)) (.cse9 (= ~a16~0 5)) (.cse10 (not .cse0)) (.cse7 (<= ~a17~0 0)) (.cse11 (= ~a16~0 6)) (.cse8 (= ~a21~0 1)) (.cse2 (<= ~a21~0 0)) (.cse6 (= ~a16~0 4)) (.cse3 (= ~a8~0 13)) (.cse4 (= ~a17~0 1)) (.cse5 (= ~a12~0 8))) (or (and (and .cse0 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse8) (and .cse0 .cse7 .cse8 .cse9) (and .cse10 .cse4 .cse5 .cse8 .cse9) (and .cse2 (and .cse0 .cse7 .cse1) .cse5) (and .cse0 .cse8 .cse1) (and .cse10 .cse4 .cse5 .cse8 .cse11) (and .cse6 .cse5 .cse7 .cse8) (and .cse5 .cse7 .cse8 .cse9) (and .cse10 .cse5 .cse7 .cse8 .cse11) (and .cse6 .cse4 .cse5 .cse8) (and .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse6 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) .cse3 .cse4 .cse5 (<= ~a20~0 0))))) [2018-10-24 14:51:36,524 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,524 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,524 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:51:36,524 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:51:36,524 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:51:36,524 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:51:36,524 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:51:36,524 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:51:36,524 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:51:36,525 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:51:36,526 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,527 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:51:36,528 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:51:36,529 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:51:36,529 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:51:36,529 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:51:36,529 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:51:36,529 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:51:36,529 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,529 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,529 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,529 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,529 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,530 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:51:36,530 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:51:36,530 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:51:36,530 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:51:36,530 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:51:36,530 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:51:36,530 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:51:36,530 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:51:36,530 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:51:36,530 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:51:36,530 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:51:36,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:51:36 BoogieIcfgContainer [2018-10-24 14:51:36,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:51:36,561 INFO L168 Benchmark]: Toolchain (without parser) took 34497.43 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 114.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:36,562 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:51:36,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:36,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 192.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.6 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:36,564 INFO L168 Benchmark]: Boogie Preprocessor took 64.68 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:51:36,565 INFO L168 Benchmark]: RCFGBuilder took 3199.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 115.7 MB). Peak memory consumption was 115.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:36,565 INFO L168 Benchmark]: TraceAbstraction took 30303.49 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 447.2 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -396.0 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. [2018-10-24 14:51:36,571 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 731.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 192.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.6 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.68 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3199.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 115.7 MB). Peak memory consumption was 115.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30303.49 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 447.2 MB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -396.0 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 551]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((a7 == 1 && a20 == 1) && a21 <= 0) && a8 == 13) && a17 == 1) && a12 == 8) || (((a7 == 1 && a16 == 4) && a17 <= 0) && a21 == 1)) || (((a7 == 1 && a17 <= 0) && a21 == 1) && a16 == 5)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || ((a21 <= 0 && (a7 == 1 && a17 <= 0) && a20 == 1) && a12 == 8)) || ((a7 == 1 && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5)) || ((((!(a7 == 1) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || (((a16 == 4 && a17 == 1) && a12 == 8) && a21 == 1)) || (((a7 == 1 && a16 == 4) && a17 == 1) && a21 == 1)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((a7 == 1 && a20 == 1) && a21 <= 0) && a8 == 13) && a17 == 1) && a12 == 8) || (((a7 == 1 && a16 == 4) && a17 <= 0) && a21 == 1)) || (((a7 == 1 && a17 <= 0) && a21 == 1) && a16 == 5)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 5)) || ((a21 <= 0 && (a7 == 1 && a17 <= 0) && a20 == 1) && a12 == 8)) || ((a7 == 1 && a21 == 1) && a20 == 1)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5)) || ((((!(a7 == 1) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || (((a16 == 4 && a17 == 1) && a12 == 8) && a21 == 1)) || (((a7 == 1 && a16 == 4) && a17 == 1) && a21 == 1)) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 30.1s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 22.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1486 SDtfs, 3771 SDslu, 759 SDs, 0 SdLazy, 9123 SolverSat, 1420 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 596 GetRequests, 547 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3754occurred in iteration=7, 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: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 415 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 61 NumberOfFragments, 425 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1287 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 216 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2771 NumberOfCodeBlocks, 2771 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2757 ConstructedInterpolants, 0 QuantifiedInterpolants, 1884106 SizeOfPredicates, 2 NumberOfNonLiveVariables, 906 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2008/2040 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...