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/Problem14_label09_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:28:41,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:28:41,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:28:41,143 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:28:41,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:28:41,145 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:28:41,146 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:28:41,148 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:28:41,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:28:41,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:28:41,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:28:41,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:28:41,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:28:41,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:28:41,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:28:41,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:28:41,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:28:41,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:28:41,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:28:41,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:28:41,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:28:41,164 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:28:41,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:28:41,167 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:28:41,167 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:28:41,168 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:28:41,169 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:28:41,170 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:28:41,171 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:28:41,172 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:28:41,172 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:28:41,173 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:28:41,173 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:28:41,173 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:28:41,174 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:28:41,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:28:41,175 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 16:28:41,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:28:41,191 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:28:41,192 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:28:41,192 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:28:41,193 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:28:41,193 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:28:41,193 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:28:41,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:28:41,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:28:41,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:28:41,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:28:41,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:28:41,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:28:41,194 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:28:41,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:28:41,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:28:41,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:28:41,195 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:28:41,195 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:28:41,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:28:41,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:28:41,196 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:28:41,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:28:41,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:28:41,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:28:41,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:28:41,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:28:41,197 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:28:41,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:28:41,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:28:41,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:28:41,281 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:28:41,282 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:28:41,283 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label09_true-unreach-call_false-termination.c [2018-10-24 16:28:41,338 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e6568a00e/b2510e542fbc4da2a21bd5d653df3437/FLAGeb832b1dc [2018-10-24 16:28:41,920 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:28:41,920 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label09_true-unreach-call_false-termination.c [2018-10-24 16:28:41,940 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e6568a00e/b2510e542fbc4da2a21bd5d653df3437/FLAGeb832b1dc [2018-10-24 16:28:41,970 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e6568a00e/b2510e542fbc4da2a21bd5d653df3437 [2018-10-24 16:28:41,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:28:41,988 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:28:41,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:28:41,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:28:41,995 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:28:41,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:28:41" (1/1) ... [2018-10-24 16:28:41,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7821173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:41, skipping insertion in model container [2018-10-24 16:28:41,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:28:41" (1/1) ... [2018-10-24 16:28:42,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:28:42,095 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:28:42,630 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:28:42,636 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:28:42,794 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:28:42,812 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:28:42,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:42 WrapperNode [2018-10-24 16:28:42,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:28:42,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:28:42,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:28:42,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:28:42,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:42" (1/1) ... [2018-10-24 16:28:42,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:42" (1/1) ... [2018-10-24 16:28:43,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:28:43,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:28:43,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:28:43,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:28:43,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:42" (1/1) ... [2018-10-24 16:28:43,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:42" (1/1) ... [2018-10-24 16:28:43,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:42" (1/1) ... [2018-10-24 16:28:43,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:42" (1/1) ... [2018-10-24 16:28:43,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:42" (1/1) ... [2018-10-24 16:28:43,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:42" (1/1) ... [2018-10-24 16:28:43,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:42" (1/1) ... [2018-10-24 16:28:43,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:28:43,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:28:43,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:28:43,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:28:43,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:42" (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 16:28:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:28:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:28:43,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:28:46,677 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:28:46,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:28:46 BoogieIcfgContainer [2018-10-24 16:28:46,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:28:46,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:28:46,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:28:46,684 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:28:46,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:28:41" (1/3) ... [2018-10-24 16:28:46,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d907c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:28:46, skipping insertion in model container [2018-10-24 16:28:46,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:42" (2/3) ... [2018-10-24 16:28:46,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d907c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:28:46, skipping insertion in model container [2018-10-24 16:28:46,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:28:46" (3/3) ... [2018-10-24 16:28:46,689 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label09_true-unreach-call_false-termination.c [2018-10-24 16:28:46,697 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:28:46,705 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:28:46,722 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:28:46,766 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:28:46,767 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:28:46,767 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:28:46,767 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:28:46,767 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:28:46,767 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:28:46,767 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:28:46,768 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:28:46,768 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:28:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-10-24 16:28:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-24 16:28:46,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:28:46,801 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] [2018-10-24 16:28:46,804 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:28:46,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:28:46,809 INFO L82 PathProgramCache]: Analyzing trace with hash 279835594, now seen corresponding path program 1 times [2018-10-24 16:28:46,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:28:46,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:28:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:46,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:28:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:28:47,292 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 16:28:47,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:28:47,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:28:47,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:28:47,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:28:47,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:28:47,319 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-10-24 16:28:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:28:51,296 INFO L93 Difference]: Finished difference Result 870 states and 1578 transitions. [2018-10-24 16:28:51,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:28:51,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-10-24 16:28:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:28:51,322 INFO L225 Difference]: With dead ends: 870 [2018-10-24 16:28:51,323 INFO L226 Difference]: Without dead ends: 617 [2018-10-24 16:28:51,328 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 16:28:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-24 16:28:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2018-10-24 16:28:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-10-24 16:28:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 940 transitions. [2018-10-24 16:28:51,437 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 940 transitions. Word has length 46 [2018-10-24 16:28:51,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:28:51,438 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 940 transitions. [2018-10-24 16:28:51,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:28:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 940 transitions. [2018-10-24 16:28:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-24 16:28:51,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:28:51,447 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:28:51,447 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:28:51,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:28:51,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1096666001, now seen corresponding path program 1 times [2018-10-24 16:28:51,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:28:51,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:28:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:51,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:28:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:28:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:28:52,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:28:52,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:28:52,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:28:52,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:28:52,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:28:52,094 INFO L87 Difference]: Start difference. First operand 617 states and 940 transitions. Second operand 6 states. [2018-10-24 16:28:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:28:57,874 INFO L93 Difference]: Finished difference Result 3026 states and 4618 transitions. [2018-10-24 16:28:57,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 16:28:57,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-10-24 16:28:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:28:57,891 INFO L225 Difference]: With dead ends: 3026 [2018-10-24 16:28:57,891 INFO L226 Difference]: Without dead ends: 2411 [2018-10-24 16:28:57,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:28:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2018-10-24 16:28:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 1870. [2018-10-24 16:28:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1870 states. [2018-10-24 16:28:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2494 transitions. [2018-10-24 16:28:57,980 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2494 transitions. Word has length 155 [2018-10-24 16:28:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:28:57,980 INFO L481 AbstractCegarLoop]: Abstraction has 1870 states and 2494 transitions. [2018-10-24 16:28:57,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:28:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2494 transitions. [2018-10-24 16:28:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-24 16:28:57,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:28:57,996 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:28:57,996 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:28:57,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:28:57,997 INFO L82 PathProgramCache]: Analyzing trace with hash 256002721, now seen corresponding path program 1 times [2018-10-24 16:28:57,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:28:57,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:28:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:28:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:28:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:28:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-24 16:28:58,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:28:58,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:28:58,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:28:58,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:28:58,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:28:58,217 INFO L87 Difference]: Start difference. First operand 1870 states and 2494 transitions. Second operand 4 states. [2018-10-24 16:29:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:01,998 INFO L93 Difference]: Finished difference Result 5170 states and 7227 transitions. [2018-10-24 16:29:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:29:01,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2018-10-24 16:29:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:02,016 INFO L225 Difference]: With dead ends: 5170 [2018-10-24 16:29:02,016 INFO L226 Difference]: Without dead ends: 3302 [2018-10-24 16:29:02,019 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 16:29:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2018-10-24 16:29:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3302. [2018-10-24 16:29:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3302 states. [2018-10-24 16:29:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4301 transitions. [2018-10-24 16:29:02,083 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4301 transitions. Word has length 222 [2018-10-24 16:29:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:02,084 INFO L481 AbstractCegarLoop]: Abstraction has 3302 states and 4301 transitions. [2018-10-24 16:29:02,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:29:02,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4301 transitions. [2018-10-24 16:29:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-24 16:29:02,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:02,089 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:29:02,089 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:02,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:02,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1243089956, now seen corresponding path program 1 times [2018-10-24 16:29:02,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:02,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:02,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:02,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:02,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:02,526 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-24 16:29:02,732 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-10-24 16:29:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 148 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 16:29:02,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:29:02,845 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 16:29:02,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:02,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:29:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 16:29:03,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:29:03,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-24 16:29:03,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 16:29:03,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 16:29:03,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 16:29:03,235 INFO L87 Difference]: Start difference. First operand 3302 states and 4301 transitions. Second operand 6 states. [2018-10-24 16:29:04,111 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-10-24 16:29:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:08,957 INFO L93 Difference]: Finished difference Result 9124 states and 11710 transitions. [2018-10-24 16:29:08,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 16:29:08,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2018-10-24 16:29:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:08,984 INFO L225 Difference]: With dead ends: 9124 [2018-10-24 16:29:08,985 INFO L226 Difference]: Without dead ends: 5463 [2018-10-24 16:29:08,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:29:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2018-10-24 16:29:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 3285. [2018-10-24 16:29:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3285 states. [2018-10-24 16:29:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 3842 transitions. [2018-10-24 16:29:09,069 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 3842 transitions. Word has length 236 [2018-10-24 16:29:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:09,069 INFO L481 AbstractCegarLoop]: Abstraction has 3285 states and 3842 transitions. [2018-10-24 16:29:09,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 16:29:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 3842 transitions. [2018-10-24 16:29:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-10-24 16:29:09,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:09,078 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:29:09,079 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:09,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:09,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2076395288, now seen corresponding path program 1 times [2018-10-24 16:29:09,079 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:09,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:09,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:09,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:09,688 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-10-24 16:29:10,014 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-10-24 16:29:10,450 WARN L179 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-10-24 16:29:10,664 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 11 [2018-10-24 16:29:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 286 proven. 46 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-24 16:29:10,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:29:10,924 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 16:29:10,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:11,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:29:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 309 proven. 23 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-24 16:29:11,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:29:11,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-10-24 16:29:11,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 16:29:11,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 16:29:11,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:29:11,630 INFO L87 Difference]: Start difference. First operand 3285 states and 3842 transitions. Second operand 9 states. [2018-10-24 16:29:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:14,718 INFO L93 Difference]: Finished difference Result 6815 states and 7936 transitions. [2018-10-24 16:29:14,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 16:29:14,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 353 [2018-10-24 16:29:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:14,737 INFO L225 Difference]: With dead ends: 6815 [2018-10-24 16:29:14,737 INFO L226 Difference]: Without dead ends: 3711 [2018-10-24 16:29:14,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-10-24 16:29:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2018-10-24 16:29:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3464. [2018-10-24 16:29:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2018-10-24 16:29:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 4021 transitions. [2018-10-24 16:29:14,805 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 4021 transitions. Word has length 353 [2018-10-24 16:29:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:14,806 INFO L481 AbstractCegarLoop]: Abstraction has 3464 states and 4021 transitions. [2018-10-24 16:29:14,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 16:29:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 4021 transitions. [2018-10-24 16:29:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-24 16:29:14,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:14,816 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:29:14,817 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:14,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:14,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1406253511, now seen corresponding path program 1 times [2018-10-24 16:29:14,817 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:14,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:14,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:14,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-10-24 16:29:15,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:15,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:29:15,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 16:29:15,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 16:29:15,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:29:15,329 INFO L87 Difference]: Start difference. First operand 3464 states and 4021 transitions. Second operand 3 states. [2018-10-24 16:29:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:17,306 INFO L93 Difference]: Finished difference Result 7105 states and 8305 transitions. [2018-10-24 16:29:17,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 16:29:17,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2018-10-24 16:29:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:17,323 INFO L225 Difference]: With dead ends: 7105 [2018-10-24 16:29:17,324 INFO L226 Difference]: Without dead ends: 3822 [2018-10-24 16:29:17,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 16:29:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2018-10-24 16:29:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3643. [2018-10-24 16:29:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2018-10-24 16:29:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4246 transitions. [2018-10-24 16:29:17,395 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4246 transitions. Word has length 438 [2018-10-24 16:29:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:17,396 INFO L481 AbstractCegarLoop]: Abstraction has 3643 states and 4246 transitions. [2018-10-24 16:29:17,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 16:29:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4246 transitions. [2018-10-24 16:29:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-24 16:29:17,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:17,411 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 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 16:29:17,411 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:17,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:17,412 INFO L82 PathProgramCache]: Analyzing trace with hash -807291830, now seen corresponding path program 1 times [2018-10-24 16:29:17,412 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:17,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:17,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:17,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:17,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:17,941 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-10-24 16:29:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-10-24 16:29:18,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:18,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:29:18,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:29:18,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:29:18,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:29:18,034 INFO L87 Difference]: Start difference. First operand 3643 states and 4246 transitions. Second operand 4 states. [2018-10-24 16:29:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:19,624 INFO L93 Difference]: Finished difference Result 10327 states and 12381 transitions. [2018-10-24 16:29:19,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:29:19,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 459 [2018-10-24 16:29:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:19,647 INFO L225 Difference]: With dead ends: 10327 [2018-10-24 16:29:19,648 INFO L226 Difference]: Without dead ends: 6865 [2018-10-24 16:29:19,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 16:29:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6865 states. [2018-10-24 16:29:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6865 to 6865. [2018-10-24 16:29:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6865 states. [2018-10-24 16:29:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6865 states to 6865 states and 7809 transitions. [2018-10-24 16:29:19,768 INFO L78 Accepts]: Start accepts. Automaton has 6865 states and 7809 transitions. Word has length 459 [2018-10-24 16:29:19,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:19,769 INFO L481 AbstractCegarLoop]: Abstraction has 6865 states and 7809 transitions. [2018-10-24 16:29:19,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:29:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6865 states and 7809 transitions. [2018-10-24 16:29:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-10-24 16:29:19,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:19,790 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:29:19,790 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:19,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:19,791 INFO L82 PathProgramCache]: Analyzing trace with hash -772093792, now seen corresponding path program 1 times [2018-10-24 16:29:19,791 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:19,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:19,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:19,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:19,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:20,192 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-24 16:29:20,414 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 16:29:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 1205 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-24 16:29:20,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:20,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:29:20,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:29:20,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:29:20,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:29:20,786 INFO L87 Difference]: Start difference. First operand 6865 states and 7809 transitions. Second operand 5 states. [2018-10-24 16:29:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:22,612 INFO L93 Difference]: Finished difference Result 14981 states and 17236 transitions. [2018-10-24 16:29:22,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:29:22,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 651 [2018-10-24 16:29:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:22,642 INFO L225 Difference]: With dead ends: 14981 [2018-10-24 16:29:22,642 INFO L226 Difference]: Without dead ends: 8297 [2018-10-24 16:29:22,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:29:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8297 states. [2018-10-24 16:29:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8297 to 8297. [2018-10-24 16:29:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8297 states. [2018-10-24 16:29:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8297 states to 8297 states and 9329 transitions. [2018-10-24 16:29:22,762 INFO L78 Accepts]: Start accepts. Automaton has 8297 states and 9329 transitions. Word has length 651 [2018-10-24 16:29:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:22,763 INFO L481 AbstractCegarLoop]: Abstraction has 8297 states and 9329 transitions. [2018-10-24 16:29:22,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:29:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 8297 states and 9329 transitions. [2018-10-24 16:29:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-10-24 16:29:22,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:22,783 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:22,783 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:22,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:22,784 INFO L82 PathProgramCache]: Analyzing trace with hash 736057852, now seen corresponding path program 1 times [2018-10-24 16:29:22,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:22,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:22,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:22,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:22,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1017 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2018-10-24 16:29:23,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:23,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:29:23,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:29:23,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:29:23,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:29:23,509 INFO L87 Difference]: Start difference. First operand 8297 states and 9329 transitions. Second operand 4 states. [2018-10-24 16:29:25,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:25,409 INFO L93 Difference]: Finished difference Result 18023 states and 20321 transitions. [2018-10-24 16:29:25,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:29:25,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 713 [2018-10-24 16:29:25,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:25,427 INFO L225 Difference]: With dead ends: 18023 [2018-10-24 16:29:25,427 INFO L226 Difference]: Without dead ends: 9907 [2018-10-24 16:29:25,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 16:29:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9907 states. [2018-10-24 16:29:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9907 to 9907. [2018-10-24 16:29:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9907 states. [2018-10-24 16:29:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9907 states to 9907 states and 10862 transitions. [2018-10-24 16:29:25,540 INFO L78 Accepts]: Start accepts. Automaton has 9907 states and 10862 transitions. Word has length 713 [2018-10-24 16:29:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:25,541 INFO L481 AbstractCegarLoop]: Abstraction has 9907 states and 10862 transitions. [2018-10-24 16:29:25,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:29:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 9907 states and 10862 transitions. [2018-10-24 16:29:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2018-10-24 16:29:25,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:25,551 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:29:25,551 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:25,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:25,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1521446553, now seen corresponding path program 1 times [2018-10-24 16:29:25,552 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:25,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:25,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:25,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:25,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1737 backedges. 663 proven. 372 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2018-10-24 16:29:27,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:29:27,609 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:29:27,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:27,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:29:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1737 backedges. 612 proven. 0 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-10-24 16:29:28,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:29:28,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2018-10-24 16:29:28,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 16:29:28,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 16:29:28,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-10-24 16:29:28,431 INFO L87 Difference]: Start difference. First operand 9907 states and 10862 transitions. Second operand 13 states. [2018-10-24 16:29:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:34,213 INFO L93 Difference]: Finished difference Result 20481 states and 22627 transitions. [2018-10-24 16:29:34,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 16:29:34,220 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 769 [2018-10-24 16:29:34,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:34,242 INFO L225 Difference]: With dead ends: 20481 [2018-10-24 16:29:34,242 INFO L226 Difference]: Without dead ends: 10390 [2018-10-24 16:29:34,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 768 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-10-24 16:29:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10390 states. [2018-10-24 16:29:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10390 to 10262. [2018-10-24 16:29:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10262 states. [2018-10-24 16:29:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10262 states to 10262 states and 11066 transitions. [2018-10-24 16:29:34,375 INFO L78 Accepts]: Start accepts. Automaton has 10262 states and 11066 transitions. Word has length 769 [2018-10-24 16:29:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:34,376 INFO L481 AbstractCegarLoop]: Abstraction has 10262 states and 11066 transitions. [2018-10-24 16:29:34,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 16:29:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 10262 states and 11066 transitions. [2018-10-24 16:29:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2018-10-24 16:29:34,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:34,386 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:34,386 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:34,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:34,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1043164057, now seen corresponding path program 1 times [2018-10-24 16:29:34,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:34,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:34,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:34,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:34,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2018-10-24 16:29:35,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:35,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:29:35,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:29:35,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:29:35,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:29:35,351 INFO L87 Difference]: Start difference. First operand 10262 states and 11066 transitions. Second operand 5 states. [2018-10-24 16:29:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:36,888 INFO L93 Difference]: Finished difference Result 22325 states and 24082 transitions. [2018-10-24 16:29:36,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:29:36,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 809 [2018-10-24 16:29:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:36,913 INFO L225 Difference]: With dead ends: 22325 [2018-10-24 16:29:36,913 INFO L226 Difference]: Without dead ends: 12065 [2018-10-24 16:29:36,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:29:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12065 states. [2018-10-24 16:29:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12065 to 10982. [2018-10-24 16:29:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10982 states. [2018-10-24 16:29:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10982 states to 10982 states and 11846 transitions. [2018-10-24 16:29:37,056 INFO L78 Accepts]: Start accepts. Automaton has 10982 states and 11846 transitions. Word has length 809 [2018-10-24 16:29:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:37,057 INFO L481 AbstractCegarLoop]: Abstraction has 10982 states and 11846 transitions. [2018-10-24 16:29:37,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:29:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 10982 states and 11846 transitions. [2018-10-24 16:29:37,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2018-10-24 16:29:37,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:37,067 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:29:37,068 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:37,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1194644164, now seen corresponding path program 1 times [2018-10-24 16:29:37,068 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:37,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:37,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:37,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:37,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:37,807 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-24 16:29:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2243 backedges. 1245 proven. 0 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2018-10-24 16:29:38,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:29:38,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:29:38,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:29:38,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:29:38,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:29:38,128 INFO L87 Difference]: Start difference. First operand 10982 states and 11846 transitions. Second operand 4 states. [2018-10-24 16:29:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:29:39,403 INFO L93 Difference]: Finished difference Result 21783 states and 23510 transitions. [2018-10-24 16:29:39,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:29:39,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 854 [2018-10-24 16:29:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:29:39,417 INFO L225 Difference]: With dead ends: 21783 [2018-10-24 16:29:39,417 INFO L226 Difference]: Without dead ends: 10982 [2018-10-24 16:29:39,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:29:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10982 states. [2018-10-24 16:29:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10982 to 10982. [2018-10-24 16:29:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10982 states. [2018-10-24 16:29:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10982 states to 10982 states and 11713 transitions. [2018-10-24 16:29:39,547 INFO L78 Accepts]: Start accepts. Automaton has 10982 states and 11713 transitions. Word has length 854 [2018-10-24 16:29:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:29:39,548 INFO L481 AbstractCegarLoop]: Abstraction has 10982 states and 11713 transitions. [2018-10-24 16:29:39,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:29:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 10982 states and 11713 transitions. [2018-10-24 16:29:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2018-10-24 16:29:39,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:29:39,560 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:29:39,560 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:29:39,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:29:39,561 INFO L82 PathProgramCache]: Analyzing trace with hash -267445699, now seen corresponding path program 1 times [2018-10-24 16:29:39,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:29:39,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:29:39,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:39,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:39,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:29:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:40,272 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 16:29:40,659 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2018-10-24 16:29:41,174 WARN L179 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-10-24 16:29:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2492 backedges. 858 proven. 773 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-10-24 16:29:43,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:29:43,083 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:29:43,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:29:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:29:43,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:29:43,982 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-24 16:29:45,118 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 554 DAG size of output: 27 [2018-10-24 16:29:47,684 WARN L179 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 246 DAG size of output: 41 [2018-10-24 16:29:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2492 backedges. 634 proven. 733 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-10-24 16:29:49,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:29:49,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2018-10-24 16:29:49,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 16:29:49,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 16:29:49,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-10-24 16:29:49,936 INFO L87 Difference]: Start difference. First operand 10982 states and 11713 transitions. Second operand 16 states. [2018-10-24 16:30:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:10,265 INFO L93 Difference]: Finished difference Result 23251 states and 24787 transitions. [2018-10-24 16:30:10,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 16:30:10,266 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 928 [2018-10-24 16:30:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:10,279 INFO L225 Difference]: With dead ends: 23251 [2018-10-24 16:30:10,280 INFO L226 Difference]: Without dead ends: 12092 [2018-10-24 16:30:10,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 924 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2018-10-24 16:30:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12092 states. [2018-10-24 16:30:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12092 to 11161. [2018-10-24 16:30:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11161 states. [2018-10-24 16:30:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11161 states to 11161 states and 11898 transitions. [2018-10-24 16:30:10,541 INFO L78 Accepts]: Start accepts. Automaton has 11161 states and 11898 transitions. Word has length 928 [2018-10-24 16:30:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:10,542 INFO L481 AbstractCegarLoop]: Abstraction has 11161 states and 11898 transitions. [2018-10-24 16:30:10,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 16:30:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 11161 states and 11898 transitions. [2018-10-24 16:30:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1059 [2018-10-24 16:30:10,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:10,556 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:30:10,556 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:10,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:10,557 INFO L82 PathProgramCache]: Analyzing trace with hash 950184563, now seen corresponding path program 1 times [2018-10-24 16:30:10,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:10,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:10,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:10,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:10,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:11,221 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 16:30:11,553 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-24 16:30:12,055 WARN L179 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-10-24 16:30:12,254 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-10-24 16:30:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3322 backedges. 199 proven. 1861 refuted. 0 times theorem prover too weak. 1262 trivial. 0 not checked. [2018-10-24 16:30:14,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:30:14,401 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:30:14,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:30:14,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:30:23,291 WARN L179 SmtUtils]: Spent 8.15 s on a formula simplification. DAG size of input: 188 DAG size of output: 50 [2018-10-24 16:30:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3322 backedges. 489 proven. 351 refuted. 0 times theorem prover too weak. 2482 trivial. 0 not checked. [2018-10-24 16:30:25,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:30:25,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 15 [2018-10-24 16:30:25,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 16:30:25,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 16:30:25,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-10-24 16:30:25,638 INFO L87 Difference]: Start difference. First operand 11161 states and 11898 transitions. Second operand 16 states. [2018-10-24 16:30:43,844 WARN L179 SmtUtils]: Spent 11.97 s on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2018-10-24 16:30:48,022 WARN L179 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-24 16:30:58,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:30:58,808 INFO L93 Difference]: Finished difference Result 29170 states and 31154 transitions. [2018-10-24 16:30:58,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-24 16:30:58,808 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1058 [2018-10-24 16:30:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:30:58,826 INFO L225 Difference]: With dead ends: 29170 [2018-10-24 16:30:58,826 INFO L226 Difference]: Without dead ends: 17824 [2018-10-24 16:30:58,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1118 GetRequests, 1056 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=788, Invalid=2752, Unknown=0, NotChecked=0, Total=3540 [2018-10-24 16:30:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17824 states. [2018-10-24 16:30:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17824 to 12421. [2018-10-24 16:30:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12421 states. [2018-10-24 16:30:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12421 states to 12421 states and 13168 transitions. [2018-10-24 16:30:58,995 INFO L78 Accepts]: Start accepts. Automaton has 12421 states and 13168 transitions. Word has length 1058 [2018-10-24 16:30:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:30:58,996 INFO L481 AbstractCegarLoop]: Abstraction has 12421 states and 13168 transitions. [2018-10-24 16:30:58,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 16:30:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 12421 states and 13168 transitions. [2018-10-24 16:30:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2119 [2018-10-24 16:30:59,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:30:59,039 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 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] [2018-10-24 16:30:59,039 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:30:59,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:30:59,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1547180355, now seen corresponding path program 1 times [2018-10-24 16:30:59,040 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:30:59,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:30:59,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:59,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:30:59,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:30:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14444 backedges. 3095 proven. 0 refuted. 0 times theorem prover too weak. 11349 trivial. 0 not checked. [2018-10-24 16:31:02,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:31:02,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-24 16:31:02,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:31:02,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:31:02,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:31:02,087 INFO L87 Difference]: Start difference. First operand 12421 states and 13168 transitions. Second operand 7 states. [2018-10-24 16:31:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:04,459 INFO L93 Difference]: Finished difference Result 25899 states and 27511 transitions. [2018-10-24 16:31:04,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 16:31:04,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2118 [2018-10-24 16:31:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:04,470 INFO L225 Difference]: With dead ends: 25899 [2018-10-24 16:31:04,470 INFO L226 Difference]: Without dead ends: 12415 [2018-10-24 16:31:04,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:31:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12415 states. [2018-10-24 16:31:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12415 to 12415. [2018-10-24 16:31:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12415 states. [2018-10-24 16:31:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12415 states to 12415 states and 13111 transitions. [2018-10-24 16:31:04,616 INFO L78 Accepts]: Start accepts. Automaton has 12415 states and 13111 transitions. Word has length 2118 [2018-10-24 16:31:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:04,617 INFO L481 AbstractCegarLoop]: Abstraction has 12415 states and 13111 transitions. [2018-10-24 16:31:04,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:31:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 12415 states and 13111 transitions. [2018-10-24 16:31:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2153 [2018-10-24 16:31:04,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:04,651 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 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] [2018-10-24 16:31:04,651 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:04,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:04,652 INFO L82 PathProgramCache]: Analyzing trace with hash 372411892, now seen corresponding path program 1 times [2018-10-24 16:31:04,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:04,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:04,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:04,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:04,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:05,900 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 16:31:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 14891 backedges. 3466 proven. 39 refuted. 0 times theorem prover too weak. 11386 trivial. 0 not checked. [2018-10-24 16:31:07,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:31:07,589 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:31:07,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:08,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:31:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 14891 backedges. 3466 proven. 0 refuted. 0 times theorem prover too weak. 11425 trivial. 0 not checked. [2018-10-24 16:31:10,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:31:10,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-24 16:31:10,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:31:10,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:31:10,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:31:10,122 INFO L87 Difference]: Start difference. First operand 12415 states and 13111 transitions. Second operand 5 states. [2018-10-24 16:31:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:11,480 INFO L93 Difference]: Finished difference Result 23929 states and 25224 transitions. [2018-10-24 16:31:11,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:31:11,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2152 [2018-10-24 16:31:11,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:11,485 INFO L225 Difference]: With dead ends: 23929 [2018-10-24 16:31:11,485 INFO L226 Difference]: Without dead ends: 5018 [2018-10-24 16:31:11,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2156 GetRequests, 2153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:31:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2018-10-24 16:31:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 4660. [2018-10-24 16:31:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2018-10-24 16:31:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 4734 transitions. [2018-10-24 16:31:11,548 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 4734 transitions. Word has length 2152 [2018-10-24 16:31:11,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:11,550 INFO L481 AbstractCegarLoop]: Abstraction has 4660 states and 4734 transitions. [2018-10-24 16:31:11,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:31:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 4734 transitions. [2018-10-24 16:31:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2213 [2018-10-24 16:31:11,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:31:11,582 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:31:11,582 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:31:11,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:31:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash 734032280, now seen corresponding path program 1 times [2018-10-24 16:31:11,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:31:11,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:31:11,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:11,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:11,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:31:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:13,031 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 16:31:13,238 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 16:31:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15131 backedges. 3743 proven. 39 refuted. 0 times theorem prover too weak. 11349 trivial. 0 not checked. [2018-10-24 16:31:16,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:31:16,030 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:31:16,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:31:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:31:16,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:31:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15131 backedges. 3782 proven. 0 refuted. 0 times theorem prover too weak. 11349 trivial. 0 not checked. [2018-10-24 16:31:18,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 16:31:18,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-10-24 16:31:18,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 16:31:18,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 16:31:18,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 16:31:18,982 INFO L87 Difference]: Start difference. First operand 4660 states and 4734 transitions. Second operand 10 states. [2018-10-24 16:31:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:31:22,508 INFO L93 Difference]: Finished difference Result 9324 states and 9475 transitions. [2018-10-24 16:31:22,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 16:31:22,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 2212 [2018-10-24 16:31:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:31:22,510 INFO L225 Difference]: With dead ends: 9324 [2018-10-24 16:31:22,510 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 16:31:22,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2227 GetRequests, 2215 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-24 16:31:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 16:31:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 16:31:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 16:31:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 16:31:22,519 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2212 [2018-10-24 16:31:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:31:22,520 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 16:31:22,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 16:31:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 16:31:22,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 16:31:22,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 16:31:22,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:22,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,313 WARN L179 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 630 DAG size of output: 311 [2018-10-24 16:31:23,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:23,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:24,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:24,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:31:24,028 WARN L179 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 630 DAG size of output: 311 [2018-10-24 16:31:28,120 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 264 DAG size of output: 111 [2018-10-24 16:31:29,641 WARN L179 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 264 DAG size of output: 111 [2018-10-24 16:31:29,645 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-10-24 16:31:29,645 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-10-24 16:31:29,645 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,645 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,645 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,645 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-10-24 16:31:29,645 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-24 16:31:29,645 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-24 16:31:29,646 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-10-24 16:31:29,647 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,648 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,649 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-10-24 16:31:29,649 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-24 16:31:29,649 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-24 16:31:29,649 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-24 16:31:29,649 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-10-24 16:31:29,649 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-10-24 16:31:29,649 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-10-24 16:31:29,649 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-10-24 16:31:29,649 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-10-24 16:31:29,650 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,650 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,650 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,650 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-10-24 16:31:29,650 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-24 16:31:29,650 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-24 16:31:29,650 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-24 16:31:29,650 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-10-24 16:31:29,650 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-10-24 16:31:29,651 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-10-24 16:31:29,651 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-10-24 16:31:29,651 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,651 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,651 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,651 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-24 16:31:29,651 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-24 16:31:29,651 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-24 16:31:29,651 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-10-24 16:31:29,651 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-10-24 16:31:29,652 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-10-24 16:31:29,652 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-10-24 16:31:29,652 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-10-24 16:31:29,652 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,652 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,652 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,652 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-10-24 16:31:29,652 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-10-24 16:31:29,652 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 16:31:29,652 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-24 16:31:29,653 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-24 16:31:29,653 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-24 16:31:29,653 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-10-24 16:31:29,653 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-10-24 16:31:29,653 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-10-24 16:31:29,653 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,653 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,653 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,653 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-24 16:31:29,653 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-24 16:31:29,654 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-24 16:31:29,654 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-10-24 16:31:29,654 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-10-24 16:31:29,654 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-10-24 16:31:29,654 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-10-24 16:31:29,654 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-10-24 16:31:29,654 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,654 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,654 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,654 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-10-24 16:31:29,655 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-10-24 16:31:29,655 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-24 16:31:29,655 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-24 16:31:29,655 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-24 16:31:29,655 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-10-24 16:31:29,655 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 16:31:29,655 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-10-24 16:31:29,655 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-10-24 16:31:29,655 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,655 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,655 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,656 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-10-24 16:31:29,656 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-24 16:31:29,656 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-24 16:31:29,656 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-24 16:31:29,656 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-10-24 16:31:29,656 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-10-24 16:31:29,656 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-10-24 16:31:29,656 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-10-24 16:31:29,656 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,656 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,657 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,657 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-10-24 16:31:29,657 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-24 16:31:29,657 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-24 16:31:29,657 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-24 16:31:29,657 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-10-24 16:31:29,657 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-10-24 16:31:29,657 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-10-24 16:31:29,657 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-10-24 16:31:29,658 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,658 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,658 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-10-24 16:31:29,658 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-24 16:31:29,658 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-24 16:31:29,658 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-10-24 16:31:29,658 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-10-24 16:31:29,658 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-10-24 16:31:29,658 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-10-24 16:31:29,659 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-10-24 16:31:29,659 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,659 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,659 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-10-24 16:31:29,659 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-24 16:31:29,659 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-24 16:31:29,659 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-10-24 16:31:29,659 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-10-24 16:31:29,659 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-10-24 16:31:29,659 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,660 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,660 INFO L421 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse7 (= ~a15~0 8))) (let ((.cse3 (= ~a21~0 7)) (.cse8 (exists ((v_prenex_43 Int)) (and (<= ~a12~0 (+ (mod v_prenex_43 299959) 300039)) (< 80 v_prenex_43) (<= 0 v_prenex_43)))) (.cse15 (<= ~a12~0 73282)) (.cse6 (= ~a21~0 10)) (.cse5 (<= ~a12~0 11)) (.cse9 (<= ~a12~0 80)) (.cse14 (= ~a21~0 9)) (.cse10 (= ~a15~0 9)) (.cse1 (not (= ~a15~0 5))) (.cse16 (= ~a21~0 8)) (.cse13 (<= ~a12~0 599997)) (.cse2 (= ~a24~0 1)) (.cse11 (< 80 ~a12~0)) (.cse12 (= ~a21~0 6)) (.cse0 (not .cse7)) (.cse4 (<= ~a15~0 8))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (and .cse2 .cse3 .cse5 .cse4) (and .cse6 (and .cse7 .cse2) .cse8) (and (= ~a15~0 7) .cse2 .cse6) (and .cse9 .cse2 .cse3 .cse0 .cse4) (and .cse2 .cse10 .cse11) (and .cse12 (and (<= (+ ~a12~0 43) 0) .cse2) .cse4) (and .cse1 .cse13 .cse2 .cse0 .cse4 .cse14) (and .cse12 .cse2 .cse0 (or .cse5 .cse11) .cse4) (and .cse2 (and .cse9 .cse6 .cse4)) (and .cse15 .cse2 .cse6 .cse8 .cse4) (and .cse6 (and .cse7 (<= ~a12~0 225870) .cse2)) (and .cse12 .cse1 .cse2 .cse0 .cse4) (and .cse2 (and .cse15 .cse7 .cse16)) (and .cse2 .cse6 .cse10 .cse5) (and .cse9 .cse2 .cse16 .cse4) (and .cse9 .cse2 .cse4 .cse14) (and .cse2 .cse10 .cse16) (and .cse1 .cse2 .cse16 .cse0 .cse4) (and .cse12 .cse13 .cse2 .cse4 .cse11) (and .cse12 (exists ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse19 (mod v_prenex_42 299959))) (let ((.cse18 (div v_prenex_41 5)) (.cse17 (+ .cse19 81))) (and (<= 0 .cse17) (< 11 v_prenex_42) (< 80 v_prenex_41) (< 0 (+ v_prenex_42 43)) (not (= (mod (+ .cse18 4) 5) 0)) (< .cse18 345781) (<= 0 v_prenex_41) (<= 299878 .cse19) (<= 0 v_prenex_42) (<= ~a12~0 (+ (div (+ .cse18 (- 345781)) 5) 1)) (<= v_prenex_41 (+ (div .cse17 5) 165863)))))) .cse0 .cse4)))) [2018-10-24 16:31:29,660 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-10-24 16:31:29,660 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-10-24 16:31:29,661 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-24 16:31:29,661 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-24 16:31:29,661 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-10-24 16:31:29,661 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-10-24 16:31:29,661 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-10-24 16:31:29,661 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-10-24 16:31:29,661 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,661 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,661 INFO L428 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-10-24 16:31:29,661 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-10-24 16:31:29,661 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-10-24 16:31:29,662 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-24 16:31:29,662 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-24 16:31:29,662 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-10-24 16:31:29,662 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-10-24 16:31:29,662 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-10-24 16:31:29,662 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,662 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,662 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-10-24 16:31:29,662 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-10-24 16:31:29,662 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-24 16:31:29,663 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-24 16:31:29,663 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 16:31:29,663 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-10-24 16:31:29,663 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-10-24 16:31:29,663 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,663 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,663 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-24 16:31:29,663 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,663 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-10-24 16:31:29,663 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-10-24 16:31:29,664 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse7 (= ~a15~0 8))) (let ((.cse3 (= ~a21~0 7)) (.cse8 (exists ((v_prenex_43 Int)) (and (<= ~a12~0 (+ (mod v_prenex_43 299959) 300039)) (< 80 v_prenex_43) (<= 0 v_prenex_43)))) (.cse15 (<= ~a12~0 73282)) (.cse6 (= ~a21~0 10)) (.cse5 (<= ~a12~0 11)) (.cse9 (<= ~a12~0 80)) (.cse14 (= ~a21~0 9)) (.cse10 (= ~a15~0 9)) (.cse1 (not (= ~a15~0 5))) (.cse16 (= ~a21~0 8)) (.cse13 (<= ~a12~0 599997)) (.cse2 (= ~a24~0 1)) (.cse11 (< 80 ~a12~0)) (.cse12 (= ~a21~0 6)) (.cse0 (not .cse7)) (.cse4 (<= ~a15~0 8))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (and .cse2 .cse3 .cse5 .cse4) (and .cse6 (and .cse7 .cse2) .cse8) (and (= ~a15~0 7) .cse2 .cse6) (and .cse9 .cse2 .cse3 .cse0 .cse4) (and .cse2 .cse10 .cse11) (and .cse12 (and (<= (+ ~a12~0 43) 0) .cse2) .cse4) (and .cse1 .cse13 .cse2 .cse0 .cse4 .cse14) (and .cse12 .cse2 .cse0 (or .cse5 .cse11) .cse4) (and .cse2 (and .cse9 .cse6 .cse4)) (and .cse15 .cse2 .cse6 .cse8 .cse4) (and .cse6 (and .cse7 (<= ~a12~0 225870) .cse2)) (and .cse12 .cse1 .cse2 .cse0 .cse4) (and .cse2 (and .cse15 .cse7 .cse16)) (and .cse2 .cse6 .cse10 .cse5) (and .cse9 .cse2 .cse16 .cse4) (and .cse9 .cse2 .cse4 .cse14) (and .cse2 .cse10 .cse16) (and .cse1 .cse2 .cse16 .cse0 .cse4) (and .cse12 .cse13 .cse2 .cse4 .cse11) (and .cse12 (exists ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse19 (mod v_prenex_42 299959))) (let ((.cse18 (div v_prenex_41 5)) (.cse17 (+ .cse19 81))) (and (<= 0 .cse17) (< 11 v_prenex_42) (< 80 v_prenex_41) (< 0 (+ v_prenex_42 43)) (not (= (mod (+ .cse18 4) 5) 0)) (< .cse18 345781) (<= 0 v_prenex_41) (<= 299878 .cse19) (<= 0 v_prenex_42) (<= ~a12~0 (+ (div (+ .cse18 (- 345781)) 5) 1)) (<= v_prenex_41 (+ (div .cse17 5) 165863)))))) .cse0 .cse4)))) [2018-10-24 16:31:29,664 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-10-24 16:31:29,664 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-10-24 16:31:29,664 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-24 16:31:29,664 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-24 16:31:29,664 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-24 16:31:29,664 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-10-24 16:31:29,664 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-10-24 16:31:29,664 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-10-24 16:31:29,664 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-10-24 16:31:29,664 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,664 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-10-24 16:31:29,665 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-24 16:31:29,666 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-10-24 16:31:29,667 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-10-24 16:31:29,667 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-10-24 16:31:29,667 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-10-24 16:31:29,667 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-10-24 16:31:29,667 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2018-10-24 16:31:29,667 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,667 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,667 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-10-24 16:31:29,667 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-10-24 16:31:29,667 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-24 16:31:29,668 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-24 16:31:29,668 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-24 16:31:29,668 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-10-24 16:31:29,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,677 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,677 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,678 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,679 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,679 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,680 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,680 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,680 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,694 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,694 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,695 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,695 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,695 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,696 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,696 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,696 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,701 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,702 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,702 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,703 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,703 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,703 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,704 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,704 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,704 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,704 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,705 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,705 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,705 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,705 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,706 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,706 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,706 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,706 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,708 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,709 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,709 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,709 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,709 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,710 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,710 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,710 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:31:29 BoogieIcfgContainer [2018-10-24 16:31:29,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:31:29,717 INFO L168 Benchmark]: Toolchain (without parser) took 167733.00 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -744.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-24 16:31:29,718 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 16:31:29,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.94 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-10-24 16:31:29,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 240.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2018-10-24 16:31:29,720 INFO L168 Benchmark]: Boogie Preprocessor took 103.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-24 16:31:29,721 INFO L168 Benchmark]: RCFGBuilder took 3520.11 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 134.0 MB). Peak memory consumption was 134.0 MB. Max. memory is 7.1 GB. [2018-10-24 16:31:29,722 INFO L168 Benchmark]: TraceAbstraction took 163037.23 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.2 GB in the end (delta: -117.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-24 16:31:29,727 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.94 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 240.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.44 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3520.11 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 134.0 MB). Peak memory consumption was 134.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 163037.23 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.2 GB in the end (delta: -117.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: 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: 880]: Loop Invariant [2018-10-24 16:31:29,740 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,740 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,740 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,741 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,741 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,741 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,742 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,742 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,742 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,742 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,742 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,743 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,743 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,743 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,743 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,743 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,744 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,744 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,745 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,746 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,746 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,746 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,747 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,747 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,747 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,747 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,748 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,748 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,748 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,748 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,748 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,748 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,749 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,749 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,749 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,749 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((!(a15 == 8) && ((!(a15 == 5) && a24 == 1) && a21 == 7) && a15 <= 8) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((a21 == 10 && a15 == 8 && a24 == 1) && (\exists v_prenex_43 : int :: (a12 <= v_prenex_43 % 299959 + 300039 && 80 < v_prenex_43) && 0 <= v_prenex_43))) || ((a15 == 7 && a24 == 1) && a21 == 10)) || ((((a12 <= 80 && a24 == 1) && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || ((a21 == 6 && a12 + 43 <= 0 && a24 == 1) && a15 <= 8)) || (((((!(a15 == 5) && a12 <= 599997) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && a21 == 9)) || ((((a21 == 6 && a24 == 1) && !(a15 == 8)) && (a12 <= 11 || 80 < a12)) && a15 <= 8)) || (a24 == 1 && (a12 <= 80 && a21 == 10) && a15 <= 8)) || ((((a12 <= 73282 && a24 == 1) && a21 == 10) && (\exists v_prenex_43 : int :: (a12 <= v_prenex_43 % 299959 + 300039 && 80 < v_prenex_43) && 0 <= v_prenex_43)) && a15 <= 8)) || (a21 == 10 && (a15 == 8 && a12 <= 225870) && a24 == 1)) || ((((a21 == 6 && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && a15 <= 8)) || (a24 == 1 && (a12 <= 73282 && a15 == 8) && a21 == 8)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (((a12 <= 80 && a24 == 1) && a21 == 8) && a15 <= 8)) || (((a12 <= 80 && a24 == 1) && a15 <= 8) && a21 == 9)) || ((a24 == 1 && a15 == 9) && a21 == 8)) || ((((!(a15 == 5) && a24 == 1) && a21 == 8) && !(a15 == 8)) && a15 <= 8)) || ((((a21 == 6 && a12 <= 599997) && a24 == 1) && a15 <= 8) && 80 < a12)) || (((a21 == 6 && (\exists v_prenex_41 : int, v_prenex_42 : int :: (((((((((0 <= v_prenex_42 % 299959 + 81 && 11 < v_prenex_42) && 80 < v_prenex_41) && 0 < v_prenex_42 + 43) && !((v_prenex_41 / 5 + 4) % 5 == 0)) && v_prenex_41 / 5 < 345781) && 0 <= v_prenex_41) && 299878 <= v_prenex_42 % 299959) && 0 <= v_prenex_42) && a12 <= (v_prenex_41 / 5 + -345781) / 5 + 1) && v_prenex_41 <= (v_prenex_42 % 299959 + 81) / 5 + 165863)) && !(a15 == 8)) && a15 <= 8) - InvariantResult [Line: 20]: Loop Invariant [2018-10-24 16:31:29,751 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,751 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,751 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,752 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,752 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,752 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,752 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,753 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,753 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,753 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,753 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,753 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,754 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,754 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,754 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,754 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,754 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,754 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,756 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,756 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,756 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,757 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,757 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,757 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_43,QUANTIFIED] [2018-10-24 16:31:29,758 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,758 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,758 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,758 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,758 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] [2018-10-24 16:31:29,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-10-24 16:31:29,760 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_42,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((!(a15 == 8) && ((!(a15 == 5) && a24 == 1) && a21 == 7) && a15 <= 8) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((a21 == 10 && a15 == 8 && a24 == 1) && (\exists v_prenex_43 : int :: (a12 <= v_prenex_43 % 299959 + 300039 && 80 < v_prenex_43) && 0 <= v_prenex_43))) || ((a15 == 7 && a24 == 1) && a21 == 10)) || ((((a12 <= 80 && a24 == 1) && a21 == 7) && !(a15 == 8)) && a15 <= 8)) || ((a24 == 1 && a15 == 9) && 80 < a12)) || ((a21 == 6 && a12 + 43 <= 0 && a24 == 1) && a15 <= 8)) || (((((!(a15 == 5) && a12 <= 599997) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && a21 == 9)) || ((((a21 == 6 && a24 == 1) && !(a15 == 8)) && (a12 <= 11 || 80 < a12)) && a15 <= 8)) || (a24 == 1 && (a12 <= 80 && a21 == 10) && a15 <= 8)) || ((((a12 <= 73282 && a24 == 1) && a21 == 10) && (\exists v_prenex_43 : int :: (a12 <= v_prenex_43 % 299959 + 300039 && 80 < v_prenex_43) && 0 <= v_prenex_43)) && a15 <= 8)) || (a21 == 10 && (a15 == 8 && a12 <= 225870) && a24 == 1)) || ((((a21 == 6 && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && a15 <= 8)) || (a24 == 1 && (a12 <= 73282 && a15 == 8) && a21 == 8)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (((a12 <= 80 && a24 == 1) && a21 == 8) && a15 <= 8)) || (((a12 <= 80 && a24 == 1) && a15 <= 8) && a21 == 9)) || ((a24 == 1 && a15 == 9) && a21 == 8)) || ((((!(a15 == 5) && a24 == 1) && a21 == 8) && !(a15 == 8)) && a15 <= 8)) || ((((a21 == 6 && a12 <= 599997) && a24 == 1) && a15 <= 8) && 80 < a12)) || (((a21 == 6 && (\exists v_prenex_41 : int, v_prenex_42 : int :: (((((((((0 <= v_prenex_42 % 299959 + 81 && 11 < v_prenex_42) && 80 < v_prenex_41) && 0 < v_prenex_42 + 43) && !((v_prenex_41 / 5 + 4) % 5 == 0)) && v_prenex_41 / 5 < 345781) && 0 <= v_prenex_41) && 299878 <= v_prenex_42 % 299959) && 0 <= v_prenex_42) && a12 <= (v_prenex_41 / 5 + -345781) / 5 + 1) && v_prenex_41 <= (v_prenex_42 % 299959 + 81) / 5 + 165863)) && !(a15 == 8)) && a15 <= 8) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. SAFE Result, 162.9s OverallTime, 17 OverallIterations, 18 TraceHistogramMax, 99.4s AutomataDifference, 0.0s DeadEndRemovalTime, 7.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2474 SDtfs, 22824 SDslu, 3054 SDs, 0 SdLazy, 38419 SolverSat, 5248 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 69.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7905 GetRequests, 7720 SyntacticMatches, 23 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 40.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12421occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 11048 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 178 NumberOfFragments, 809 HoareAnnotationTreeSize, 3 FomulaSimplifications, 56490 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6406 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 37.6s InterpolantComputationTime, 21881 NumberOfCodeBlocks, 21881 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 21857 ConstructedInterpolants, 228 QuantifiedInterpolants, 88648186 SizeOfPredicates, 13 NumberOfNonLiveVariables, 9323 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 24 InterpolantComputations, 14 PerfectInterpolantSequences, 95755/99997 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...