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/Problem11_label41_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 20:03:16,248 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 20:03:16,250 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 20:03:16,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 20:03:16,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 20:03:16,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 20:03:16,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 20:03:16,269 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 20:03:16,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 20:03:16,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 20:03:16,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 20:03:16,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 20:03:16,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 20:03:16,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 20:03:16,276 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 20:03:16,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 20:03:16,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 20:03:16,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 20:03:16,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 20:03:16,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 20:03:16,284 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 20:03:16,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 20:03:16,287 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 20:03:16,288 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 20:03:16,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 20:03:16,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 20:03:16,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 20:03:16,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 20:03:16,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 20:03:16,292 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 20:03:16,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 20:03:16,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 20:03:16,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 20:03:16,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 20:03:16,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 20:03:16,295 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 20:03:16,296 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-23 20:03:16,325 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 20:03:16,325 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 20:03:16,328 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 20:03:16,328 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 20:03:16,329 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 20:03:16,329 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 20:03:16,330 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 20:03:16,330 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 20:03:16,330 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 20:03:16,330 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 20:03:16,330 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 20:03:16,331 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 20:03:16,331 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 20:03:16,331 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 20:03:16,331 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 20:03:16,331 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 20:03:16,332 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 20:03:16,332 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 20:03:16,332 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 20:03:16,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:03:16,332 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 20:03:16,332 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 20:03:16,334 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 20:03:16,334 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 20:03:16,334 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 20:03:16,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 20:03:16,334 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 20:03:16,335 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 20:03:16,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 20:03:16,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 20:03:16,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 20:03:16,419 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 20:03:16,420 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 20:03:16,421 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label41_true-unreach-call.c [2018-10-23 20:03:16,478 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e275b639a/bfaf7db51402433c8fbb4fcc5cec0562/FLAGb4eae4f0d [2018-10-23 20:03:17,103 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 20:03:17,104 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label41_true-unreach-call.c [2018-10-23 20:03:17,127 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e275b639a/bfaf7db51402433c8fbb4fcc5cec0562/FLAGb4eae4f0d [2018-10-23 20:03:17,146 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e275b639a/bfaf7db51402433c8fbb4fcc5cec0562 [2018-10-23 20:03:17,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 20:03:17,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 20:03:17,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 20:03:17,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 20:03:17,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 20:03:17,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:03:17" (1/1) ... [2018-10-23 20:03:17,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8b281a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:17, skipping insertion in model container [2018-10-23 20:03:17,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:03:17" (1/1) ... [2018-10-23 20:03:17,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 20:03:17,262 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 20:03:17,874 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:03:17,879 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 20:03:18,138 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:03:18,157 INFO L193 MainTranslator]: Completed translation [2018-10-23 20:03:18,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:18 WrapperNode [2018-10-23 20:03:18,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 20:03:18,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 20:03:18,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 20:03:18,160 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 20:03:18,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:18" (1/1) ... [2018-10-23 20:03:18,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:18" (1/1) ... [2018-10-23 20:03:18,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 20:03:18,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 20:03:18,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 20:03:18,454 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 20:03:18,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:18" (1/1) ... [2018-10-23 20:03:18,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:18" (1/1) ... [2018-10-23 20:03:18,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:18" (1/1) ... [2018-10-23 20:03:18,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:18" (1/1) ... [2018-10-23 20:03:18,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:18" (1/1) ... [2018-10-23 20:03:18,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:18" (1/1) ... [2018-10-23 20:03:18,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:18" (1/1) ... [2018-10-23 20:03:18,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 20:03:18,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 20:03:18,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 20:03:18,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 20:03:18,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:18" (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-23 20:03:18,678 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 20:03:18,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 20:03:18,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 20:03:23,635 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 20:03:23,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:03:23 BoogieIcfgContainer [2018-10-23 20:03:23,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 20:03:23,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 20:03:23,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 20:03:23,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 20:03:23,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:03:17" (1/3) ... [2018-10-23 20:03:23,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354f810b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:03:23, skipping insertion in model container [2018-10-23 20:03:23,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:03:18" (2/3) ... [2018-10-23 20:03:23,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354f810b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:03:23, skipping insertion in model container [2018-10-23 20:03:23,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:03:23" (3/3) ... [2018-10-23 20:03:23,649 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label41_true-unreach-call.c [2018-10-23 20:03:23,659 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 20:03:23,671 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 20:03:23,689 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 20:03:23,728 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 20:03:23,729 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 20:03:23,729 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 20:03:23,729 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 20:03:23,730 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 20:03:23,730 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 20:03:23,730 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 20:03:23,730 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 20:03:23,731 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 20:03:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-10-23 20:03:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-23 20:03:23,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:03:23,766 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] [2018-10-23 20:03:23,768 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:03:23,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:03:23,775 INFO L82 PathProgramCache]: Analyzing trace with hash 682595178, now seen corresponding path program 1 times [2018-10-23 20:03:23,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:03:23,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:03:23,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:23,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:03:23,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:03:24,178 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-23 20:03:24,184 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-23 20:03:24,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:03:24,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:03:24,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:03:24,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:03:24,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:03:24,213 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-10-23 20:03:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:03:27,987 INFO L93 Difference]: Finished difference Result 955 states and 1722 transitions. [2018-10-23 20:03:27,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:03:27,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-10-23 20:03:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:03:28,015 INFO L225 Difference]: With dead ends: 955 [2018-10-23 20:03:28,015 INFO L226 Difference]: Without dead ends: 664 [2018-10-23 20:03:28,022 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-23 20:03:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-10-23 20:03:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 472. [2018-10-23 20:03:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-23 20:03:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 716 transitions. [2018-10-23 20:03:28,113 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 716 transitions. Word has length 22 [2018-10-23 20:03:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:03:28,114 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 716 transitions. [2018-10-23 20:03:28,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:03:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 716 transitions. [2018-10-23 20:03:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-23 20:03:28,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:03:28,118 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-23 20:03:28,118 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:03:28,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:03:28,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1022137437, now seen corresponding path program 1 times [2018-10-23 20:03:28,119 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:03:28,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:03:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:28,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:03:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:03:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:03:28,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:03:28,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:03:28,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:03:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:03:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:03:28,383 INFO L87 Difference]: Start difference. First operand 472 states and 716 transitions. Second operand 4 states. [2018-10-23 20:03:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:03:31,828 INFO L93 Difference]: Finished difference Result 1700 states and 2661 transitions. [2018-10-23 20:03:31,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:03:31,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-10-23 20:03:31,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:03:31,838 INFO L225 Difference]: With dead ends: 1700 [2018-10-23 20:03:31,838 INFO L226 Difference]: Without dead ends: 1230 [2018-10-23 20:03:31,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:03:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2018-10-23 20:03:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1216. [2018-10-23 20:03:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-10-23 20:03:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1756 transitions. [2018-10-23 20:03:31,886 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1756 transitions. Word has length 91 [2018-10-23 20:03:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:03:31,887 INFO L481 AbstractCegarLoop]: Abstraction has 1216 states and 1756 transitions. [2018-10-23 20:03:31,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:03:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1756 transitions. [2018-10-23 20:03:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-23 20:03:31,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:03:31,891 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-23 20:03:31,891 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:03:31,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:03:31,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1669703823, now seen corresponding path program 1 times [2018-10-23 20:03:31,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:03:31,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:03:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:31,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:03:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:03:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:03:32,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:03:32,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:03:32,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:03:32,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:03:32,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:03:32,052 INFO L87 Difference]: Start difference. First operand 1216 states and 1756 transitions. Second operand 4 states. [2018-10-23 20:03:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:03:35,699 INFO L93 Difference]: Finished difference Result 4494 states and 6609 transitions. [2018-10-23 20:03:35,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:03:35,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-10-23 20:03:35,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:03:35,716 INFO L225 Difference]: With dead ends: 4494 [2018-10-23 20:03:35,717 INFO L226 Difference]: Without dead ends: 3280 [2018-10-23 20:03:35,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:03:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2018-10-23 20:03:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 2327. [2018-10-23 20:03:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2018-10-23 20:03:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 3050 transitions. [2018-10-23 20:03:35,775 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 3050 transitions. Word has length 99 [2018-10-23 20:03:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:03:35,776 INFO L481 AbstractCegarLoop]: Abstraction has 2327 states and 3050 transitions. [2018-10-23 20:03:35,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:03:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 3050 transitions. [2018-10-23 20:03:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-23 20:03:35,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:03:35,781 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:03:35,781 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:03:35,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:03:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2052942401, now seen corresponding path program 1 times [2018-10-23 20:03:35,782 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:03:35,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:03:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:35,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:03:35,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:03:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:03:36,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:03:36,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:03:36,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:03:36,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:03:36,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:03:36,191 INFO L87 Difference]: Start difference. First operand 2327 states and 3050 transitions. Second operand 4 states. [2018-10-23 20:03:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:03:40,206 INFO L93 Difference]: Finished difference Result 5960 states and 7948 transitions. [2018-10-23 20:03:40,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:03:40,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-10-23 20:03:40,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:03:40,229 INFO L225 Difference]: With dead ends: 5960 [2018-10-23 20:03:40,229 INFO L226 Difference]: Without dead ends: 3820 [2018-10-23 20:03:40,233 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-23 20:03:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2018-10-23 20:03:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3438. [2018-10-23 20:03:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3438 states. [2018-10-23 20:03:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4460 transitions. [2018-10-23 20:03:40,313 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4460 transitions. Word has length 150 [2018-10-23 20:03:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:03:40,314 INFO L481 AbstractCegarLoop]: Abstraction has 3438 states and 4460 transitions. [2018-10-23 20:03:40,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:03:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4460 transitions. [2018-10-23 20:03:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-23 20:03:40,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:03:40,330 INFO L375 BasicCegarLoop]: trace histogram [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, 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-23 20:03:40,330 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:03:40,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:03:40,330 INFO L82 PathProgramCache]: Analyzing trace with hash 482276609, now seen corresponding path program 1 times [2018-10-23 20:03:40,331 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:03:40,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:03:40,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:40,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:03:40,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:03:41,240 WARN L179 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-10-23 20:03:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 39 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:03:41,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:03:41,528 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-23 20:03:41,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:03:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:03:41,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:03:42,600 WARN L179 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 20 [2018-10-23 20:03:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-23 20:03:42,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:03:42,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-10-23 20:03:42,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 20:03:42,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 20:03:42,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:03:42,766 INFO L87 Difference]: Start difference. First operand 3438 states and 4460 transitions. Second operand 8 states. [2018-10-23 20:03:43,019 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-23 20:03:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:03:56,537 INFO L93 Difference]: Finished difference Result 18190 states and 24162 transitions. [2018-10-23 20:03:56,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-23 20:03:56,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 206 [2018-10-23 20:03:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:03:56,586 INFO L225 Difference]: With dead ends: 18190 [2018-10-23 20:03:56,586 INFO L226 Difference]: Without dead ends: 11372 [2018-10-23 20:03:56,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2018-10-23 20:03:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11372 states. [2018-10-23 20:03:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11372 to 10067. [2018-10-23 20:03:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10067 states. [2018-10-23 20:03:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10067 states to 10067 states and 11590 transitions. [2018-10-23 20:03:56,802 INFO L78 Accepts]: Start accepts. Automaton has 10067 states and 11590 transitions. Word has length 206 [2018-10-23 20:03:56,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:03:56,803 INFO L481 AbstractCegarLoop]: Abstraction has 10067 states and 11590 transitions. [2018-10-23 20:03:56,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 20:03:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 10067 states and 11590 transitions. [2018-10-23 20:03:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-23 20:03:56,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:03:56,817 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-10-23 20:03:56,818 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:03:56,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:03:56,818 INFO L82 PathProgramCache]: Analyzing trace with hash -993046551, now seen corresponding path program 1 times [2018-10-23 20:03:56,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:03:56,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:03:56,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:56,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:03:56,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:03:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:03:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:03:57,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:03:57,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:03:57,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:03:57,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:03:57,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:03:57,360 INFO L87 Difference]: Start difference. First operand 10067 states and 11590 transitions. Second operand 5 states. [2018-10-23 20:04:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:00,466 INFO L93 Difference]: Finished difference Result 25150 states and 29098 transitions. [2018-10-23 20:04:00,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:04:00,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 306 [2018-10-23 20:04:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:00,515 INFO L225 Difference]: With dead ends: 25150 [2018-10-23 20:04:00,515 INFO L226 Difference]: Without dead ends: 15085 [2018-10-23 20:04:00,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-23 20:04:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15085 states. [2018-10-23 20:04:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15085 to 13407. [2018-10-23 20:04:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13407 states. [2018-10-23 20:04:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13407 states to 13407 states and 15397 transitions. [2018-10-23 20:04:00,744 INFO L78 Accepts]: Start accepts. Automaton has 13407 states and 15397 transitions. Word has length 306 [2018-10-23 20:04:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:00,745 INFO L481 AbstractCegarLoop]: Abstraction has 13407 states and 15397 transitions. [2018-10-23 20:04:00,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:04:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 13407 states and 15397 transitions. [2018-10-23 20:04:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-23 20:04:00,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:00,763 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:04:00,763 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:00,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:00,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1731558857, now seen corresponding path program 1 times [2018-10-23 20:04:00,764 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:00,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:00,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:00,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:00,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:01,341 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-23 20:04:01,672 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-10-23 20:04:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-23 20:04:01,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:04:01,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 20:04:01,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:04:01,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:04:01,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:04:01,793 INFO L87 Difference]: Start difference. First operand 13407 states and 15397 transitions. Second operand 5 states. [2018-10-23 20:04:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:04,093 INFO L93 Difference]: Finished difference Result 28504 states and 32797 transitions. [2018-10-23 20:04:04,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:04:04,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 328 [2018-10-23 20:04:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:04,126 INFO L225 Difference]: With dead ends: 28504 [2018-10-23 20:04:04,126 INFO L226 Difference]: Without dead ends: 15099 [2018-10-23 20:04:04,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:04:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15099 states. [2018-10-23 20:04:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15099 to 12299. [2018-10-23 20:04:04,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12299 states. [2018-10-23 20:04:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12299 states to 12299 states and 14171 transitions. [2018-10-23 20:04:04,326 INFO L78 Accepts]: Start accepts. Automaton has 12299 states and 14171 transitions. Word has length 328 [2018-10-23 20:04:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:04,327 INFO L481 AbstractCegarLoop]: Abstraction has 12299 states and 14171 transitions. [2018-10-23 20:04:04,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:04:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 14171 transitions. [2018-10-23 20:04:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-23 20:04:04,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:04,341 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 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-23 20:04:04,341 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:04,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:04,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1879326908, now seen corresponding path program 1 times [2018-10-23 20:04:04,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:04,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:04,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-10-23 20:04:04,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:04:04,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:04:04,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:04:04,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:04:04,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:04:04,618 INFO L87 Difference]: Start difference. First operand 12299 states and 14171 transitions. Second operand 3 states. [2018-10-23 20:04:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:06,377 INFO L93 Difference]: Finished difference Result 21993 states and 25449 transitions. [2018-10-23 20:04:06,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:04:06,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-10-23 20:04:06,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:06,394 INFO L225 Difference]: With dead ends: 21993 [2018-10-23 20:04:06,394 INFO L226 Difference]: Without dead ends: 9695 [2018-10-23 20:04:06,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:04:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9695 states. [2018-10-23 20:04:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9695 to 9508. [2018-10-23 20:04:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9508 states. [2018-10-23 20:04:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9508 states to 9508 states and 10825 transitions. [2018-10-23 20:04:06,692 INFO L78 Accepts]: Start accepts. Automaton has 9508 states and 10825 transitions. Word has length 341 [2018-10-23 20:04:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:06,693 INFO L481 AbstractCegarLoop]: Abstraction has 9508 states and 10825 transitions. [2018-10-23 20:04:06,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:04:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 9508 states and 10825 transitions. [2018-10-23 20:04:06,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-23 20:04:06,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:06,708 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:04:06,709 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:06,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:06,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1635049709, now seen corresponding path program 1 times [2018-10-23 20:04:06,710 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:06,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:06,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:06,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:06,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-10-23 20:04:07,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:04:07,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:04:07,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:04:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:04:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:04:07,045 INFO L87 Difference]: Start difference. First operand 9508 states and 10825 transitions. Second operand 3 states. [2018-10-23 20:04:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:08,272 INFO L93 Difference]: Finished difference Result 20308 states and 23109 transitions. [2018-10-23 20:04:08,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:04:08,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2018-10-23 20:04:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:08,287 INFO L225 Difference]: With dead ends: 20308 [2018-10-23 20:04:08,288 INFO L226 Difference]: Without dead ends: 10802 [2018-10-23 20:04:08,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:04:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10802 states. [2018-10-23 20:04:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10802 to 10432. [2018-10-23 20:04:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10432 states. [2018-10-23 20:04:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10432 states to 10432 states and 11830 transitions. [2018-10-23 20:04:08,434 INFO L78 Accepts]: Start accepts. Automaton has 10432 states and 11830 transitions. Word has length 383 [2018-10-23 20:04:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:08,435 INFO L481 AbstractCegarLoop]: Abstraction has 10432 states and 11830 transitions. [2018-10-23 20:04:08,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:04:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 10432 states and 11830 transitions. [2018-10-23 20:04:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-23 20:04:08,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:08,454 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:04:08,455 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:08,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:08,455 INFO L82 PathProgramCache]: Analyzing trace with hash -261141058, now seen corresponding path program 1 times [2018-10-23 20:04:08,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:08,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:08,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:08,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:08,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-10-23 20:04:08,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:04:08,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 20:04:08,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:04:08,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:04:08,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:04:08,824 INFO L87 Difference]: Start difference. First operand 10432 states and 11830 transitions. Second operand 3 states. [2018-10-23 20:04:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:09,681 INFO L93 Difference]: Finished difference Result 21047 states and 23847 transitions. [2018-10-23 20:04:09,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:04:09,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2018-10-23 20:04:09,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:09,693 INFO L225 Difference]: With dead ends: 21047 [2018-10-23 20:04:09,693 INFO L226 Difference]: Without dead ends: 10431 [2018-10-23 20:04:09,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:04:09,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10431 states. [2018-10-23 20:04:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10431 to 10245. [2018-10-23 20:04:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10245 states. [2018-10-23 20:04:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11407 transitions. [2018-10-23 20:04:09,833 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11407 transitions. Word has length 396 [2018-10-23 20:04:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:09,834 INFO L481 AbstractCegarLoop]: Abstraction has 10245 states and 11407 transitions. [2018-10-23 20:04:09,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:04:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11407 transitions. [2018-10-23 20:04:09,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-10-23 20:04:09,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:09,861 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:04:09,862 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:09,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:09,862 INFO L82 PathProgramCache]: Analyzing trace with hash 433724850, now seen corresponding path program 1 times [2018-10-23 20:04:09,862 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:09,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:09,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:09,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:09,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 396 proven. 205 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-23 20:04:10,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:04:10,752 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-23 20:04:10,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:10,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:04:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-23 20:04:11,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:04:11,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-10-23 20:04:11,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 20:04:11,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 20:04:11,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:04:11,792 INFO L87 Difference]: Start difference. First operand 10245 states and 11407 transitions. Second operand 6 states. [2018-10-23 20:04:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:30,300 INFO L93 Difference]: Finished difference Result 29400 states and 32599 transitions. [2018-10-23 20:04:30,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 20:04:30,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 496 [2018-10-23 20:04:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:30,324 INFO L225 Difference]: With dead ends: 29400 [2018-10-23 20:04:30,324 INFO L226 Difference]: Without dead ends: 18602 [2018-10-23 20:04:30,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 495 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:04:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18602 states. [2018-10-23 20:04:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18602 to 14506. [2018-10-23 20:04:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14506 states. [2018-10-23 20:04:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14506 states to 14506 states and 16041 transitions. [2018-10-23 20:04:30,789 INFO L78 Accepts]: Start accepts. Automaton has 14506 states and 16041 transitions. Word has length 496 [2018-10-23 20:04:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:30,789 INFO L481 AbstractCegarLoop]: Abstraction has 14506 states and 16041 transitions. [2018-10-23 20:04:30,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 20:04:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 14506 states and 16041 transitions. [2018-10-23 20:04:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-10-23 20:04:30,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:30,817 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:04:30,817 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:30,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:30,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1721011334, now seen corresponding path program 1 times [2018-10-23 20:04:30,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:30,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:30,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:30,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:30,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:31,656 WARN L179 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-23 20:04:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 649 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-23 20:04:31,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:04:31,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:04:31,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:04:31,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:04:31,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:04:31,848 INFO L87 Difference]: Start difference. First operand 14506 states and 16041 transitions. Second operand 4 states. [2018-10-23 20:04:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:35,185 INFO L93 Difference]: Finished difference Result 29020 states and 32174 transitions. [2018-10-23 20:04:35,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:04:35,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 522 [2018-10-23 20:04:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:35,200 INFO L225 Difference]: With dead ends: 29020 [2018-10-23 20:04:35,200 INFO L226 Difference]: Without dead ends: 14329 [2018-10-23 20:04:35,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:04:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14329 states. [2018-10-23 20:04:35,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14329 to 14316. [2018-10-23 20:04:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14316 states. [2018-10-23 20:04:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14316 states to 14316 states and 15569 transitions. [2018-10-23 20:04:35,379 INFO L78 Accepts]: Start accepts. Automaton has 14316 states and 15569 transitions. Word has length 522 [2018-10-23 20:04:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:35,380 INFO L481 AbstractCegarLoop]: Abstraction has 14316 states and 15569 transitions. [2018-10-23 20:04:35,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:04:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 14316 states and 15569 transitions. [2018-10-23 20:04:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-23 20:04:35,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:35,402 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:04:35,402 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:35,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:35,402 INFO L82 PathProgramCache]: Analyzing trace with hash 634844804, now seen corresponding path program 1 times [2018-10-23 20:04:35,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:35,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:35,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:35,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:35,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 529 proven. 119 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-23 20:04:35,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:04:35,949 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-23 20:04:35,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:36,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:04:36,439 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 529 proven. 119 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-10-23 20:04:36,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:04:36,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-10-23 20:04:36,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:04:36,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:04:36,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:04:36,462 INFO L87 Difference]: Start difference. First operand 14316 states and 15569 transitions. Second operand 5 states. [2018-10-23 20:04:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:38,862 INFO L93 Difference]: Finished difference Result 30864 states and 33597 transitions. [2018-10-23 20:04:38,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 20:04:38,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 538 [2018-10-23 20:04:38,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:38,878 INFO L225 Difference]: With dead ends: 30864 [2018-10-23 20:04:38,879 INFO L226 Difference]: Without dead ends: 17290 [2018-10-23 20:04:38,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 537 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-23 20:04:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2018-10-23 20:04:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 14871. [2018-10-23 20:04:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14871 states. [2018-10-23 20:04:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14871 states to 14871 states and 16154 transitions. [2018-10-23 20:04:39,067 INFO L78 Accepts]: Start accepts. Automaton has 14871 states and 16154 transitions. Word has length 538 [2018-10-23 20:04:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:39,068 INFO L481 AbstractCegarLoop]: Abstraction has 14871 states and 16154 transitions. [2018-10-23 20:04:39,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:04:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 14871 states and 16154 transitions. [2018-10-23 20:04:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-10-23 20:04:39,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:39,085 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:04:39,086 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:39,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:39,086 INFO L82 PathProgramCache]: Analyzing trace with hash -783968333, now seen corresponding path program 1 times [2018-10-23 20:04:39,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:39,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:39,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:39,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 768 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-10-23 20:04:39,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:04:39,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:04:39,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:04:39,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:04:39,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:04:39,690 INFO L87 Difference]: Start difference. First operand 14871 states and 16154 transitions. Second operand 5 states. [2018-10-23 20:04:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:41,882 INFO L93 Difference]: Finished difference Result 34745 states and 37752 transitions. [2018-10-23 20:04:41,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:04:41,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 606 [2018-10-23 20:04:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:41,902 INFO L225 Difference]: With dead ends: 34745 [2018-10-23 20:04:41,902 INFO L226 Difference]: Without dead ends: 20061 [2018-10-23 20:04:41,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-23 20:04:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20061 states. [2018-10-23 20:04:42,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20061 to 16719. [2018-10-23 20:04:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16719 states. [2018-10-23 20:04:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16719 states to 16719 states and 17991 transitions. [2018-10-23 20:04:42,135 INFO L78 Accepts]: Start accepts. Automaton has 16719 states and 17991 transitions. Word has length 606 [2018-10-23 20:04:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:42,135 INFO L481 AbstractCegarLoop]: Abstraction has 16719 states and 17991 transitions. [2018-10-23 20:04:42,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:04:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 16719 states and 17991 transitions. [2018-10-23 20:04:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-10-23 20:04:42,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:42,153 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:04:42,154 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:42,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:42,154 INFO L82 PathProgramCache]: Analyzing trace with hash 788418704, now seen corresponding path program 1 times [2018-10-23 20:04:42,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:42,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:42,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:42,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:42,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:42,839 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-23 20:04:43,292 WARN L179 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-10-23 20:04:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 742 proven. 46 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-10-23 20:04:43,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:04:43,918 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-23 20:04:43,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:44,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:04:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 750 proven. 38 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-10-23 20:04:45,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:04:45,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-10-23 20:04:45,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 20:04:45,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 20:04:45,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-23 20:04:45,291 INFO L87 Difference]: Start difference. First operand 16719 states and 17991 transitions. Second operand 8 states. [2018-10-23 20:04:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:52,504 INFO L93 Difference]: Finished difference Result 33498 states and 36038 transitions. [2018-10-23 20:04:52,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-23 20:04:52,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 648 [2018-10-23 20:04:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:52,522 INFO L225 Difference]: With dead ends: 33498 [2018-10-23 20:04:52,522 INFO L226 Difference]: Without dead ends: 17151 [2018-10-23 20:04:52,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 645 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-10-23 20:04:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17151 states. [2018-10-23 20:04:52,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17151 to 16346. [2018-10-23 20:04:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16346 states. [2018-10-23 20:04:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16346 states to 16346 states and 17577 transitions. [2018-10-23 20:04:52,717 INFO L78 Accepts]: Start accepts. Automaton has 16346 states and 17577 transitions. Word has length 648 [2018-10-23 20:04:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:52,717 INFO L481 AbstractCegarLoop]: Abstraction has 16346 states and 17577 transitions. [2018-10-23 20:04:52,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 20:04:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 16346 states and 17577 transitions. [2018-10-23 20:04:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2018-10-23 20:04:52,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:52,734 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:04:52,734 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:52,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:52,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1302145049, now seen corresponding path program 1 times [2018-10-23 20:04:52,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:52,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:52,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:52,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:52,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:53,587 WARN L179 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-23 20:04:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 1048 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-10-23 20:04:53,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:04:53,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:04:53,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:04:53,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:04:53,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:04:53,857 INFO L87 Difference]: Start difference. First operand 16346 states and 17577 transitions. Second operand 4 states. [2018-10-23 20:04:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:04:55,739 INFO L93 Difference]: Finished difference Result 32701 states and 35180 transitions. [2018-10-23 20:04:55,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:04:55,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 655 [2018-10-23 20:04:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:04:55,755 INFO L225 Difference]: With dead ends: 32701 [2018-10-23 20:04:55,756 INFO L226 Difference]: Without dead ends: 16727 [2018-10-23 20:04:55,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:04:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16727 states. [2018-10-23 20:04:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16727 to 15976. [2018-10-23 20:04:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15976 states. [2018-10-23 20:04:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15976 states to 15976 states and 17153 transitions. [2018-10-23 20:04:55,922 INFO L78 Accepts]: Start accepts. Automaton has 15976 states and 17153 transitions. Word has length 655 [2018-10-23 20:04:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:04:55,922 INFO L481 AbstractCegarLoop]: Abstraction has 15976 states and 17153 transitions. [2018-10-23 20:04:55,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:04:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 15976 states and 17153 transitions. [2018-10-23 20:04:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2018-10-23 20:04:55,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:04:55,939 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:04:55,939 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:04:55,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:04:55,939 INFO L82 PathProgramCache]: Analyzing trace with hash -530987743, now seen corresponding path program 1 times [2018-10-23 20:04:55,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:04:55,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:04:55,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:55,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:55,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:04:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 833 proven. 40 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2018-10-23 20:04:57,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:04:57,077 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-23 20:04:57,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:04:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:04:57,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:04:59,392 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_59 Int)) (let ((.cse1 (* 9 v_prenex_59))) (let ((.cse2 (div .cse1 10))) (let ((.cse0 (+ .cse2 1))) (and (<= 0 .cse0) (<= (+ (* 5 (div .cse0 5)) 549278) c_~a29~0) (<= (+ v_prenex_59 580292) 0) (not (= (mod .cse1 10) 0)) (= 0 (mod .cse2 5)) (< .cse1 0) (<= 0 (+ v_prenex_59 580294))))))) (exists ((v_prenex_41 Int)) (let ((.cse3 (* 9 v_prenex_41))) (let ((.cse5 (div .cse3 10))) (let ((.cse4 (+ .cse5 1))) (and (<= 0 (+ v_prenex_41 580294)) (not (= (mod .cse3 10) 0)) (<= (+ v_prenex_41 580292) 0) (<= (+ (* 5 (div .cse4 5)) 549283) c_~a29~0) (< .cse3 0) (not (= 0 (mod .cse4 5))) (< .cse4 0) (<= 0 .cse5)))))) (exists ((v_prenex_63 Int)) (let ((.cse7 (* 9 v_prenex_63))) (let ((.cse6 (div .cse7 10))) (let ((.cse8 (+ .cse6 1))) (and (< .cse6 0) (not (= 0 (mod .cse6 5))) (<= (+ v_prenex_63 580292) 0) (< .cse7 0) (<= 0 (+ v_prenex_63 580294)) (= 0 (mod .cse8 5)) (not (= (mod .cse7 10) 0)) (<= (+ (* 5 (div .cse8 5)) 549278) c_~a29~0)))))) (exists ((v_prenex_55 Int)) (let ((.cse11 (* 9 v_prenex_55))) (let ((.cse9 (div .cse11 10))) (let ((.cse10 (+ .cse9 1))) (and (not (= 0 (mod .cse9 5))) (not (= 0 (mod .cse10 5))) (<= (+ (* 5 (div .cse9 5)) 549283) c_~a29~0) (<= (+ v_prenex_55 580292) 0) (< .cse10 0) (= (mod .cse11 10) 0) (< .cse9 0) (<= 0 (+ v_prenex_55 580294))))))) (exists ((v_prenex_47 Int)) (let ((.cse12 (* 9 v_prenex_47))) (let ((.cse13 (div .cse12 10))) (let ((.cse14 (+ .cse13 1))) (and (< .cse12 0) (<= (+ v_prenex_47 580292) 0) (<= 0 (+ v_prenex_47 580294)) (not (= (mod .cse12 10) 0)) (<= 0 .cse13) (<= 0 .cse14) (<= (+ (* 5 (div .cse14 5)) 549278) c_~a29~0)))))) (exists ((v_prenex_57 Int)) (let ((.cse15 (* 9 v_prenex_57))) (let ((.cse16 (div .cse15 10))) (and (= (mod .cse15 10) 0) (<= 0 (+ v_prenex_57 580294)) (<= (+ (* 5 (div .cse16 5)) 549278) c_~a29~0) (<= (+ v_prenex_57 580292) 0) (<= 0 .cse16) (= 0 (mod (+ .cse16 1) 5)))))) (exists ((v_prenex_39 Int)) (let ((.cse18 (* 9 v_prenex_39))) (let ((.cse17 (div .cse18 10))) (and (<= (+ v_prenex_39 580292) 0) (not (= 0 (mod .cse17 5))) (<= 0 (+ .cse17 1)) (<= 0 (+ v_prenex_39 580294)) (<= (+ (* 5 (div .cse17 5)) 549283) c_~a29~0) (< .cse17 0) (<= 0 .cse18))))) (exists ((v_prenex_48 Int)) (let ((.cse21 (* 9 v_prenex_48))) (let ((.cse19 (div .cse21 10))) (let ((.cse20 (+ .cse19 1))) (and (not (= 0 (mod .cse19 5))) (<= (+ v_prenex_48 580292) 0) (not (= 0 (mod .cse20 5))) (not (= (mod .cse21 10) 0)) (<= (+ (* 5 (div .cse20 5)) 549283) c_~a29~0) (< .cse19 0) (< .cse21 0) (<= 0 (+ v_prenex_48 580294)) (< .cse20 0)))))) (exists ((v_prenex_56 Int)) (let ((.cse24 (* 9 v_prenex_56))) (let ((.cse23 (div .cse24 10))) (let ((.cse22 (+ .cse23 1))) (and (not (= 0 (mod .cse22 5))) (<= 0 .cse23) (< .cse22 0) (<= (+ (* 5 (div .cse23 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_56 580294)) (= (mod .cse24 10) 0) (<= (+ v_prenex_56 580292) 0)))))) (exists ((v_prenex_54 Int)) (let ((.cse26 (* 9 v_prenex_54))) (let ((.cse25 (div .cse26 10))) (and (= 0 (mod (+ .cse25 1) 5)) (= (mod .cse26 10) 0) (<= 0 (+ v_prenex_54 580294)) (not (= 0 (mod .cse25 5))) (< .cse25 0) (<= (+ v_prenex_54 580292) 0) (<= (+ (* 5 (div .cse25 5)) 549283) c_~a29~0))))) (exists ((v_prenex_43 Int)) (let ((.cse28 (* 9 v_prenex_43))) (let ((.cse27 (div .cse28 10))) (and (<= 0 (+ v_prenex_43 580294)) (= 0 (mod (+ .cse27 1) 5)) (<= (+ (* 5 (div .cse27 5)) 549283) c_~a29~0) (not (= 0 (mod .cse27 5))) (< .cse27 0) (<= (+ v_prenex_43 580292) 0) (<= 0 .cse28))))) (exists ((v_prenex_50 Int)) (let ((.cse29 (* 9 v_prenex_50))) (let ((.cse30 (div .cse29 10))) (and (<= (+ v_prenex_50 580292) 0) (<= 0 .cse29) (= 0 (mod .cse30 5)) (<= 0 (+ v_prenex_50 580294)) (<= 0 (+ .cse30 1)) (<= (+ (* 5 (div .cse30 5)) 549278) c_~a29~0))))) (exists ((v_prenex_58 Int)) (let ((.cse33 (* 9 v_prenex_58))) (let ((.cse32 (div .cse33 10))) (let ((.cse31 (+ .cse32 1))) (and (<= 0 (+ v_prenex_58 580294)) (<= (+ (* 5 (div .cse31 5)) 549278) c_~a29~0) (<= (+ v_prenex_58 580292) 0) (<= 0 .cse32) (= 0 (mod .cse31 5)) (< .cse33 0) (not (= (mod .cse33 10) 0))))))) (exists ((v_prenex_64 Int)) (let ((.cse34 (* 9 v_prenex_64))) (let ((.cse36 (div .cse34 10))) (let ((.cse35 (+ .cse36 1))) (and (<= (+ v_prenex_64 580292) 0) (< .cse34 0) (= 0 (mod .cse35 5)) (not (= (mod .cse34 10) 0)) (<= 0 (+ v_prenex_64 580294)) (= 0 (mod .cse36 5)) (<= (+ (* 5 (div .cse35 5)) 549278) c_~a29~0)))))) (exists ((v_prenex_52 Int)) (let ((.cse39 (* 9 v_prenex_52))) (let ((.cse38 (div .cse39 10))) (let ((.cse37 (+ .cse38 1))) (and (not (= 0 (mod .cse37 5))) (<= 0 (+ v_prenex_52 580294)) (<= (+ (* 5 (div .cse38 5)) 549278) c_~a29~0) (<= 0 .cse39) (< .cse37 0) (= 0 (mod .cse38 5)) (<= (+ v_prenex_52 580292) 0)))))) (exists ((v_prenex_42 Int)) (let ((.cse41 (* 9 v_prenex_42))) (let ((.cse42 (div .cse41 10))) (let ((.cse40 (+ .cse42 1))) (and (<= 0 .cse40) (<= (+ (* 5 (div .cse40 5)) 549278) c_~a29~0) (not (= (mod .cse41 10) 0)) (<= (+ v_prenex_42 580292) 0) (< .cse41 0) (<= 0 (+ v_prenex_42 580294)) (not (= 0 (mod .cse42 5))) (< .cse42 0)))))) (exists ((v_prenex_49 Int)) (let ((.cse44 (* 9 v_prenex_49))) (let ((.cse43 (div .cse44 10))) (and (<= (+ (* 5 (div .cse43 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_49 580294)) (= (mod .cse44 10) 0) (<= 0 (+ .cse43 1)) (<= (+ v_prenex_49 580292) 0) (= 0 (mod .cse43 5)))))) (exists ((v_prenex_61 Int)) (let ((.cse46 (* 9 v_prenex_61))) (let ((.cse45 (div .cse46 10))) (and (<= 0 (+ v_prenex_61 580294)) (<= (+ (* 5 (div .cse45 5)) 549283) c_~a29~0) (= (mod .cse46 10) 0) (< .cse45 0) (<= (+ v_prenex_61 580292) 0) (<= 0 (+ .cse45 1)) (not (= 0 (mod .cse45 5))))))) (exists ((v_prenex_44 Int)) (let ((.cse49 (* 9 v_prenex_44))) (let ((.cse47 (div .cse49 10))) (let ((.cse48 (+ .cse47 1))) (and (= 0 (mod .cse47 5)) (not (= 0 (mod .cse48 5))) (not (= (mod .cse49 10) 0)) (<= (+ v_prenex_44 580292) 0) (< .cse48 0) (<= 0 (+ v_prenex_44 580294)) (< .cse49 0) (<= (+ (* 5 (div .cse48 5)) 549283) c_~a29~0)))))) (exists ((v_~a29~0_502 Int)) (let ((.cse51 (* 9 v_~a29~0_502))) (let ((.cse50 (div .cse51 10))) (and (<= (+ (* 5 (div .cse50 5)) 549278) c_~a29~0) (<= 0 .cse51) (<= (+ v_~a29~0_502 580292) 0) (<= 0 .cse50) (<= 0 (+ .cse50 1)) (<= 0 (+ v_~a29~0_502 580294)))))) (exists ((v_prenex_53 Int)) (let ((.cse52 (* 9 v_prenex_53))) (let ((.cse53 (div .cse52 10))) (and (<= (+ v_prenex_53 580292) 0) (= (mod .cse52 10) 0) (<= 0 (+ v_prenex_53 580294)) (<= 0 (+ .cse53 1)) (<= 0 .cse53) (<= (+ (* 5 (div .cse53 5)) 549278) c_~a29~0))))) (exists ((v_prenex_46 Int)) (let ((.cse54 (* 9 v_prenex_46))) (let ((.cse55 (div .cse54 10))) (let ((.cse56 (+ .cse55 1))) (and (<= 0 (+ v_prenex_46 580294)) (<= 0 .cse54) (<= (+ (* 5 (div .cse55 5)) 549278) c_~a29~0) (<= 0 .cse55) (<= (+ v_prenex_46 580292) 0) (not (= 0 (mod .cse56 5))) (< .cse56 0)))))) (exists ((v_prenex_45 Int)) (let ((.cse57 (* 9 v_prenex_45))) (let ((.cse58 (div .cse57 10))) (and (<= 0 (+ v_prenex_45 580294)) (<= 0 .cse57) (<= (+ v_prenex_45 580292) 0) (= 0 (mod (+ .cse58 1) 5)) (<= (+ (* 5 (div .cse58 5)) 549278) c_~a29~0) (= 0 (mod .cse58 5)))))) (exists ((v_prenex_60 Int)) (let ((.cse59 (* 9 v_prenex_60))) (let ((.cse60 (div .cse59 10))) (and (<= (+ v_prenex_60 580292) 0) (<= 0 .cse59) (= 0 (mod (+ .cse60 1) 5)) (<= 0 .cse60) (<= (+ (* 5 (div .cse60 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_60 580294)))))) (exists ((v_prenex_40 Int)) (let ((.cse63 (* 9 v_prenex_40))) (let ((.cse62 (div .cse63 10))) (let ((.cse61 (+ .cse62 1))) (and (< .cse61 0) (< .cse62 0) (<= 0 (+ v_prenex_40 580294)) (<= (+ v_prenex_40 580292) 0) (<= (+ (* 5 (div .cse62 5)) 549283) c_~a29~0) (<= 0 .cse63) (not (= 0 (mod .cse61 5))) (not (= 0 (mod .cse62 5)))))))) (exists ((v_prenex_62 Int)) (let ((.cse66 (* 9 v_prenex_62))) (let ((.cse64 (div .cse66 10))) (let ((.cse65 (+ .cse64 1))) (and (<= (+ v_prenex_62 580292) 0) (<= (+ (* 5 (div .cse64 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_62 580294)) (= 0 (mod .cse64 5)) (not (= 0 (mod .cse65 5))) (= (mod .cse66 10) 0) (< .cse65 0)))))) (exists ((v_prenex_51 Int)) (let ((.cse67 (* 9 v_prenex_51))) (let ((.cse68 (div .cse67 10))) (and (<= (+ v_prenex_51 580292) 0) (= (mod .cse67 10) 0) (= 0 (mod .cse68 5)) (= 0 (mod (+ .cse68 1) 5)) (<= (+ (* 5 (div .cse68 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_51 580294))))))) is different from false [2018-10-23 20:05:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 833 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 40 not checked. [2018-10-23 20:05:03,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:05:03,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-10-23 20:05:03,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 20:05:03,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 20:05:03,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-10-23 20:05:03,530 INFO L87 Difference]: Start difference. First operand 15976 states and 17153 transitions. Second operand 6 states. [2018-10-23 20:05:07,927 WARN L832 $PredicateComparison]: unable to prove that (and (or (exists ((v_prenex_59 Int)) (let ((.cse1 (* 9 v_prenex_59))) (let ((.cse2 (div .cse1 10))) (let ((.cse0 (+ .cse2 1))) (and (<= 0 .cse0) (<= (+ (* 5 (div .cse0 5)) 549278) c_~a29~0) (<= (+ v_prenex_59 580292) 0) (not (= (mod .cse1 10) 0)) (= 0 (mod .cse2 5)) (< .cse1 0) (<= 0 (+ v_prenex_59 580294))))))) (exists ((v_prenex_41 Int)) (let ((.cse3 (* 9 v_prenex_41))) (let ((.cse5 (div .cse3 10))) (let ((.cse4 (+ .cse5 1))) (and (<= 0 (+ v_prenex_41 580294)) (not (= (mod .cse3 10) 0)) (<= (+ v_prenex_41 580292) 0) (<= (+ (* 5 (div .cse4 5)) 549283) c_~a29~0) (< .cse3 0) (not (= 0 (mod .cse4 5))) (< .cse4 0) (<= 0 .cse5)))))) (exists ((v_prenex_63 Int)) (let ((.cse7 (* 9 v_prenex_63))) (let ((.cse6 (div .cse7 10))) (let ((.cse8 (+ .cse6 1))) (and (< .cse6 0) (not (= 0 (mod .cse6 5))) (<= (+ v_prenex_63 580292) 0) (< .cse7 0) (<= 0 (+ v_prenex_63 580294)) (= 0 (mod .cse8 5)) (not (= (mod .cse7 10) 0)) (<= (+ (* 5 (div .cse8 5)) 549278) c_~a29~0)))))) (exists ((v_prenex_55 Int)) (let ((.cse11 (* 9 v_prenex_55))) (let ((.cse9 (div .cse11 10))) (let ((.cse10 (+ .cse9 1))) (and (not (= 0 (mod .cse9 5))) (not (= 0 (mod .cse10 5))) (<= (+ (* 5 (div .cse9 5)) 549283) c_~a29~0) (<= (+ v_prenex_55 580292) 0) (< .cse10 0) (= (mod .cse11 10) 0) (< .cse9 0) (<= 0 (+ v_prenex_55 580294))))))) (exists ((v_prenex_47 Int)) (let ((.cse12 (* 9 v_prenex_47))) (let ((.cse13 (div .cse12 10))) (let ((.cse14 (+ .cse13 1))) (and (< .cse12 0) (<= (+ v_prenex_47 580292) 0) (<= 0 (+ v_prenex_47 580294)) (not (= (mod .cse12 10) 0)) (<= 0 .cse13) (<= 0 .cse14) (<= (+ (* 5 (div .cse14 5)) 549278) c_~a29~0)))))) (exists ((v_prenex_57 Int)) (let ((.cse15 (* 9 v_prenex_57))) (let ((.cse16 (div .cse15 10))) (and (= (mod .cse15 10) 0) (<= 0 (+ v_prenex_57 580294)) (<= (+ (* 5 (div .cse16 5)) 549278) c_~a29~0) (<= (+ v_prenex_57 580292) 0) (<= 0 .cse16) (= 0 (mod (+ .cse16 1) 5)))))) (exists ((v_prenex_39 Int)) (let ((.cse18 (* 9 v_prenex_39))) (let ((.cse17 (div .cse18 10))) (and (<= (+ v_prenex_39 580292) 0) (not (= 0 (mod .cse17 5))) (<= 0 (+ .cse17 1)) (<= 0 (+ v_prenex_39 580294)) (<= (+ (* 5 (div .cse17 5)) 549283) c_~a29~0) (< .cse17 0) (<= 0 .cse18))))) (exists ((v_prenex_48 Int)) (let ((.cse21 (* 9 v_prenex_48))) (let ((.cse19 (div .cse21 10))) (let ((.cse20 (+ .cse19 1))) (and (not (= 0 (mod .cse19 5))) (<= (+ v_prenex_48 580292) 0) (not (= 0 (mod .cse20 5))) (not (= (mod .cse21 10) 0)) (<= (+ (* 5 (div .cse20 5)) 549283) c_~a29~0) (< .cse19 0) (< .cse21 0) (<= 0 (+ v_prenex_48 580294)) (< .cse20 0)))))) (exists ((v_prenex_56 Int)) (let ((.cse24 (* 9 v_prenex_56))) (let ((.cse23 (div .cse24 10))) (let ((.cse22 (+ .cse23 1))) (and (not (= 0 (mod .cse22 5))) (<= 0 .cse23) (< .cse22 0) (<= (+ (* 5 (div .cse23 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_56 580294)) (= (mod .cse24 10) 0) (<= (+ v_prenex_56 580292) 0)))))) (exists ((v_prenex_54 Int)) (let ((.cse26 (* 9 v_prenex_54))) (let ((.cse25 (div .cse26 10))) (and (= 0 (mod (+ .cse25 1) 5)) (= (mod .cse26 10) 0) (<= 0 (+ v_prenex_54 580294)) (not (= 0 (mod .cse25 5))) (< .cse25 0) (<= (+ v_prenex_54 580292) 0) (<= (+ (* 5 (div .cse25 5)) 549283) c_~a29~0))))) (exists ((v_prenex_43 Int)) (let ((.cse28 (* 9 v_prenex_43))) (let ((.cse27 (div .cse28 10))) (and (<= 0 (+ v_prenex_43 580294)) (= 0 (mod (+ .cse27 1) 5)) (<= (+ (* 5 (div .cse27 5)) 549283) c_~a29~0) (not (= 0 (mod .cse27 5))) (< .cse27 0) (<= (+ v_prenex_43 580292) 0) (<= 0 .cse28))))) (exists ((v_prenex_50 Int)) (let ((.cse29 (* 9 v_prenex_50))) (let ((.cse30 (div .cse29 10))) (and (<= (+ v_prenex_50 580292) 0) (<= 0 .cse29) (= 0 (mod .cse30 5)) (<= 0 (+ v_prenex_50 580294)) (<= 0 (+ .cse30 1)) (<= (+ (* 5 (div .cse30 5)) 549278) c_~a29~0))))) (exists ((v_prenex_58 Int)) (let ((.cse33 (* 9 v_prenex_58))) (let ((.cse32 (div .cse33 10))) (let ((.cse31 (+ .cse32 1))) (and (<= 0 (+ v_prenex_58 580294)) (<= (+ (* 5 (div .cse31 5)) 549278) c_~a29~0) (<= (+ v_prenex_58 580292) 0) (<= 0 .cse32) (= 0 (mod .cse31 5)) (< .cse33 0) (not (= (mod .cse33 10) 0))))))) (exists ((v_prenex_64 Int)) (let ((.cse34 (* 9 v_prenex_64))) (let ((.cse36 (div .cse34 10))) (let ((.cse35 (+ .cse36 1))) (and (<= (+ v_prenex_64 580292) 0) (< .cse34 0) (= 0 (mod .cse35 5)) (not (= (mod .cse34 10) 0)) (<= 0 (+ v_prenex_64 580294)) (= 0 (mod .cse36 5)) (<= (+ (* 5 (div .cse35 5)) 549278) c_~a29~0)))))) (exists ((v_prenex_52 Int)) (let ((.cse39 (* 9 v_prenex_52))) (let ((.cse38 (div .cse39 10))) (let ((.cse37 (+ .cse38 1))) (and (not (= 0 (mod .cse37 5))) (<= 0 (+ v_prenex_52 580294)) (<= (+ (* 5 (div .cse38 5)) 549278) c_~a29~0) (<= 0 .cse39) (< .cse37 0) (= 0 (mod .cse38 5)) (<= (+ v_prenex_52 580292) 0)))))) (exists ((v_prenex_42 Int)) (let ((.cse41 (* 9 v_prenex_42))) (let ((.cse42 (div .cse41 10))) (let ((.cse40 (+ .cse42 1))) (and (<= 0 .cse40) (<= (+ (* 5 (div .cse40 5)) 549278) c_~a29~0) (not (= (mod .cse41 10) 0)) (<= (+ v_prenex_42 580292) 0) (< .cse41 0) (<= 0 (+ v_prenex_42 580294)) (not (= 0 (mod .cse42 5))) (< .cse42 0)))))) (exists ((v_prenex_49 Int)) (let ((.cse44 (* 9 v_prenex_49))) (let ((.cse43 (div .cse44 10))) (and (<= (+ (* 5 (div .cse43 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_49 580294)) (= (mod .cse44 10) 0) (<= 0 (+ .cse43 1)) (<= (+ v_prenex_49 580292) 0) (= 0 (mod .cse43 5)))))) (exists ((v_prenex_61 Int)) (let ((.cse46 (* 9 v_prenex_61))) (let ((.cse45 (div .cse46 10))) (and (<= 0 (+ v_prenex_61 580294)) (<= (+ (* 5 (div .cse45 5)) 549283) c_~a29~0) (= (mod .cse46 10) 0) (< .cse45 0) (<= (+ v_prenex_61 580292) 0) (<= 0 (+ .cse45 1)) (not (= 0 (mod .cse45 5))))))) (exists ((v_prenex_44 Int)) (let ((.cse49 (* 9 v_prenex_44))) (let ((.cse47 (div .cse49 10))) (let ((.cse48 (+ .cse47 1))) (and (= 0 (mod .cse47 5)) (not (= 0 (mod .cse48 5))) (not (= (mod .cse49 10) 0)) (<= (+ v_prenex_44 580292) 0) (< .cse48 0) (<= 0 (+ v_prenex_44 580294)) (< .cse49 0) (<= (+ (* 5 (div .cse48 5)) 549283) c_~a29~0)))))) (exists ((v_~a29~0_502 Int)) (let ((.cse51 (* 9 v_~a29~0_502))) (let ((.cse50 (div .cse51 10))) (and (<= (+ (* 5 (div .cse50 5)) 549278) c_~a29~0) (<= 0 .cse51) (<= (+ v_~a29~0_502 580292) 0) (<= 0 .cse50) (<= 0 (+ .cse50 1)) (<= 0 (+ v_~a29~0_502 580294)))))) (exists ((v_prenex_53 Int)) (let ((.cse52 (* 9 v_prenex_53))) (let ((.cse53 (div .cse52 10))) (and (<= (+ v_prenex_53 580292) 0) (= (mod .cse52 10) 0) (<= 0 (+ v_prenex_53 580294)) (<= 0 (+ .cse53 1)) (<= 0 .cse53) (<= (+ (* 5 (div .cse53 5)) 549278) c_~a29~0))))) (exists ((v_prenex_46 Int)) (let ((.cse54 (* 9 v_prenex_46))) (let ((.cse55 (div .cse54 10))) (let ((.cse56 (+ .cse55 1))) (and (<= 0 (+ v_prenex_46 580294)) (<= 0 .cse54) (<= (+ (* 5 (div .cse55 5)) 549278) c_~a29~0) (<= 0 .cse55) (<= (+ v_prenex_46 580292) 0) (not (= 0 (mod .cse56 5))) (< .cse56 0)))))) (exists ((v_prenex_45 Int)) (let ((.cse57 (* 9 v_prenex_45))) (let ((.cse58 (div .cse57 10))) (and (<= 0 (+ v_prenex_45 580294)) (<= 0 .cse57) (<= (+ v_prenex_45 580292) 0) (= 0 (mod (+ .cse58 1) 5)) (<= (+ (* 5 (div .cse58 5)) 549278) c_~a29~0) (= 0 (mod .cse58 5)))))) (exists ((v_prenex_60 Int)) (let ((.cse59 (* 9 v_prenex_60))) (let ((.cse60 (div .cse59 10))) (and (<= (+ v_prenex_60 580292) 0) (<= 0 .cse59) (= 0 (mod (+ .cse60 1) 5)) (<= 0 .cse60) (<= (+ (* 5 (div .cse60 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_60 580294)))))) (exists ((v_prenex_40 Int)) (let ((.cse63 (* 9 v_prenex_40))) (let ((.cse62 (div .cse63 10))) (let ((.cse61 (+ .cse62 1))) (and (< .cse61 0) (< .cse62 0) (<= 0 (+ v_prenex_40 580294)) (<= (+ v_prenex_40 580292) 0) (<= (+ (* 5 (div .cse62 5)) 549283) c_~a29~0) (<= 0 .cse63) (not (= 0 (mod .cse61 5))) (not (= 0 (mod .cse62 5)))))))) (exists ((v_prenex_62 Int)) (let ((.cse66 (* 9 v_prenex_62))) (let ((.cse64 (div .cse66 10))) (let ((.cse65 (+ .cse64 1))) (and (<= (+ v_prenex_62 580292) 0) (<= (+ (* 5 (div .cse64 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_62 580294)) (= 0 (mod .cse64 5)) (not (= 0 (mod .cse65 5))) (= (mod .cse66 10) 0) (< .cse65 0)))))) (exists ((v_prenex_51 Int)) (let ((.cse67 (* 9 v_prenex_51))) (let ((.cse68 (div .cse67 10))) (and (<= (+ v_prenex_51 580292) 0) (= (mod .cse67 10) 0) (= 0 (mod .cse68 5)) (= 0 (mod (+ .cse68 1) 5)) (<= (+ (* 5 (div .cse68 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_51 580294))))))) (<= 27015 c_~a29~0)) is different from false [2018-10-23 20:05:09,959 WARN L832 $PredicateComparison]: unable to prove that (and (< 140 c_~a29~0) (or (exists ((v_prenex_59 Int)) (let ((.cse1 (* 9 v_prenex_59))) (let ((.cse2 (div .cse1 10))) (let ((.cse0 (+ .cse2 1))) (and (<= 0 .cse0) (<= (+ (* 5 (div .cse0 5)) 549278) c_~a29~0) (<= (+ v_prenex_59 580292) 0) (not (= (mod .cse1 10) 0)) (= 0 (mod .cse2 5)) (< .cse1 0) (<= 0 (+ v_prenex_59 580294))))))) (exists ((v_prenex_41 Int)) (let ((.cse3 (* 9 v_prenex_41))) (let ((.cse5 (div .cse3 10))) (let ((.cse4 (+ .cse5 1))) (and (<= 0 (+ v_prenex_41 580294)) (not (= (mod .cse3 10) 0)) (<= (+ v_prenex_41 580292) 0) (<= (+ (* 5 (div .cse4 5)) 549283) c_~a29~0) (< .cse3 0) (not (= 0 (mod .cse4 5))) (< .cse4 0) (<= 0 .cse5)))))) (exists ((v_prenex_63 Int)) (let ((.cse7 (* 9 v_prenex_63))) (let ((.cse6 (div .cse7 10))) (let ((.cse8 (+ .cse6 1))) (and (< .cse6 0) (not (= 0 (mod .cse6 5))) (<= (+ v_prenex_63 580292) 0) (< .cse7 0) (<= 0 (+ v_prenex_63 580294)) (= 0 (mod .cse8 5)) (not (= (mod .cse7 10) 0)) (<= (+ (* 5 (div .cse8 5)) 549278) c_~a29~0)))))) (exists ((v_prenex_55 Int)) (let ((.cse11 (* 9 v_prenex_55))) (let ((.cse9 (div .cse11 10))) (let ((.cse10 (+ .cse9 1))) (and (not (= 0 (mod .cse9 5))) (not (= 0 (mod .cse10 5))) (<= (+ (* 5 (div .cse9 5)) 549283) c_~a29~0) (<= (+ v_prenex_55 580292) 0) (< .cse10 0) (= (mod .cse11 10) 0) (< .cse9 0) (<= 0 (+ v_prenex_55 580294))))))) (exists ((v_prenex_47 Int)) (let ((.cse12 (* 9 v_prenex_47))) (let ((.cse13 (div .cse12 10))) (let ((.cse14 (+ .cse13 1))) (and (< .cse12 0) (<= (+ v_prenex_47 580292) 0) (<= 0 (+ v_prenex_47 580294)) (not (= (mod .cse12 10) 0)) (<= 0 .cse13) (<= 0 .cse14) (<= (+ (* 5 (div .cse14 5)) 549278) c_~a29~0)))))) (exists ((v_prenex_57 Int)) (let ((.cse15 (* 9 v_prenex_57))) (let ((.cse16 (div .cse15 10))) (and (= (mod .cse15 10) 0) (<= 0 (+ v_prenex_57 580294)) (<= (+ (* 5 (div .cse16 5)) 549278) c_~a29~0) (<= (+ v_prenex_57 580292) 0) (<= 0 .cse16) (= 0 (mod (+ .cse16 1) 5)))))) (exists ((v_prenex_39 Int)) (let ((.cse18 (* 9 v_prenex_39))) (let ((.cse17 (div .cse18 10))) (and (<= (+ v_prenex_39 580292) 0) (not (= 0 (mod .cse17 5))) (<= 0 (+ .cse17 1)) (<= 0 (+ v_prenex_39 580294)) (<= (+ (* 5 (div .cse17 5)) 549283) c_~a29~0) (< .cse17 0) (<= 0 .cse18))))) (exists ((v_prenex_48 Int)) (let ((.cse21 (* 9 v_prenex_48))) (let ((.cse19 (div .cse21 10))) (let ((.cse20 (+ .cse19 1))) (and (not (= 0 (mod .cse19 5))) (<= (+ v_prenex_48 580292) 0) (not (= 0 (mod .cse20 5))) (not (= (mod .cse21 10) 0)) (<= (+ (* 5 (div .cse20 5)) 549283) c_~a29~0) (< .cse19 0) (< .cse21 0) (<= 0 (+ v_prenex_48 580294)) (< .cse20 0)))))) (exists ((v_prenex_56 Int)) (let ((.cse24 (* 9 v_prenex_56))) (let ((.cse23 (div .cse24 10))) (let ((.cse22 (+ .cse23 1))) (and (not (= 0 (mod .cse22 5))) (<= 0 .cse23) (< .cse22 0) (<= (+ (* 5 (div .cse23 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_56 580294)) (= (mod .cse24 10) 0) (<= (+ v_prenex_56 580292) 0)))))) (exists ((v_prenex_54 Int)) (let ((.cse26 (* 9 v_prenex_54))) (let ((.cse25 (div .cse26 10))) (and (= 0 (mod (+ .cse25 1) 5)) (= (mod .cse26 10) 0) (<= 0 (+ v_prenex_54 580294)) (not (= 0 (mod .cse25 5))) (< .cse25 0) (<= (+ v_prenex_54 580292) 0) (<= (+ (* 5 (div .cse25 5)) 549283) c_~a29~0))))) (exists ((v_prenex_43 Int)) (let ((.cse28 (* 9 v_prenex_43))) (let ((.cse27 (div .cse28 10))) (and (<= 0 (+ v_prenex_43 580294)) (= 0 (mod (+ .cse27 1) 5)) (<= (+ (* 5 (div .cse27 5)) 549283) c_~a29~0) (not (= 0 (mod .cse27 5))) (< .cse27 0) (<= (+ v_prenex_43 580292) 0) (<= 0 .cse28))))) (exists ((v_prenex_50 Int)) (let ((.cse29 (* 9 v_prenex_50))) (let ((.cse30 (div .cse29 10))) (and (<= (+ v_prenex_50 580292) 0) (<= 0 .cse29) (= 0 (mod .cse30 5)) (<= 0 (+ v_prenex_50 580294)) (<= 0 (+ .cse30 1)) (<= (+ (* 5 (div .cse30 5)) 549278) c_~a29~0))))) (exists ((v_prenex_58 Int)) (let ((.cse33 (* 9 v_prenex_58))) (let ((.cse32 (div .cse33 10))) (let ((.cse31 (+ .cse32 1))) (and (<= 0 (+ v_prenex_58 580294)) (<= (+ (* 5 (div .cse31 5)) 549278) c_~a29~0) (<= (+ v_prenex_58 580292) 0) (<= 0 .cse32) (= 0 (mod .cse31 5)) (< .cse33 0) (not (= (mod .cse33 10) 0))))))) (exists ((v_prenex_64 Int)) (let ((.cse34 (* 9 v_prenex_64))) (let ((.cse36 (div .cse34 10))) (let ((.cse35 (+ .cse36 1))) (and (<= (+ v_prenex_64 580292) 0) (< .cse34 0) (= 0 (mod .cse35 5)) (not (= (mod .cse34 10) 0)) (<= 0 (+ v_prenex_64 580294)) (= 0 (mod .cse36 5)) (<= (+ (* 5 (div .cse35 5)) 549278) c_~a29~0)))))) (exists ((v_prenex_52 Int)) (let ((.cse39 (* 9 v_prenex_52))) (let ((.cse38 (div .cse39 10))) (let ((.cse37 (+ .cse38 1))) (and (not (= 0 (mod .cse37 5))) (<= 0 (+ v_prenex_52 580294)) (<= (+ (* 5 (div .cse38 5)) 549278) c_~a29~0) (<= 0 .cse39) (< .cse37 0) (= 0 (mod .cse38 5)) (<= (+ v_prenex_52 580292) 0)))))) (exists ((v_prenex_42 Int)) (let ((.cse41 (* 9 v_prenex_42))) (let ((.cse42 (div .cse41 10))) (let ((.cse40 (+ .cse42 1))) (and (<= 0 .cse40) (<= (+ (* 5 (div .cse40 5)) 549278) c_~a29~0) (not (= (mod .cse41 10) 0)) (<= (+ v_prenex_42 580292) 0) (< .cse41 0) (<= 0 (+ v_prenex_42 580294)) (not (= 0 (mod .cse42 5))) (< .cse42 0)))))) (exists ((v_prenex_49 Int)) (let ((.cse44 (* 9 v_prenex_49))) (let ((.cse43 (div .cse44 10))) (and (<= (+ (* 5 (div .cse43 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_49 580294)) (= (mod .cse44 10) 0) (<= 0 (+ .cse43 1)) (<= (+ v_prenex_49 580292) 0) (= 0 (mod .cse43 5)))))) (exists ((v_prenex_61 Int)) (let ((.cse46 (* 9 v_prenex_61))) (let ((.cse45 (div .cse46 10))) (and (<= 0 (+ v_prenex_61 580294)) (<= (+ (* 5 (div .cse45 5)) 549283) c_~a29~0) (= (mod .cse46 10) 0) (< .cse45 0) (<= (+ v_prenex_61 580292) 0) (<= 0 (+ .cse45 1)) (not (= 0 (mod .cse45 5))))))) (exists ((v_prenex_44 Int)) (let ((.cse49 (* 9 v_prenex_44))) (let ((.cse47 (div .cse49 10))) (let ((.cse48 (+ .cse47 1))) (and (= 0 (mod .cse47 5)) (not (= 0 (mod .cse48 5))) (not (= (mod .cse49 10) 0)) (<= (+ v_prenex_44 580292) 0) (< .cse48 0) (<= 0 (+ v_prenex_44 580294)) (< .cse49 0) (<= (+ (* 5 (div .cse48 5)) 549283) c_~a29~0)))))) (exists ((v_~a29~0_502 Int)) (let ((.cse51 (* 9 v_~a29~0_502))) (let ((.cse50 (div .cse51 10))) (and (<= (+ (* 5 (div .cse50 5)) 549278) c_~a29~0) (<= 0 .cse51) (<= (+ v_~a29~0_502 580292) 0) (<= 0 .cse50) (<= 0 (+ .cse50 1)) (<= 0 (+ v_~a29~0_502 580294)))))) (exists ((v_prenex_53 Int)) (let ((.cse52 (* 9 v_prenex_53))) (let ((.cse53 (div .cse52 10))) (and (<= (+ v_prenex_53 580292) 0) (= (mod .cse52 10) 0) (<= 0 (+ v_prenex_53 580294)) (<= 0 (+ .cse53 1)) (<= 0 .cse53) (<= (+ (* 5 (div .cse53 5)) 549278) c_~a29~0))))) (exists ((v_prenex_46 Int)) (let ((.cse54 (* 9 v_prenex_46))) (let ((.cse55 (div .cse54 10))) (let ((.cse56 (+ .cse55 1))) (and (<= 0 (+ v_prenex_46 580294)) (<= 0 .cse54) (<= (+ (* 5 (div .cse55 5)) 549278) c_~a29~0) (<= 0 .cse55) (<= (+ v_prenex_46 580292) 0) (not (= 0 (mod .cse56 5))) (< .cse56 0)))))) (exists ((v_prenex_45 Int)) (let ((.cse57 (* 9 v_prenex_45))) (let ((.cse58 (div .cse57 10))) (and (<= 0 (+ v_prenex_45 580294)) (<= 0 .cse57) (<= (+ v_prenex_45 580292) 0) (= 0 (mod (+ .cse58 1) 5)) (<= (+ (* 5 (div .cse58 5)) 549278) c_~a29~0) (= 0 (mod .cse58 5)))))) (exists ((v_prenex_60 Int)) (let ((.cse59 (* 9 v_prenex_60))) (let ((.cse60 (div .cse59 10))) (and (<= (+ v_prenex_60 580292) 0) (<= 0 .cse59) (= 0 (mod (+ .cse60 1) 5)) (<= 0 .cse60) (<= (+ (* 5 (div .cse60 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_60 580294)))))) (exists ((v_prenex_40 Int)) (let ((.cse63 (* 9 v_prenex_40))) (let ((.cse62 (div .cse63 10))) (let ((.cse61 (+ .cse62 1))) (and (< .cse61 0) (< .cse62 0) (<= 0 (+ v_prenex_40 580294)) (<= (+ v_prenex_40 580292) 0) (<= (+ (* 5 (div .cse62 5)) 549283) c_~a29~0) (<= 0 .cse63) (not (= 0 (mod .cse61 5))) (not (= 0 (mod .cse62 5)))))))) (exists ((v_prenex_62 Int)) (let ((.cse66 (* 9 v_prenex_62))) (let ((.cse64 (div .cse66 10))) (let ((.cse65 (+ .cse64 1))) (and (<= (+ v_prenex_62 580292) 0) (<= (+ (* 5 (div .cse64 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_62 580294)) (= 0 (mod .cse64 5)) (not (= 0 (mod .cse65 5))) (= (mod .cse66 10) 0) (< .cse65 0)))))) (exists ((v_prenex_51 Int)) (let ((.cse67 (* 9 v_prenex_51))) (let ((.cse68 (div .cse67 10))) (and (<= (+ v_prenex_51 580292) 0) (= (mod .cse67 10) 0) (= 0 (mod .cse68 5)) (= 0 (mod (+ .cse68 1) 5)) (<= (+ (* 5 (div .cse68 5)) 549278) c_~a29~0) (<= 0 (+ v_prenex_51 580294)))))))) is different from false [2018-10-23 20:05:10,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:05:10,445 INFO L93 Difference]: Finished difference Result 35313 states and 37898 transitions. [2018-10-23 20:05:10,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 20:05:10,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 668 [2018-10-23 20:05:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:05:10,473 INFO L225 Difference]: With dead ends: 35313 [2018-10-23 20:05:10,473 INFO L226 Difference]: Without dead ends: 19709 [2018-10-23 20:05:10,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 668 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-10-23 20:05:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19709 states. [2018-10-23 20:05:10,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19709 to 18221. [2018-10-23 20:05:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18221 states. [2018-10-23 20:05:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18221 states to 18221 states and 19493 transitions. [2018-10-23 20:05:10,688 INFO L78 Accepts]: Start accepts. Automaton has 18221 states and 19493 transitions. Word has length 668 [2018-10-23 20:05:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:05:10,689 INFO L481 AbstractCegarLoop]: Abstraction has 18221 states and 19493 transitions. [2018-10-23 20:05:10,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 20:05:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 18221 states and 19493 transitions. [2018-10-23 20:05:10,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2018-10-23 20:05:10,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:05:10,711 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:05:10,711 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:05:10,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:05:10,711 INFO L82 PathProgramCache]: Analyzing trace with hash 622879397, now seen corresponding path program 1 times [2018-10-23 20:05:10,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:05:10,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:05:10,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:05:10,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:05:10,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:05:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:05:11,475 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-23 20:05:11,652 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-23 20:05:11,943 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-23 20:05:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2169 backedges. 29 proven. 753 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2018-10-23 20:05:13,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:05:13,573 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-23 20:05:13,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:05:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:05:13,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:05:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2169 backedges. 119 proven. 663 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2018-10-23 20:05:15,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:05:15,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2018-10-23 20:05:15,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 20:05:15,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 20:05:15,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-23 20:05:15,105 INFO L87 Difference]: Start difference. First operand 18221 states and 19493 transitions. Second operand 9 states. [2018-10-23 20:05:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:05:21,226 INFO L93 Difference]: Finished difference Result 35713 states and 38212 transitions. [2018-10-23 20:05:21,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 20:05:21,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 853 [2018-10-23 20:05:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:05:21,245 INFO L225 Difference]: With dead ends: 35713 [2018-10-23 20:05:21,245 INFO L226 Difference]: Without dead ends: 17307 [2018-10-23 20:05:21,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 850 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-23 20:05:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17307 states. [2018-10-23 20:05:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17307 to 15249. [2018-10-23 20:05:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15249 states. [2018-10-23 20:05:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15249 states to 15249 states and 16206 transitions. [2018-10-23 20:05:21,411 INFO L78 Accepts]: Start accepts. Automaton has 15249 states and 16206 transitions. Word has length 853 [2018-10-23 20:05:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:05:21,411 INFO L481 AbstractCegarLoop]: Abstraction has 15249 states and 16206 transitions. [2018-10-23 20:05:21,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 20:05:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 15249 states and 16206 transitions. [2018-10-23 20:05:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2018-10-23 20:05:21,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:05:21,426 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:05:21,426 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:05:21,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:05:21,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1973785981, now seen corresponding path program 1 times [2018-10-23 20:05:21,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:05:21,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:05:21,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:05:21,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:05:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:05:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:05:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2682 backedges. 1874 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2018-10-23 20:05:22,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:05:22,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 20:05:22,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:05:22,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:05:22,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:05:22,718 INFO L87 Difference]: Start difference. First operand 15249 states and 16206 transitions. Second operand 5 states. [2018-10-23 20:05:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:05:25,060 INFO L93 Difference]: Finished difference Result 33459 states and 35534 transitions. [2018-10-23 20:05:25,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:05:25,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 868 [2018-10-23 20:05:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:05:25,078 INFO L225 Difference]: With dead ends: 33459 [2018-10-23 20:05:25,079 INFO L226 Difference]: Without dead ends: 18212 [2018-10-23 20:05:25,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:05:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18212 states. [2018-10-23 20:05:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18212 to 15434. [2018-10-23 20:05:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15434 states. [2018-10-23 20:05:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15434 states to 15434 states and 16402 transitions. [2018-10-23 20:05:25,256 INFO L78 Accepts]: Start accepts. Automaton has 15434 states and 16402 transitions. Word has length 868 [2018-10-23 20:05:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:05:25,257 INFO L481 AbstractCegarLoop]: Abstraction has 15434 states and 16402 transitions. [2018-10-23 20:05:25,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:05:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 15434 states and 16402 transitions. [2018-10-23 20:05:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2018-10-23 20:05:25,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:05:25,272 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:05:25,272 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:05:25,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:05:25,272 INFO L82 PathProgramCache]: Analyzing trace with hash 96487399, now seen corresponding path program 1 times [2018-10-23 20:05:25,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:05:25,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:05:25,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:05:25,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:05:25,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:05:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:05:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1089 proven. 1278 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-23 20:05:26,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:05:26,473 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-23 20:05:26,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:05:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:05:26,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:05:26,910 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 15 [2018-10-23 20:05:35,465 WARN L179 SmtUtils]: Spent 8.26 s on a formula simplification. DAG size of input: 201 DAG size of output: 48 [2018-10-23 20:05:36,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1333 proven. 0 refuted. 0 times theorem prover too weak. 1279 trivial. 0 not checked. [2018-10-23 20:05:36,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:05:36,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2018-10-23 20:05:36,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 20:05:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 20:05:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-23 20:05:36,825 INFO L87 Difference]: Start difference. First operand 15434 states and 16402 transitions. Second operand 9 states. [2018-10-23 20:05:40,369 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 53 [2018-10-23 20:05:45,662 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 52 [2018-10-23 20:06:00,482 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 53 [2018-10-23 20:06:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:06:18,360 INFO L93 Difference]: Finished difference Result 44785 states and 47504 transitions. [2018-10-23 20:06:18,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-23 20:06:18,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 888 [2018-10-23 20:06:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:06:18,388 INFO L225 Difference]: With dead ends: 44785 [2018-10-23 20:06:18,388 INFO L226 Difference]: Without dead ends: 28798 [2018-10-23 20:06:18,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 894 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-10-23 20:06:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28798 states. [2018-10-23 20:06:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28798 to 18960. [2018-10-23 20:06:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18960 states. [2018-10-23 20:06:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18960 states to 18960 states and 20096 transitions. [2018-10-23 20:06:18,648 INFO L78 Accepts]: Start accepts. Automaton has 18960 states and 20096 transitions. Word has length 888 [2018-10-23 20:06:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:06:18,648 INFO L481 AbstractCegarLoop]: Abstraction has 18960 states and 20096 transitions. [2018-10-23 20:06:18,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 20:06:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 18960 states and 20096 transitions. [2018-10-23 20:06:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1022 [2018-10-23 20:06:18,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:06:18,668 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:06:18,668 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:06:18,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:06:18,669 INFO L82 PathProgramCache]: Analyzing trace with hash 456932544, now seen corresponding path program 1 times [2018-10-23 20:06:18,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:06:18,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:06:18,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:06:18,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:06:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:06:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:06:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3682 backedges. 1633 proven. 0 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2018-10-23 20:06:19,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:06:19,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 20:06:19,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:06:19,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:06:19,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:06:19,855 INFO L87 Difference]: Start difference. First operand 18960 states and 20096 transitions. Second operand 5 states. [2018-10-23 20:06:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:06:22,433 INFO L93 Difference]: Finished difference Result 38842 states and 41244 transitions. [2018-10-23 20:06:22,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:06:22,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1021 [2018-10-23 20:06:22,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:06:22,435 INFO L225 Difference]: With dead ends: 38842 [2018-10-23 20:06:22,435 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 20:06:22,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:06:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 20:06:22,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 20:06:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 20:06:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 20:06:22,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1021 [2018-10-23 20:06:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:06:22,448 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 20:06:22,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:06:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 20:06:22,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 20:06:22,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 20:06:22,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:22,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:22,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:22,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:22,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:22,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:23,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:23,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:23,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:23,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:23,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:23,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:23,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:24,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:24,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:24,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:24,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:24,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:24,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:24,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:24,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:24,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:24,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:24,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:25,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:25,206 WARN L179 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 1530 DAG size of output: 1328 [2018-10-23 20:06:25,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:25,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:25,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:25,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:25,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:25,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:25,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:25,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:25,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:26,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:06:27,014 WARN L179 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 1530 DAG size of output: 1328 [2018-10-23 20:06:37,933 WARN L179 SmtUtils]: Spent 10.91 s on a formula simplification. DAG size of input: 1273 DAG size of output: 152 [2018-10-23 20:06:46,227 WARN L179 SmtUtils]: Spent 8.29 s on a formula simplification. DAG size of input: 1273 DAG size of output: 152 [2018-10-23 20:06:46,231 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-10-23 20:06:46,231 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-10-23 20:06:46,231 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-10-23 20:06:46,231 INFO L428 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-10-23 20:06:46,231 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,232 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,232 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,232 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,232 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,232 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,232 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,232 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-10-23 20:06:46,232 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-10-23 20:06:46,232 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-23 20:06:46,233 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,233 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,233 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,233 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,233 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,233 INFO L425 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,233 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,233 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,233 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,234 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-10-23 20:06:46,234 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-10-23 20:06:46,234 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-10-23 20:06:46,234 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,234 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-10-23 20:06:46,235 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse18 (= ~a25~0 13))) (let ((.cse23 (not .cse18)) (.cse17 (= ~a25~0 11)) (.cse21 (< 140 ~a29~0)) (.cse19 (< 306 ~a23~0)) (.cse11 (= ~a25~0 12)) (.cse0 (= ~a8~0 15)) (.cse1 (= ~a3~0 1)) (.cse10 (= ~a4~0 1)) (.cse12 (= ~a25~0 10)) (.cse14 (<= ~a29~0 140))) (let ((.cse3 (exists ((v_prenex_66 Int)) (and (<= 0 v_prenex_66) (<= 0 (+ ~a29~0 (* 5 (div v_prenex_66 (- 5))) 28690)) (< 140 v_prenex_66)))) (.cse2 (and .cse0 .cse1 (and (not .cse10) (and .cse12 .cse14)))) (.cse22 (and .cse11 (<= ~a4~0 0))) (.cse24 (<= (+ ~a23~0 43) 0)) (.cse4 (= ~a25~0 9)) (.cse16 (and .cse21 .cse19 .cse10)) (.cse15 (not .cse17)) (.cse6 (and .cse23 .cse14)) (.cse25 (<= 9365 ~a29~0)) (.cse13 (<= ~a23~0 312)) (.cse8 (= 15 ~a8~0)) (.cse9 (= 1 ~a4~0)) (.cse20 (<= ~a29~0 277)) (.cse5 (exists ((v_prenex_23 Int)) (let ((.cse26 (div v_prenex_23 5))) (and (<= 0 v_prenex_23) (<= 312 v_prenex_23) (= 0 (mod (+ .cse26 1) 90)) (<= ~a23~0 (+ (mod .cse26 90) 49)) (<= 0 .cse26))))) (.cse7 (<= 0 (+ ~a29~0 599898)))) (or (and .cse0 (exists ((v_prenex_28 Int)) (and (<= ~a23~0 (+ (div (+ v_prenex_28 (- 600276)) 5) 1)) (not (= 0 (mod (+ v_prenex_28 4) 5))) (< v_prenex_28 600276) (<= v_prenex_28 312))) (<= 260 ~a29~0) .cse1) (and .cse2 .cse3) (and .cse4 .cse0 (and .cse5 .cse6) .cse1 .cse7) (and .cse4 .cse8 (< 245 ~a29~0) .cse9 .cse1) (and (and .cse0 .cse10 .cse11 (<= ~a29~0 130) (<= 312 ~a23~0)) .cse1) (and .cse8 .cse9 .cse12 .cse1) (and .cse13 .cse3 .cse8 .cse9 .cse14 .cse15 .cse1) (and .cse10 .cse5 (<= 130 ~a29~0)) (and (and .cse16 .cse8) .cse17 .cse1) (and .cse18 .cse19 .cse8 .cse9 .cse1) (and .cse0 (and .cse18 .cse10 .cse20) .cse21 .cse1) (and (and .cse20 (and .cse22 .cse21)) .cse0 .cse1) (and (not .cse4) .cse0 .cse23 .cse1 .cse24) (and .cse0 .cse18 .cse5 .cse1 .cse7) (and (<= ~a23~0 364243) .cse2 .cse7) (and .cse0 .cse22 (<= 0 (+ ~a29~0 580294)) (<= (+ ~a29~0 580292) 0) .cse1) (and .cse8 .cse9 .cse5 .cse1) (and .cse18 .cse8 .cse9 (<= 27015 ~a29~0) .cse1) (and .cse11 .cse21 .cse20 .cse8 .cse9 .cse1) (and .cse0 .cse25 .cse1 .cse24) (and .cse0 (and .cse4 .cse16) .cse1) (and .cse15 .cse13 .cse10 (not .cse11) .cse6 (not .cse12)) (and .cse10 .cse5 .cse6) (and (and .cse8 .cse17 .cse9 .cse1) .cse25) (and .cse11 .cse13 .cse8 .cse9 .cse1 .cse7) (and .cse8 .cse9 .cse17 .cse21 .cse20 .cse1) (and .cse0 (and .cse11 .cse5) .cse1 .cse7))))) [2018-10-23 20:06:46,235 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,235 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,235 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,235 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,235 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,235 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,235 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,235 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,236 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-10-23 20:06:46,236 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-10-23 20:06:46,236 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-10-23 20:06:46,236 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-10-23 20:06:46,236 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-10-23 20:06:46,236 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-10-23 20:06:46,236 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-10-23 20:06:46,236 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,236 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,236 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,237 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,238 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,239 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,239 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-10-23 20:06:46,239 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-10-23 20:06:46,239 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,239 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,239 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-10-23 20:06:46,239 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-10-23 20:06:46,239 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-10-23 20:06:46,239 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,239 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,239 INFO L425 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,240 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,240 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,240 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,240 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,240 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-10-23 20:06:46,240 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-10-23 20:06:46,240 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-10-23 20:06:46,240 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-10-23 20:06:46,240 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-10-23 20:06:46,241 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-10-23 20:06:46,241 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-10-23 20:06:46,241 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,241 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,241 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-23 20:06:46,241 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-10-23 20:06:46,241 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-10-23 20:06:46,241 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,241 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,241 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,242 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,242 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,242 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-10-23 20:06:46,242 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-10-23 20:06:46,242 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-10-23 20:06:46,242 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,242 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,242 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,242 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,243 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,243 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,243 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-10-23 20:06:46,243 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-10-23 20:06:46,243 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-10-23 20:06:46,243 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,243 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,243 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,243 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,244 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,244 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,244 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,244 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-23 20:06:46,244 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,244 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-10-23 20:06:46,244 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-10-23 20:06:46,244 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-10-23 20:06:46,244 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,244 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,245 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,245 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,245 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,245 INFO L425 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,245 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,245 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,245 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,245 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,245 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,245 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-10-23 20:06:46,246 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-10-23 20:06:46,246 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-10-23 20:06:46,246 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-10-23 20:06:46,246 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-10-23 20:06:46,246 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,246 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,246 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,246 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,246 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,246 INFO L425 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,247 INFO L425 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,247 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-10-23 20:06:46,247 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-10-23 20:06:46,247 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-10-23 20:06:46,247 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,247 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,247 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,247 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-10-23 20:06:46,247 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-10-23 20:06:46,247 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,247 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,248 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,248 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,248 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,248 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-10-23 20:06:46,248 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-10-23 20:06:46,248 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,248 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,248 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-10-23 20:06:46,248 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-10-23 20:06:46,248 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,248 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,249 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,249 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,249 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,249 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,249 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-10-23 20:06:46,249 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-10-23 20:06:46,249 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-10-23 20:06:46,249 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-10-23 20:06:46,249 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,249 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,250 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,250 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,250 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,250 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,250 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,250 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,250 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-10-23 20:06:46,250 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-10-23 20:06:46,250 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-10-23 20:06:46,250 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-10-23 20:06:46,250 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-10-23 20:06:46,251 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-10-23 20:06:46,251 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,251 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,251 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,251 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,251 INFO L425 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,251 INFO L425 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,251 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,251 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-10-23 20:06:46,251 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-10-23 20:06:46,252 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-23 20:06:46,252 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,252 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,252 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,252 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,252 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,252 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,252 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-10-23 20:06:46,252 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-10-23 20:06:46,252 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,252 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,253 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,253 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,253 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,253 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,253 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,253 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-10-23 20:06:46,253 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,253 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,253 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,253 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-10-23 20:06:46,254 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-10-23 20:06:46,254 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-10-23 20:06:46,254 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,254 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-10-23 20:06:46,254 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,254 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-10-23 20:06:46,254 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,254 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,254 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,254 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,255 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,255 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,255 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 69) no Hoare annotation was computed. [2018-10-23 20:06:46,255 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-10-23 20:06:46,255 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-10-23 20:06:46,255 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-10-23 20:06:46,255 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,255 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,255 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,255 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-23 20:06:46,256 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,256 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,256 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,256 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,256 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,256 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,256 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,256 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-10-23 20:06:46,256 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-10-23 20:06:46,256 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-10-23 20:06:46,257 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,257 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-10-23 20:06:46,257 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-10-23 20:06:46,257 INFO L425 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,257 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,257 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,257 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,257 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,257 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,257 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-10-23 20:06:46,258 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-10-23 20:06:46,258 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-10-23 20:06:46,258 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,258 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,258 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,259 INFO L421 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse18 (= ~a25~0 13))) (let ((.cse23 (not .cse18)) (.cse17 (= ~a25~0 11)) (.cse21 (< 140 ~a29~0)) (.cse19 (< 306 ~a23~0)) (.cse11 (= ~a25~0 12)) (.cse0 (= ~a8~0 15)) (.cse1 (= ~a3~0 1)) (.cse10 (= ~a4~0 1)) (.cse12 (= ~a25~0 10)) (.cse14 (<= ~a29~0 140))) (let ((.cse3 (exists ((v_prenex_66 Int)) (and (<= 0 v_prenex_66) (<= 0 (+ ~a29~0 (* 5 (div v_prenex_66 (- 5))) 28690)) (< 140 v_prenex_66)))) (.cse2 (and .cse0 .cse1 (and (not .cse10) (and .cse12 .cse14)))) (.cse22 (and .cse11 (<= ~a4~0 0))) (.cse24 (<= (+ ~a23~0 43) 0)) (.cse4 (= ~a25~0 9)) (.cse16 (and .cse21 .cse19 .cse10)) (.cse15 (not .cse17)) (.cse6 (and .cse23 .cse14)) (.cse25 (<= 9365 ~a29~0)) (.cse13 (<= ~a23~0 312)) (.cse8 (= 15 ~a8~0)) (.cse9 (= 1 ~a4~0)) (.cse20 (<= ~a29~0 277)) (.cse5 (exists ((v_prenex_23 Int)) (let ((.cse26 (div v_prenex_23 5))) (and (<= 0 v_prenex_23) (<= 312 v_prenex_23) (= 0 (mod (+ .cse26 1) 90)) (<= ~a23~0 (+ (mod .cse26 90) 49)) (<= 0 .cse26))))) (.cse7 (<= 0 (+ ~a29~0 599898)))) (or (and .cse0 (exists ((v_prenex_28 Int)) (and (<= ~a23~0 (+ (div (+ v_prenex_28 (- 600276)) 5) 1)) (not (= 0 (mod (+ v_prenex_28 4) 5))) (< v_prenex_28 600276) (<= v_prenex_28 312))) (<= 260 ~a29~0) .cse1) (and .cse2 .cse3) (and .cse4 .cse0 (and .cse5 .cse6) .cse1 .cse7) (and .cse4 .cse8 (< 245 ~a29~0) .cse9 .cse1) (and (and .cse0 .cse10 .cse11 (<= ~a29~0 130) (<= 312 ~a23~0)) .cse1) (and .cse8 .cse9 .cse12 .cse1) (and .cse13 .cse3 .cse8 .cse9 .cse14 .cse15 .cse1) (and .cse10 .cse5 (<= 130 ~a29~0)) (and (and .cse16 .cse8) .cse17 .cse1) (and .cse18 .cse19 .cse8 .cse9 .cse1) (and .cse0 (and .cse18 .cse10 .cse20) .cse21 .cse1) (and (and .cse20 (and .cse22 .cse21)) .cse0 .cse1) (and (not .cse4) .cse0 .cse23 .cse1 .cse24) (and .cse0 .cse18 .cse5 .cse1 .cse7) (and (<= ~a23~0 364243) .cse2 .cse7) (and .cse0 .cse22 (<= 0 (+ ~a29~0 580294)) (<= (+ ~a29~0 580292) 0) .cse1) (and .cse8 .cse9 .cse5 .cse1) (and .cse18 .cse8 .cse9 (<= 27015 ~a29~0) .cse1) (and .cse11 .cse21 .cse20 .cse8 .cse9 .cse1) (and .cse0 .cse25 .cse1 .cse24) (and .cse0 (and .cse4 .cse16) .cse1) (and .cse15 .cse13 .cse10 (not .cse11) .cse6 (not .cse12)) (and .cse10 .cse5 .cse6) (and (and .cse8 .cse17 .cse9 .cse1) .cse25) (and .cse11 .cse13 .cse8 .cse9 .cse1 .cse7) (and .cse8 .cse9 .cse17 .cse21 .cse20 .cse1) (and .cse0 (and .cse11 .cse5) .cse1 .cse7))))) [2018-10-23 20:06:46,259 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,259 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-10-23 20:06:46,259 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-10-23 20:06:46,259 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,259 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,259 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-10-23 20:06:46,259 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,259 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,260 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-10-23 20:06:46,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,278 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,278 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,278 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,279 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,279 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,279 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,282 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,284 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,284 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,284 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,285 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,285 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,286 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,319 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,319 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,319 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,320 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,320 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,320 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,321 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,321 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,321 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,323 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,323 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,323 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,324 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,324 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,324 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,325 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,325 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,325 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,325 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,326 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,326 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,327 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,327 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,327 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,327 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,328 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,328 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,328 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,328 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,329 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,334 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,334 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,334 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,335 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,336 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,336 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,336 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,339 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,339 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,340 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,340 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,340 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,341 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,343 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,344 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,344 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,344 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,345 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,346 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,351 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,358 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,358 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,359 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,359 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,359 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,360 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,360 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,360 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,361 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,361 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,361 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,362 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,362 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,362 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,363 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,363 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,364 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,364 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,364 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,365 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,365 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,365 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,365 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,370 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,370 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,371 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,371 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,371 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,371 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,372 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,372 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,372 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,372 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,372 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,373 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,373 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:06:46 BoogieIcfgContainer [2018-10-23 20:06:46,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 20:06:46,377 INFO L168 Benchmark]: Toolchain (without parser) took 209220.86 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -77.0 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-23 20:06:46,379 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-23 20:06:46,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1000.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-10-23 20:06:46,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 293.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -810.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2018-10-23 20:06:46,382 INFO L168 Benchmark]: Boogie Preprocessor took 152.45 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 20:06:46,383 INFO L168 Benchmark]: RCFGBuilder took 5031.26 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 180.8 MB). Peak memory consumption was 180.8 MB. Max. memory is 7.1 GB. [2018-10-23 20:06:46,384 INFO L168 Benchmark]: TraceAbstraction took 202737.35 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 489.5 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-10-23 20:06:46,394 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 1000.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 293.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -810.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.45 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5031.26 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 180.8 MB). Peak memory consumption was 180.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 202737.35 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 489.5 MB). Peak memory consumption was 2.3 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_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 69]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2018-10-23 20:06:46,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,423 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,423 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,423 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,424 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,424 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,424 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,424 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,425 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,425 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,425 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,426 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,426 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,426 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,426 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,426 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,427 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,427 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,427 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,427 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,428 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,428 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,428 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,428 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,428 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,429 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,429 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,429 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,429 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,429 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,431 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,431 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,431 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,432 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,432 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,432 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,433 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,433 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,433 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,434 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,434 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,434 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,435 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,435 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,435 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,435 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,436 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,436 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,436 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,437 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,437 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,437 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,437 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a8 == 15 && (\exists v_prenex_28 : int :: ((a23 <= (v_prenex_28 + -600276) / 5 + 1 && !(0 == (v_prenex_28 + 4) % 5)) && v_prenex_28 < 600276) && v_prenex_28 <= 312)) && 260 <= a29) && a3 == 1) || (((a8 == 15 && a3 == 1) && !(a4 == 1) && a25 == 10 && a29 <= 140) && (\exists v_prenex_66 : int :: (0 <= v_prenex_66 && 0 <= a29 + 5 * (v_prenex_66 / -5) + 28690) && 140 < v_prenex_66))) || ((((a25 == 9 && a8 == 15) && (\exists v_prenex_23 : int :: (((0 <= v_prenex_23 && 312 <= v_prenex_23) && 0 == (v_prenex_23 / 5 + 1) % 90) && a23 <= v_prenex_23 / 5 % 90 + 49) && 0 <= v_prenex_23 / 5) && !(a25 == 13) && a29 <= 140) && a3 == 1) && 0 <= a29 + 599898)) || ((((a25 == 9 && 15 == a8) && 245 < a29) && 1 == a4) && a3 == 1)) || (((((a8 == 15 && a4 == 1) && a25 == 12) && a29 <= 130) && 312 <= a23) && a3 == 1)) || (((15 == a8 && 1 == a4) && a25 == 10) && a3 == 1)) || ((((((a23 <= 312 && (\exists v_prenex_66 : int :: (0 <= v_prenex_66 && 0 <= a29 + 5 * (v_prenex_66 / -5) + 28690) && 140 < v_prenex_66)) && 15 == a8) && 1 == a4) && a29 <= 140) && !(a25 == 11)) && a3 == 1)) || ((a4 == 1 && (\exists v_prenex_23 : int :: (((0 <= v_prenex_23 && 312 <= v_prenex_23) && 0 == (v_prenex_23 / 5 + 1) % 90) && a23 <= v_prenex_23 / 5 % 90 + 49) && 0 <= v_prenex_23 / 5)) && 130 <= a29)) || (((((140 < a29 && 306 < a23) && a4 == 1) && 15 == a8) && a25 == 11) && a3 == 1)) || ((((a25 == 13 && 306 < a23) && 15 == a8) && 1 == a4) && a3 == 1)) || (((a8 == 15 && (a25 == 13 && a4 == 1) && a29 <= 277) && 140 < a29) && a3 == 1)) || (((a29 <= 277 && (a25 == 12 && a4 <= 0) && 140 < a29) && a8 == 15) && a3 == 1)) || ((((!(a25 == 9) && a8 == 15) && !(a25 == 13)) && a3 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && a25 == 13) && (\exists v_prenex_23 : int :: (((0 <= v_prenex_23 && 312 <= v_prenex_23) && 0 == (v_prenex_23 / 5 + 1) % 90) && a23 <= v_prenex_23 / 5 % 90 + 49) && 0 <= v_prenex_23 / 5)) && a3 == 1) && 0 <= a29 + 599898)) || ((a23 <= 364243 && (a8 == 15 && a3 == 1) && !(a4 == 1) && a25 == 10 && a29 <= 140) && 0 <= a29 + 599898)) || ((((a8 == 15 && a25 == 12 && a4 <= 0) && 0 <= a29 + 580294) && a29 + 580292 <= 0) && a3 == 1)) || (((15 == a8 && 1 == a4) && (\exists v_prenex_23 : int :: (((0 <= v_prenex_23 && 312 <= v_prenex_23) && 0 == (v_prenex_23 / 5 + 1) % 90) && a23 <= v_prenex_23 / 5 % 90 + 49) && 0 <= v_prenex_23 / 5)) && a3 == 1)) || ((((a25 == 13 && 15 == a8) && 1 == a4) && 27015 <= a29) && a3 == 1)) || (((((a25 == 12 && 140 < a29) && a29 <= 277) && 15 == a8) && 1 == a4) && a3 == 1)) || (((a8 == 15 && 9365 <= a29) && a3 == 1) && a23 + 43 <= 0)) || ((a8 == 15 && a25 == 9 && (140 < a29 && 306 < a23) && a4 == 1) && a3 == 1)) || (((((!(a25 == 11) && a23 <= 312) && a4 == 1) && !(a25 == 12)) && !(a25 == 13) && a29 <= 140) && !(a25 == 10))) || ((a4 == 1 && (\exists v_prenex_23 : int :: (((0 <= v_prenex_23 && 312 <= v_prenex_23) && 0 == (v_prenex_23 / 5 + 1) % 90) && a23 <= v_prenex_23 / 5 % 90 + 49) && 0 <= v_prenex_23 / 5)) && !(a25 == 13) && a29 <= 140)) || ((((15 == a8 && a25 == 11) && 1 == a4) && a3 == 1) && 9365 <= a29)) || (((((a25 == 12 && a23 <= 312) && 15 == a8) && 1 == a4) && a3 == 1) && 0 <= a29 + 599898)) || (((((15 == a8 && 1 == a4) && a25 == 11) && 140 < a29) && a29 <= 277) && a3 == 1)) || (((a8 == 15 && a25 == 12 && (\exists v_prenex_23 : int :: (((0 <= v_prenex_23 && 312 <= v_prenex_23) && 0 == (v_prenex_23 / 5 + 1) % 90) && a23 <= v_prenex_23 / 5 % 90 + 49) && 0 <= v_prenex_23 / 5)) && a3 == 1) && 0 <= a29 + 599898) - InvariantResult [Line: 22]: Loop Invariant [2018-10-23 20:06:46,443 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,443 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,443 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,446 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,446 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,446 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,451 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,452 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,452 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,452 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,452 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,452 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,453 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,454 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,454 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,455 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,455 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_28,QUANTIFIED] [2018-10-23 20:06:46,455 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,458 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,458 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,458 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_66,QUANTIFIED] [2018-10-23 20:06:46,459 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,459 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,459 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,459 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,460 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,460 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,460 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,460 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,461 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,461 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,461 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,461 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,462 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,462 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,462 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,462 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,463 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,463 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,463 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,463 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,463 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,463 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,464 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,464 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-10-23 20:06:46,464 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a8 == 15 && (\exists v_prenex_28 : int :: ((a23 <= (v_prenex_28 + -600276) / 5 + 1 && !(0 == (v_prenex_28 + 4) % 5)) && v_prenex_28 < 600276) && v_prenex_28 <= 312)) && 260 <= a29) && a3 == 1) || (((a8 == 15 && a3 == 1) && !(a4 == 1) && a25 == 10 && a29 <= 140) && (\exists v_prenex_66 : int :: (0 <= v_prenex_66 && 0 <= a29 + 5 * (v_prenex_66 / -5) + 28690) && 140 < v_prenex_66))) || ((((a25 == 9 && a8 == 15) && (\exists v_prenex_23 : int :: (((0 <= v_prenex_23 && 312 <= v_prenex_23) && 0 == (v_prenex_23 / 5 + 1) % 90) && a23 <= v_prenex_23 / 5 % 90 + 49) && 0 <= v_prenex_23 / 5) && !(a25 == 13) && a29 <= 140) && a3 == 1) && 0 <= a29 + 599898)) || ((((a25 == 9 && 15 == a8) && 245 < a29) && 1 == a4) && a3 == 1)) || (((((a8 == 15 && a4 == 1) && a25 == 12) && a29 <= 130) && 312 <= a23) && a3 == 1)) || (((15 == a8 && 1 == a4) && a25 == 10) && a3 == 1)) || ((((((a23 <= 312 && (\exists v_prenex_66 : int :: (0 <= v_prenex_66 && 0 <= a29 + 5 * (v_prenex_66 / -5) + 28690) && 140 < v_prenex_66)) && 15 == a8) && 1 == a4) && a29 <= 140) && !(a25 == 11)) && a3 == 1)) || ((a4 == 1 && (\exists v_prenex_23 : int :: (((0 <= v_prenex_23 && 312 <= v_prenex_23) && 0 == (v_prenex_23 / 5 + 1) % 90) && a23 <= v_prenex_23 / 5 % 90 + 49) && 0 <= v_prenex_23 / 5)) && 130 <= a29)) || (((((140 < a29 && 306 < a23) && a4 == 1) && 15 == a8) && a25 == 11) && a3 == 1)) || ((((a25 == 13 && 306 < a23) && 15 == a8) && 1 == a4) && a3 == 1)) || (((a8 == 15 && (a25 == 13 && a4 == 1) && a29 <= 277) && 140 < a29) && a3 == 1)) || (((a29 <= 277 && (a25 == 12 && a4 <= 0) && 140 < a29) && a8 == 15) && a3 == 1)) || ((((!(a25 == 9) && a8 == 15) && !(a25 == 13)) && a3 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && a25 == 13) && (\exists v_prenex_23 : int :: (((0 <= v_prenex_23 && 312 <= v_prenex_23) && 0 == (v_prenex_23 / 5 + 1) % 90) && a23 <= v_prenex_23 / 5 % 90 + 49) && 0 <= v_prenex_23 / 5)) && a3 == 1) && 0 <= a29 + 599898)) || ((a23 <= 364243 && (a8 == 15 && a3 == 1) && !(a4 == 1) && a25 == 10 && a29 <= 140) && 0 <= a29 + 599898)) || ((((a8 == 15 && a25 == 12 && a4 <= 0) && 0 <= a29 + 580294) && a29 + 580292 <= 0) && a3 == 1)) || (((15 == a8 && 1 == a4) && (\exists v_prenex_23 : int :: (((0 <= v_prenex_23 && 312 <= v_prenex_23) && 0 == (v_prenex_23 / 5 + 1) % 90) && a23 <= v_prenex_23 / 5 % 90 + 49) && 0 <= v_prenex_23 / 5)) && a3 == 1)) || ((((a25 == 13 && 15 == a8) && 1 == a4) && 27015 <= a29) && a3 == 1)) || (((((a25 == 12 && 140 < a29) && a29 <= 277) && 15 == a8) && 1 == a4) && a3 == 1)) || (((a8 == 15 && 9365 <= a29) && a3 == 1) && a23 + 43 <= 0)) || ((a8 == 15 && a25 == 9 && (140 < a29 && 306 < a23) && a4 == 1) && a3 == 1)) || (((((!(a25 == 11) && a23 <= 312) && a4 == 1) && !(a25 == 12)) && !(a25 == 13) && a29 <= 140) && !(a25 == 10))) || ((a4 == 1 && (\exists v_prenex_23 : int :: (((0 <= v_prenex_23 && 312 <= v_prenex_23) && 0 == (v_prenex_23 / 5 + 1) % 90) && a23 <= v_prenex_23 / 5 % 90 + 49) && 0 <= v_prenex_23 / 5)) && !(a25 == 13) && a29 <= 140)) || ((((15 == a8 && a25 == 11) && 1 == a4) && a3 == 1) && 9365 <= a29)) || (((((a25 == 12 && a23 <= 312) && 15 == a8) && 1 == a4) && a3 == 1) && 0 <= a29 + 599898)) || (((((15 == a8 && 1 == a4) && a25 == 11) && 140 < a29) && a29 <= 277) && a3 == 1)) || (((a8 == 15 && a25 == 12 && (\exists v_prenex_23 : int :: (((0 <= v_prenex_23 && 312 <= v_prenex_23) && 0 == (v_prenex_23 / 5 + 1) % 90) && a23 <= v_prenex_23 / 5 % 90 + 49) && 0 <= v_prenex_23 / 5)) && a3 == 1) && 0 <= a29 + 599898) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. SAFE Result, 202.5s OverallTime, 21 OverallIterations, 10 TraceHistogramMax, 133.6s AutomataDifference, 0.0s DeadEndRemovalTime, 23.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 3752 SDtfs, 13445 SDslu, 2457 SDs, 0 SdLazy, 38266 SolverSat, 6126 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 109.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4429 GetRequests, 4315 SyntacticMatches, 11 SemanticMatches, 103 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 29.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18960occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 35655 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 324 NumberOfFragments, 1475 HoareAnnotationTreeSize, 3 FomulaSimplifications, 226098 FormulaSimplificationTreeSizeReduction, 4.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 268084 FormulaSimplificationTreeSizeReductionInter, 19.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 31.8s InterpolantComputationTime, 14382 NumberOfCodeBlocks, 14382 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 14354 ConstructedInterpolants, 460 QuantifiedInterpolants, 66929333 SizeOfPredicates, 17 NumberOfNonLiveVariables, 5564 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 26118/29528 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...