java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:27:24,005 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:27:24,007 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:27:24,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:27:24,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:27:24,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:27:24,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:27:24,024 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:27:24,025 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:27:24,026 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:27:24,027 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:27:24,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:27:24,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:27:24,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:27:24,031 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:27:24,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:27:24,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:27:24,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:27:24,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:27:24,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:27:24,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:27:24,041 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:27:24,043 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:27:24,043 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:27:24,044 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:27:24,045 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:27:24,046 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:27:24,046 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:27:24,047 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:27:24,048 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:27:24,049 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:27:24,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:27:24,049 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:27:24,050 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:27:24,051 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:27:24,051 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:27:24,052 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:27:24,067 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:27:24,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:27:24,068 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:27:24,068 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:27:24,069 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:27:24,069 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:27:24,069 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:27:24,070 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:27:24,070 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:27:24,070 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:27:24,070 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:27:24,070 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:27:24,071 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:27:24,071 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:27:24,071 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:27:24,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:27:24,072 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:27:24,072 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:27:24,072 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:27:24,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:27:24,072 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:27:24,073 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:27:24,073 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:27:24,073 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:27:24,073 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:27:24,073 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:27:24,074 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:27:24,074 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:27:24,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:27:24,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:27:24,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:27:24,144 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:27:24,144 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:27:24,145 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c [2018-11-06 21:27:24,221 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/465c3b20c/9f7941a48f6c4c9e8c62eb560f988453/FLAG87411b28f [2018-11-06 21:27:24,784 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:27:24,785 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c [2018-11-06 21:27:24,807 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/465c3b20c/9f7941a48f6c4c9e8c62eb560f988453/FLAG87411b28f [2018-11-06 21:27:24,830 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/465c3b20c/9f7941a48f6c4c9e8c62eb560f988453 [2018-11-06 21:27:24,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:27:24,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:27:24,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:27:24,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:27:24,854 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:27:24,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:27:24" (1/1) ... [2018-11-06 21:27:24,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d0f1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:24, skipping insertion in model container [2018-11-06 21:27:24,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:27:24" (1/1) ... [2018-11-06 21:27:24,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:27:24,953 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:27:25,560 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:27:25,565 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:27:25,767 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:27:25,790 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:27:25,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:25 WrapperNode [2018-11-06 21:27:25,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:27:25,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:27:25,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:27:25,793 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:27:25,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:25" (1/1) ... [2018-11-06 21:27:25,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:25" (1/1) ... [2018-11-06 21:27:26,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:27:26,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:27:26,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:27:26,040 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:27:26,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:25" (1/1) ... [2018-11-06 21:27:26,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:25" (1/1) ... [2018-11-06 21:27:26,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:25" (1/1) ... [2018-11-06 21:27:26,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:25" (1/1) ... [2018-11-06 21:27:26,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:25" (1/1) ... [2018-11-06 21:27:26,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:25" (1/1) ... [2018-11-06 21:27:26,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:25" (1/1) ... [2018-11-06 21:27:26,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:27:26,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:27:26,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:27:26,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:27:26,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:27:26,231 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:27:26,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:27:26,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:27:29,596 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:27:29,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:27:29 BoogieIcfgContainer [2018-11-06 21:27:29,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:27:29,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:27:29,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:27:29,602 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:27:29,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:27:24" (1/3) ... [2018-11-06 21:27:29,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40772ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:27:29, skipping insertion in model container [2018-11-06 21:27:29,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:25" (2/3) ... [2018-11-06 21:27:29,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40772ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:27:29, skipping insertion in model container [2018-11-06 21:27:29,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:27:29" (3/3) ... [2018-11-06 21:27:29,607 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label46_true-unreach-call_false-termination.c [2018-11-06 21:27:29,618 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:27:29,628 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:27:29,646 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:27:29,685 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:27:29,686 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:27:29,686 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:27:29,686 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:27:29,686 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:27:29,687 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:27:29,688 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:27:29,688 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:27:29,688 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:27:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-11-06 21:27:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-06 21:27:29,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:29,725 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:27:29,728 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:29,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:29,735 INFO L82 PathProgramCache]: Analyzing trace with hash 935177138, now seen corresponding path program 1 times [2018-11-06 21:27:29,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:29,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:29,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:29,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:29,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:27:30,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:27:30,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:27:30,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:27:30,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:27:30,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:27:30,257 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-11-06 21:27:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:32,824 INFO L93 Difference]: Finished difference Result 854 states and 1562 transitions. [2018-11-06 21:27:32,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:27:32,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-06 21:27:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:32,852 INFO L225 Difference]: With dead ends: 854 [2018-11-06 21:27:32,852 INFO L226 Difference]: Without dead ends: 601 [2018-11-06 21:27:32,857 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:27:32,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-11-06 21:27:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-11-06 21:27:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-11-06 21:27:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 992 transitions. [2018-11-06 21:27:32,944 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 992 transitions. Word has length 40 [2018-11-06 21:27:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:32,944 INFO L480 AbstractCegarLoop]: Abstraction has 601 states and 992 transitions. [2018-11-06 21:27:32,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:27:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 992 transitions. [2018-11-06 21:27:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-06 21:27:32,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:32,952 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:27:32,952 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:32,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash 896856070, now seen corresponding path program 1 times [2018-11-06 21:27:32,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:32,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:32,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:32,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:32,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:27:33,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:27:33,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:27:33,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:27:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:27:33,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:27:33,250 INFO L87 Difference]: Start difference. First operand 601 states and 992 transitions. Second operand 4 states. [2018-11-06 21:27:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:36,361 INFO L93 Difference]: Finished difference Result 2274 states and 3840 transitions. [2018-11-06 21:27:36,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:27:36,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-11-06 21:27:36,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:36,372 INFO L225 Difference]: With dead ends: 2274 [2018-11-06 21:27:36,373 INFO L226 Difference]: Without dead ends: 1675 [2018-11-06 21:27:36,376 INFO L604 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-11-06 21:27:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2018-11-06 21:27:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1496. [2018-11-06 21:27:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-06 21:27:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2250 transitions. [2018-11-06 21:27:36,448 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2250 transitions. Word has length 131 [2018-11-06 21:27:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:36,449 INFO L480 AbstractCegarLoop]: Abstraction has 1496 states and 2250 transitions. [2018-11-06 21:27:36,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:27:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2250 transitions. [2018-11-06 21:27:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-06 21:27:36,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:36,466 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:27:36,466 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:36,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:36,467 INFO L82 PathProgramCache]: Analyzing trace with hash -90583296, now seen corresponding path program 1 times [2018-11-06 21:27:36,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:36,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:36,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:36,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-06 21:27:36,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:27:36,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:27:36,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:27:36,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:27:36,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:27:36,890 INFO L87 Difference]: Start difference. First operand 1496 states and 2250 transitions. Second operand 4 states. [2018-11-06 21:27:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:39,867 INFO L93 Difference]: Finished difference Result 4793 states and 7208 transitions. [2018-11-06 21:27:39,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:27:39,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-11-06 21:27:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:39,887 INFO L225 Difference]: With dead ends: 4793 [2018-11-06 21:27:39,888 INFO L226 Difference]: Without dead ends: 3299 [2018-11-06 21:27:39,891 INFO L604 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-11-06 21:27:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2018-11-06 21:27:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 3299. [2018-11-06 21:27:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3299 states. [2018-11-06 21:27:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 4489 transitions. [2018-11-06 21:27:39,956 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 4489 transitions. Word has length 285 [2018-11-06 21:27:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:39,957 INFO L480 AbstractCegarLoop]: Abstraction has 3299 states and 4489 transitions. [2018-11-06 21:27:39,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:27:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 4489 transitions. [2018-11-06 21:27:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-11-06 21:27:39,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:39,966 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:27:39,966 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:39,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:39,966 INFO L82 PathProgramCache]: Analyzing trace with hash -623243284, now seen corresponding path program 1 times [2018-11-06 21:27:39,967 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:39,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:39,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:39,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:39,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 252 proven. 5 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-06 21:27:40,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:27:40,332 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:27:40,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:40,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:27:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-11-06 21:27:40,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:27:40,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:27:40,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:27:40,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:27:40,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:27:40,752 INFO L87 Difference]: Start difference. First operand 3299 states and 4489 transitions. Second operand 6 states. [2018-11-06 21:27:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:27:50,478 INFO L93 Difference]: Finished difference Result 9294 states and 12644 transitions. [2018-11-06 21:27:50,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:27:50,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 321 [2018-11-06 21:27:50,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:27:50,505 INFO L225 Difference]: With dead ends: 9294 [2018-11-06 21:27:50,505 INFO L226 Difference]: Without dead ends: 5636 [2018-11-06 21:27:50,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 321 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:27:50,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5636 states. [2018-11-06 21:27:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5636 to 4538. [2018-11-06 21:27:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4538 states. [2018-11-06 21:27:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4538 states to 4538 states and 5392 transitions. [2018-11-06 21:27:50,595 INFO L78 Accepts]: Start accepts. Automaton has 4538 states and 5392 transitions. Word has length 321 [2018-11-06 21:27:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:27:50,596 INFO L480 AbstractCegarLoop]: Abstraction has 4538 states and 5392 transitions. [2018-11-06 21:27:50,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:27:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4538 states and 5392 transitions. [2018-11-06 21:27:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-11-06 21:27:50,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:27:50,607 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:27:50,607 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:27:50,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:27:50,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1969378935, now seen corresponding path program 1 times [2018-11-06 21:27:50,608 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:27:50,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:27:50,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:50,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:50,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:27:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:50,961 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 21:27:51,264 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-06 21:27:51,610 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-06 21:27:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 371 proven. 46 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-06 21:27:52,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:27:52,094 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:27:52,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:27:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:27:52,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:27:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-06 21:27:52,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:27:52,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-11-06 21:27:52,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:27:52,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:27:52,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:27:52,344 INFO L87 Difference]: Start difference. First operand 4538 states and 5392 transitions. Second operand 8 states. [2018-11-06 21:27:56,854 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-11-06 21:28:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:02,642 INFO L93 Difference]: Finished difference Result 9273 states and 10988 transitions. [2018-11-06 21:28:02,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 21:28:02,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 453 [2018-11-06 21:28:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:02,663 INFO L225 Difference]: With dead ends: 9273 [2018-11-06 21:28:02,663 INFO L226 Difference]: Without dead ends: 4916 [2018-11-06 21:28:02,669 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 454 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:28:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4916 states. [2018-11-06 21:28:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4916 to 4538. [2018-11-06 21:28:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4538 states. [2018-11-06 21:28:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4538 states to 4538 states and 5124 transitions. [2018-11-06 21:28:02,747 INFO L78 Accepts]: Start accepts. Automaton has 4538 states and 5124 transitions. Word has length 453 [2018-11-06 21:28:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:02,748 INFO L480 AbstractCegarLoop]: Abstraction has 4538 states and 5124 transitions. [2018-11-06 21:28:02,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:28:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4538 states and 5124 transitions. [2018-11-06 21:28:02,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-11-06 21:28:02,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:02,769 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:02,770 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:02,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:02,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2022638733, now seen corresponding path program 1 times [2018-11-06 21:28:02,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:02,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:02,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1621 backedges. 1006 proven. 0 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-11-06 21:28:03,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:03,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:28:03,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:28:03,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:28:03,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:28:03,814 INFO L87 Difference]: Start difference. First operand 4538 states and 5124 transitions. Second operand 7 states. [2018-11-06 21:28:05,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:05,517 INFO L93 Difference]: Finished difference Result 9546 states and 10894 transitions. [2018-11-06 21:28:05,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:28:05,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 648 [2018-11-06 21:28:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:05,535 INFO L225 Difference]: With dead ends: 9546 [2018-11-06 21:28:05,535 INFO L226 Difference]: Without dead ends: 4535 [2018-11-06 21:28:05,540 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:28:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2018-11-06 21:28:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4535. [2018-11-06 21:28:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4535 states. [2018-11-06 21:28:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 5047 transitions. [2018-11-06 21:28:05,615 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 5047 transitions. Word has length 648 [2018-11-06 21:28:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:05,615 INFO L480 AbstractCegarLoop]: Abstraction has 4535 states and 5047 transitions. [2018-11-06 21:28:05,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:28:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 5047 transitions. [2018-11-06 21:28:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2018-11-06 21:28:05,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:05,624 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:28:05,625 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:05,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:05,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1502830499, now seen corresponding path program 1 times [2018-11-06 21:28:05,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:05,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:05,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:05,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:05,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:06,254 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:28:06,493 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 21:28:06,668 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-06 21:28:06,938 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-06 21:28:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1835 backedges. 1340 proven. 201 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-11-06 21:28:07,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:28:07,991 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:28:08,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:08,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:28:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1835 backedges. 736 proven. 0 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2018-11-06 21:28:08,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:28:08,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-06 21:28:08,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:28:08,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:28:08,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:28:08,526 INFO L87 Difference]: Start difference. First operand 4535 states and 5047 transitions. Second operand 10 states. [2018-11-06 21:28:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:12,143 INFO L93 Difference]: Finished difference Result 9975 states and 11128 transitions. [2018-11-06 21:28:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 21:28:12,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 775 [2018-11-06 21:28:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:12,162 INFO L225 Difference]: With dead ends: 9975 [2018-11-06 21:28:12,162 INFO L226 Difference]: Without dead ends: 5621 [2018-11-06 21:28:12,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 779 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-11-06 21:28:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5621 states. [2018-11-06 21:28:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5621 to 5609. [2018-11-06 21:28:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5609 states. [2018-11-06 21:28:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 6104 transitions. [2018-11-06 21:28:12,259 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 6104 transitions. Word has length 775 [2018-11-06 21:28:12,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:12,260 INFO L480 AbstractCegarLoop]: Abstraction has 5609 states and 6104 transitions. [2018-11-06 21:28:12,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:28:12,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 6104 transitions. [2018-11-06 21:28:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2018-11-06 21:28:12,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:12,325 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:12,326 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:12,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:12,328 INFO L82 PathProgramCache]: Analyzing trace with hash -949121, now seen corresponding path program 1 times [2018-11-06 21:28:12,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:12,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:12,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:12,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:12,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 1729 proven. 156 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-11-06 21:28:13,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:28:13,363 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:28:13,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:13,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:28:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 1729 proven. 156 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-11-06 21:28:14,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:28:14,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-11-06 21:28:14,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:28:14,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:28:14,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:28:14,248 INFO L87 Difference]: Start difference. First operand 5609 states and 6104 transitions. Second operand 5 states. [2018-11-06 21:28:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:16,376 INFO L93 Difference]: Finished difference Result 13199 states and 14389 transitions. [2018-11-06 21:28:16,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:28:16,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 877 [2018-11-06 21:28:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:16,406 INFO L225 Difference]: With dead ends: 13199 [2018-11-06 21:28:16,406 INFO L226 Difference]: Without dead ends: 7771 [2018-11-06 21:28:16,412 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 879 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-11-06 21:28:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2018-11-06 21:28:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 6862. [2018-11-06 21:28:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6862 states. [2018-11-06 21:28:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 7426 transitions. [2018-11-06 21:28:16,505 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 7426 transitions. Word has length 877 [2018-11-06 21:28:16,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:16,507 INFO L480 AbstractCegarLoop]: Abstraction has 6862 states and 7426 transitions. [2018-11-06 21:28:16,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:28:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 7426 transitions. [2018-11-06 21:28:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 930 [2018-11-06 21:28:16,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:16,523 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:16,524 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:16,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:16,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1389360376, now seen corresponding path program 1 times [2018-11-06 21:28:16,524 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:16,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:16,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:16,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:16,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:17,450 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 21:28:17,669 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 21:28:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2909 backedges. 1803 proven. 0 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2018-11-06 21:28:19,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:19,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:28:19,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:28:19,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:28:19,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:28:19,135 INFO L87 Difference]: Start difference. First operand 6862 states and 7426 transitions. Second operand 6 states. [2018-11-06 21:28:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:21,456 INFO L93 Difference]: Finished difference Result 14999 states and 16259 transitions. [2018-11-06 21:28:21,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:28:21,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 929 [2018-11-06 21:28:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:21,484 INFO L225 Difference]: With dead ends: 14999 [2018-11-06 21:28:21,484 INFO L226 Difference]: Without dead ends: 8318 [2018-11-06 21:28:21,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:28:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8318 states. [2018-11-06 21:28:21,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8318 to 6862. [2018-11-06 21:28:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6862 states. [2018-11-06 21:28:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 7382 transitions. [2018-11-06 21:28:21,574 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 7382 transitions. Word has length 929 [2018-11-06 21:28:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:21,576 INFO L480 AbstractCegarLoop]: Abstraction has 6862 states and 7382 transitions. [2018-11-06 21:28:21,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:28:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 7382 transitions. [2018-11-06 21:28:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2018-11-06 21:28:21,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:21,592 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 8, 8, 8, 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, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:28:21,592 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:21,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:21,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1348821485, now seen corresponding path program 1 times [2018-11-06 21:28:21,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:21,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:21,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:21,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:21,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3574 backedges. 2218 proven. 0 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2018-11-06 21:28:23,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:23,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:28:23,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:28:23,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:28:23,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:28:23,097 INFO L87 Difference]: Start difference. First operand 6862 states and 7382 transitions. Second operand 5 states. [2018-11-06 21:28:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:25,035 INFO L93 Difference]: Finished difference Result 15350 states and 16515 transitions. [2018-11-06 21:28:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:28:25,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1046 [2018-11-06 21:28:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:25,053 INFO L225 Difference]: With dead ends: 15350 [2018-11-06 21:28:25,053 INFO L226 Difference]: Without dead ends: 8669 [2018-11-06 21:28:25,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:28:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8669 states. [2018-11-06 21:28:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8669 to 7768. [2018-11-06 21:28:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7768 states. [2018-11-06 21:28:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7768 states to 7768 states and 8371 transitions. [2018-11-06 21:28:25,162 INFO L78 Accepts]: Start accepts. Automaton has 7768 states and 8371 transitions. Word has length 1046 [2018-11-06 21:28:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:25,164 INFO L480 AbstractCegarLoop]: Abstraction has 7768 states and 8371 transitions. [2018-11-06 21:28:25,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:28:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 7768 states and 8371 transitions. [2018-11-06 21:28:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2018-11-06 21:28:25,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:25,181 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:25,181 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:25,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:25,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1285085745, now seen corresponding path program 1 times [2018-11-06 21:28:25,182 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:25,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:25,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:26,203 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 21:28:26,381 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 21:28:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 1622 proven. 323 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2018-11-06 21:28:29,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:28:29,017 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:28:29,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:29,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:28:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 1938 proven. 7 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2018-11-06 21:28:31,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:28:31,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2018-11-06 21:28:31,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:28:31,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:28:31,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:28:31,260 INFO L87 Difference]: Start difference. First operand 7768 states and 8371 transitions. Second operand 7 states. [2018-11-06 21:28:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:34,757 INFO L93 Difference]: Finished difference Result 18045 states and 19395 transitions. [2018-11-06 21:28:34,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 21:28:34,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1047 [2018-11-06 21:28:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:34,777 INFO L225 Difference]: With dead ends: 18045 [2018-11-06 21:28:34,777 INFO L226 Difference]: Without dead ends: 10154 [2018-11-06 21:28:34,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 1046 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:28:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10154 states. [2018-11-06 21:28:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10154 to 8236. [2018-11-06 21:28:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8236 states. [2018-11-06 21:28:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 8854 transitions. [2018-11-06 21:28:34,908 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 8854 transitions. Word has length 1047 [2018-11-06 21:28:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:34,909 INFO L480 AbstractCegarLoop]: Abstraction has 8236 states and 8854 transitions. [2018-11-06 21:28:34,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:28:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 8854 transitions. [2018-11-06 21:28:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1080 [2018-11-06 21:28:34,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:34,925 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:28:34,925 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:34,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash 297398189, now seen corresponding path program 1 times [2018-11-06 21:28:34,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:34,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:34,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:35,757 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 21:28:35,924 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-11-06 21:28:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3762 backedges. 1755 proven. 0 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2018-11-06 21:28:36,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:36,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:28:36,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:28:36,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:28:36,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:28:36,484 INFO L87 Difference]: Start difference. First operand 8236 states and 8854 transitions. Second operand 5 states. [2018-11-06 21:28:38,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:38,253 INFO L93 Difference]: Finished difference Result 18242 states and 19669 transitions. [2018-11-06 21:28:38,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:28:38,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1079 [2018-11-06 21:28:38,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:38,271 INFO L225 Difference]: With dead ends: 18242 [2018-11-06 21:28:38,271 INFO L226 Difference]: Without dead ends: 10187 [2018-11-06 21:28:38,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:28:38,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10187 states. [2018-11-06 21:28:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10187 to 10008. [2018-11-06 21:28:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10008 states. [2018-11-06 21:28:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10008 states to 10008 states and 10600 transitions. [2018-11-06 21:28:38,428 INFO L78 Accepts]: Start accepts. Automaton has 10008 states and 10600 transitions. Word has length 1079 [2018-11-06 21:28:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:38,429 INFO L480 AbstractCegarLoop]: Abstraction has 10008 states and 10600 transitions. [2018-11-06 21:28:38,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:28:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 10008 states and 10600 transitions. [2018-11-06 21:28:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1712 [2018-11-06 21:28:38,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:38,468 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:38,468 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:38,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:38,469 INFO L82 PathProgramCache]: Analyzing trace with hash -194796257, now seen corresponding path program 1 times [2018-11-06 21:28:38,469 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:38,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:38,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:38,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:38,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:39,768 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 21:28:40,043 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 21:28:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9527 backedges. 2675 proven. 1052 refuted. 0 times theorem prover too weak. 5800 trivial. 0 not checked. [2018-11-06 21:28:42,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:28:42,814 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:28:42,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:43,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:28:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9527 backedges. 2647 proven. 0 refuted. 0 times theorem prover too weak. 6880 trivial. 0 not checked. [2018-11-06 21:28:44,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:28:44,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-11-06 21:28:44,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:28:44,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:28:44,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:28:44,535 INFO L87 Difference]: Start difference. First operand 10008 states and 10600 transitions. Second operand 11 states. [2018-11-06 21:28:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:47,654 INFO L93 Difference]: Finished difference Result 19356 states and 20529 transitions. [2018-11-06 21:28:47,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:28:47,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1711 [2018-11-06 21:28:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:47,669 INFO L225 Difference]: With dead ends: 19356 [2018-11-06 21:28:47,669 INFO L226 Difference]: Without dead ends: 9349 [2018-11-06 21:28:47,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1733 GetRequests, 1715 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-06 21:28:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9349 states. [2018-11-06 21:28:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9349 to 8650. [2018-11-06 21:28:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2018-11-06 21:28:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 9070 transitions. [2018-11-06 21:28:47,791 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 9070 transitions. Word has length 1711 [2018-11-06 21:28:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:47,793 INFO L480 AbstractCegarLoop]: Abstraction has 8650 states and 9070 transitions. [2018-11-06 21:28:47,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:28:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 9070 transitions. [2018-11-06 21:28:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1762 [2018-11-06 21:28:47,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:47,826 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:47,826 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:47,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:47,827 INFO L82 PathProgramCache]: Analyzing trace with hash 202750658, now seen corresponding path program 1 times [2018-11-06 21:28:47,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:47,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:47,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9680 backedges. 3896 proven. 0 refuted. 0 times theorem prover too weak. 5784 trivial. 0 not checked. [2018-11-06 21:28:50,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:28:50,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:28:50,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:28:50,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:28:50,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:28:50,501 INFO L87 Difference]: Start difference. First operand 8650 states and 9070 transitions. Second operand 4 states. [2018-11-06 21:28:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:28:51,806 INFO L93 Difference]: Finished difference Result 19258 states and 20230 transitions. [2018-11-06 21:28:51,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:28:51,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1761 [2018-11-06 21:28:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:28:51,811 INFO L225 Difference]: With dead ends: 19258 [2018-11-06 21:28:51,811 INFO L226 Difference]: Without dead ends: 6111 [2018-11-06 21:28:51,816 INFO L604 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-11-06 21:28:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6111 states. [2018-11-06 21:28:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6111 to 5931. [2018-11-06 21:28:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2018-11-06 21:28:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 6080 transitions. [2018-11-06 21:28:51,884 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 6080 transitions. Word has length 1761 [2018-11-06 21:28:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:28:51,885 INFO L480 AbstractCegarLoop]: Abstraction has 5931 states and 6080 transitions. [2018-11-06 21:28:51,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:28:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 6080 transitions. [2018-11-06 21:28:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1834 [2018-11-06 21:28:51,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:28:51,919 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:28:51,919 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:28:51,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:28:51,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2075115145, now seen corresponding path program 1 times [2018-11-06 21:28:51,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:28:51,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:28:51,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:51,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:51,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:28:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:53,618 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2018-11-06 21:28:53,894 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 5 [2018-11-06 21:28:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 11055 backedges. 5710 proven. 648 refuted. 0 times theorem prover too weak. 4697 trivial. 0 not checked. [2018-11-06 21:28:55,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:28:55,487 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:28:55,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:28:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:28:55,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:28:56,461 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 32 [2018-11-06 21:28:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 11055 backedges. 3921 proven. 216 refuted. 0 times theorem prover too weak. 6918 trivial. 0 not checked. [2018-11-06 21:28:58,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:28:58,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-11-06 21:28:58,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:28:58,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:28:58,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:28:58,470 INFO L87 Difference]: Start difference. First operand 5931 states and 6080 transitions. Second operand 10 states. [2018-11-06 21:29:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:07,395 INFO L93 Difference]: Finished difference Result 14376 states and 14772 transitions. [2018-11-06 21:29:07,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 21:29:07,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1833 [2018-11-06 21:29:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:07,401 INFO L225 Difference]: With dead ends: 14376 [2018-11-06 21:29:07,401 INFO L226 Difference]: Without dead ends: 5745 [2018-11-06 21:29:07,404 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1857 GetRequests, 1839 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-06 21:29:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5745 states. [2018-11-06 21:29:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5745 to 5024. [2018-11-06 21:29:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5024 states. [2018-11-06 21:29:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5024 states to 5024 states and 5122 transitions. [2018-11-06 21:29:07,461 INFO L78 Accepts]: Start accepts. Automaton has 5024 states and 5122 transitions. Word has length 1833 [2018-11-06 21:29:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:07,462 INFO L480 AbstractCegarLoop]: Abstraction has 5024 states and 5122 transitions. [2018-11-06 21:29:07,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:29:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5024 states and 5122 transitions. [2018-11-06 21:29:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2005 [2018-11-06 21:29:07,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:07,490 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-06 21:29:07,491 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:07,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash 554574517, now seen corresponding path program 1 times [2018-11-06 21:29:07,492 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:07,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:07,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:07,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:07,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:09,206 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:29:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12881 backedges. 4348 proven. 0 refuted. 0 times theorem prover too weak. 8533 trivial. 0 not checked. [2018-11-06 21:29:12,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:29:12,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:29:12,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:29:12,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:29:12,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:29:12,185 INFO L87 Difference]: Start difference. First operand 5024 states and 5122 transitions. Second operand 7 states. [2018-11-06 21:29:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:13,699 INFO L93 Difference]: Finished difference Result 9538 states and 9737 transitions. [2018-11-06 21:29:13,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:29:13,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2004 [2018-11-06 21:29:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:13,705 INFO L225 Difference]: With dead ends: 9538 [2018-11-06 21:29:13,705 INFO L226 Difference]: Without dead ends: 4841 [2018-11-06 21:29:13,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:29:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states. [2018-11-06 21:29:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 4841. [2018-11-06 21:29:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4841 states. [2018-11-06 21:29:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 4924 transitions. [2018-11-06 21:29:13,757 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 4924 transitions. Word has length 2004 [2018-11-06 21:29:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:13,758 INFO L480 AbstractCegarLoop]: Abstraction has 4841 states and 4924 transitions. [2018-11-06 21:29:13,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:29:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 4924 transitions. [2018-11-06 21:29:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2138 [2018-11-06 21:29:13,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:29:13,795 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:29:13,796 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:29:13,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:29:13,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1027662426, now seen corresponding path program 1 times [2018-11-06 21:29:13,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:29:13,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:29:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:13,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:29:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:15,157 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2018-11-06 21:29:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14682 backedges. 4624 proven. 216 refuted. 0 times theorem prover too weak. 9842 trivial. 0 not checked. [2018-11-06 21:29:17,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:29:17,389 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:29:17,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:29:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:29:17,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:29:18,616 WARN L179 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 36 [2018-11-06 21:29:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 14682 backedges. 4624 proven. 216 refuted. 0 times theorem prover too weak. 9842 trivial. 0 not checked. [2018-11-06 21:29:21,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:29:21,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-06 21:29:21,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:29:21,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:29:21,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:29:21,480 INFO L87 Difference]: Start difference. First operand 4841 states and 4924 transitions. Second operand 6 states. [2018-11-06 21:29:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:29:23,411 INFO L93 Difference]: Finished difference Result 9141 states and 9305 transitions. [2018-11-06 21:29:23,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:29:23,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 2137 [2018-11-06 21:29:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:29:23,413 INFO L225 Difference]: With dead ends: 9141 [2018-11-06 21:29:23,414 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:29:23,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2144 GetRequests, 2137 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:29:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:29:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:29:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:29:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:29:23,418 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2137 [2018-11-06 21:29:23,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:29:23,418 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:29:23,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:29:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:29:23,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:29:23,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:29:23,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:23,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,010 WARN L179 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 430 DAG size of output: 306 [2018-11-06 21:29:24,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:29:24,587 WARN L179 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 430 DAG size of output: 306 [2018-11-06 21:29:30,532 WARN L179 SmtUtils]: Spent 5.93 s on a formula simplification. DAG size of input: 272 DAG size of output: 153 [2018-11-06 21:29:33,468 WARN L179 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 272 DAG size of output: 153 [2018-11-06 21:29:33,473 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-06 21:29:33,473 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-06 21:29:33,473 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,473 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,473 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,473 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-06 21:29:33,473 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-06 21:29:33,473 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-06 21:29:33,474 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-06 21:29:33,475 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-06 21:29:33,475 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-06 21:29:33,475 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-06 21:29:33,475 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,475 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,475 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,475 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-06 21:29:33,475 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-06 21:29:33,475 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-06 21:29:33,475 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-06 21:29:33,475 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2018-11-06 21:29:33,476 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-06 21:29:33,476 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-06 21:29:33,476 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-06 21:29:33,476 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-06 21:29:33,476 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-06 21:29:33,476 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,476 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,476 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,476 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-06 21:29:33,476 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-06 21:29:33,477 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-06 21:29:33,477 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-06 21:29:33,477 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-06 21:29:33,477 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-06 21:29:33,477 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-06 21:29:33,479 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,479 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,479 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,479 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-06 21:29:33,479 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-06 21:29:33,479 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-06 21:29:33,479 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-06 21:29:33,479 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-06 21:29:33,479 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-06 21:29:33,479 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-06 21:29:33,480 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-06 21:29:33,480 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-06 21:29:33,480 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,480 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,480 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,480 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-06 21:29:33,480 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-06 21:29:33,480 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-06 21:29:33,480 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-06 21:29:33,480 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-06 21:29:33,480 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-06 21:29:33,480 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-06 21:29:33,481 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-06 21:29:33,481 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,481 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,481 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,481 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-06 21:29:33,481 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-06 21:29:33,481 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-06 21:29:33,481 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-06 21:29:33,482 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-06 21:29:33,482 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-06 21:29:33,482 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-06 21:29:33,482 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-06 21:29:33,482 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,482 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,482 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,482 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-06 21:29:33,482 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-06 21:29:33,483 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:29:33,483 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-06 21:29:33,483 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-06 21:29:33,483 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-06 21:29:33,483 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-06 21:29:33,483 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-06 21:29:33,483 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-06 21:29:33,483 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,483 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,483 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,483 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-06 21:29:33,484 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-06 21:29:33,485 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-06 21:29:33,486 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-06 21:29:33,487 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-06 21:29:33,487 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-06 21:29:33,487 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-06 21:29:33,487 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-06 21:29:33,487 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-06 21:29:33,487 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,487 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,487 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-06 21:29:33,487 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-06 21:29:33,487 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-06 21:29:33,487 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-06 21:29:33,488 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-06 21:29:33,488 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-06 21:29:33,488 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,488 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,489 INFO L421 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse26 (+ ~a12~0 43))) (let ((.cse21 (= ~a15~0 9)) (.cse9 (<= .cse26 0)) (.cse15 (= ~a15~0 8)) (.cse1 (= ~a24~0 1))) (let ((.cse3 (<= ~a12~0 76)) (.cse20 (= ~a21~0 7)) (.cse6 (= ~a21~0 6)) (.cse22 (<= ~a12~0 599999)) (.cse7 (and .cse9 .cse15 .cse1)) (.cse12 (= ~a15~0 5)) (.cse8 (<= ~a12~0 586307)) (.cse11 (= ~a21~0 10)) (.cse5 (<= 19 ~a12~0)) (.cse10 (<= ~a12~0 73282)) (.cse23 (< 80 ~a12~0)) (.cse25 (exists ((v_prenex_38 Int)) (let ((.cse32 (div (+ v_prenex_38 (- 600066)) 5))) (let ((.cse29 (* 34 .cse32))) (let ((.cse30 (+ .cse29 34)) (.cse31 (* 4 .cse32))) (and (< .cse29 0) (< .cse30 0) (<= v_prenex_38 599999) (<= ~a12~0 (+ (div .cse30 10) 1)) (< v_prenex_38 600066) (not (= 0 (mod (+ .cse31 4) 10))) (not (= (mod (+ v_prenex_38 4) 5) 0)) (not (= 0 (mod .cse31 10))))))))) (.cse17 (not .cse21)) (.cse16 (not (= 7 ~a21~0))) (.cse24 (exists ((v_~a12~0_438 Int)) (let ((.cse28 (div (+ v_~a12~0_438 (- 600066)) 5))) (let ((.cse27 (+ (* 34 .cse28) 34))) (and (<= v_~a12~0_438 586307) (< .cse27 0) (< v_~a12~0_438 600066) (<= ~a12~0 (+ (div .cse27 10) 1)) (not (= 0 (mod (+ (* 4 .cse28) 4) 10))) (not (= (mod (+ v_~a12~0_438 4) 5) 0))))))) (.cse19 (not .cse15)) (.cse2 (not (= 8 ~a21~0))) (.cse4 (= ~a21~0 8)) (.cse13 (<= ~a12~0 11)) (.cse14 (< 0 .cse26)) (.cse0 (= ~a15~0 7)) (.cse18 (< 11 ~a12~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse7) (and .cse6 (<= 95381 ~a12~0) .cse1 .cse8) (and (and .cse9 .cse0) .cse1) (and .cse10 .cse1 .cse11 .cse12) (and (= ~a21~0 9) (not (= ULTIMATE.start_calculate_output_~input 5)) .cse1 .cse13 .cse14) (and .cse1 (or (and .cse11 .cse13 .cse14) (and (and .cse15 .cse11) .cse5))) (and .cse3 .cse16 .cse15 .cse1 .cse5) (and (and .cse17 (<= ~a12~0 80) .cse18) .cse1 .cse19) (and .cse15 .cse1 .cse20 .cse13 .cse14) (and .cse1 .cse4 (<= (+ ~a12~0 526767) 0) .cse21) (and .cse16 .cse1 .cse19 .cse13 .cse2 .cse14) (and .cse22 .cse1 .cse23 .cse21) (and .cse15 .cse1 .cse20 (<= (+ ~a12~0 49) 0)) (and .cse6 .cse17 .cse24 .cse19) (and .cse6 .cse1 .cse12) (and .cse22 (and (<= 9 ~a15~0) .cse1) .cse2 .cse23) (and .cse25 (and .cse11 .cse7)) (and .cse17 .cse16 (not .cse12) .cse1 .cse8 .cse19 .cse2 (not .cse11) .cse5) (and (and .cse10 .cse15 .cse1) .cse4 .cse23) (and .cse25 (and .cse16 (and .cse17 (not .cse4) .cse1) .cse19)) (and .cse16 .cse24 .cse1 .cse19 .cse2) (and .cse1 .cse4 .cse21 .cse13 .cse14) (and .cse0 .cse18 .cse1))))) [2018-11-06 21:29:33,489 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-06 21:29:33,489 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-06 21:29:33,489 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-06 21:29:33,489 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-06 21:29:33,489 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-06 21:29:33,489 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-06 21:29:33,489 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-06 21:29:33,490 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-06 21:29:33,490 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,490 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,490 INFO L428 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-11-06 21:29:33,490 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-06 21:29:33,490 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-06 21:29:33,490 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-06 21:29:33,490 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-06 21:29:33,490 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-06 21:29:33,490 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-06 21:29:33,491 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-06 21:29:33,491 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,491 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,491 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-06 21:29:33,491 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-06 21:29:33,491 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-06 21:29:33,491 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-06 21:29:33,491 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:29:33,491 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-06 21:29:33,491 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-06 21:29:33,491 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,492 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,492 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-06 21:29:33,492 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,492 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-06 21:29:33,492 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-06 21:29:33,493 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse26 (+ ~a12~0 43))) (let ((.cse21 (= ~a15~0 9)) (.cse9 (<= .cse26 0)) (.cse15 (= ~a15~0 8)) (.cse1 (= ~a24~0 1))) (let ((.cse3 (<= ~a12~0 76)) (.cse20 (= ~a21~0 7)) (.cse6 (= ~a21~0 6)) (.cse22 (<= ~a12~0 599999)) (.cse7 (and .cse9 .cse15 .cse1)) (.cse12 (= ~a15~0 5)) (.cse8 (<= ~a12~0 586307)) (.cse11 (= ~a21~0 10)) (.cse5 (<= 19 ~a12~0)) (.cse10 (<= ~a12~0 73282)) (.cse23 (< 80 ~a12~0)) (.cse25 (exists ((v_prenex_38 Int)) (let ((.cse32 (div (+ v_prenex_38 (- 600066)) 5))) (let ((.cse29 (* 34 .cse32))) (let ((.cse30 (+ .cse29 34)) (.cse31 (* 4 .cse32))) (and (< .cse29 0) (< .cse30 0) (<= v_prenex_38 599999) (<= ~a12~0 (+ (div .cse30 10) 1)) (< v_prenex_38 600066) (not (= 0 (mod (+ .cse31 4) 10))) (not (= (mod (+ v_prenex_38 4) 5) 0)) (not (= 0 (mod .cse31 10))))))))) (.cse17 (not .cse21)) (.cse16 (not (= 7 ~a21~0))) (.cse24 (exists ((v_~a12~0_438 Int)) (let ((.cse28 (div (+ v_~a12~0_438 (- 600066)) 5))) (let ((.cse27 (+ (* 34 .cse28) 34))) (and (<= v_~a12~0_438 586307) (< .cse27 0) (< v_~a12~0_438 600066) (<= ~a12~0 (+ (div .cse27 10) 1)) (not (= 0 (mod (+ (* 4 .cse28) 4) 10))) (not (= (mod (+ v_~a12~0_438 4) 5) 0))))))) (.cse19 (not .cse15)) (.cse2 (not (= 8 ~a21~0))) (.cse4 (= ~a21~0 8)) (.cse13 (<= ~a12~0 11)) (.cse14 (< 0 .cse26)) (.cse0 (= ~a15~0 7)) (.cse18 (< 11 ~a12~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse5) (and .cse6 .cse7) (and .cse6 (<= 95381 ~a12~0) .cse1 .cse8) (and (and .cse9 .cse0) .cse1) (and .cse10 .cse1 .cse11 .cse12) (and (= ~a21~0 9) (not (= ULTIMATE.start_calculate_output_~input 5)) .cse1 .cse13 .cse14) (and .cse1 (or (and .cse11 .cse13 .cse14) (and (and .cse15 .cse11) .cse5))) (and .cse3 .cse16 .cse15 .cse1 .cse5) (and (and .cse17 (<= ~a12~0 80) .cse18) .cse1 .cse19) (and .cse15 .cse1 .cse20 .cse13 .cse14) (and .cse1 .cse4 (<= (+ ~a12~0 526767) 0) .cse21) (and .cse16 .cse1 .cse19 .cse13 .cse2 .cse14) (and .cse22 .cse1 .cse23 .cse21) (and .cse15 .cse1 .cse20 (<= (+ ~a12~0 49) 0)) (and .cse6 .cse17 .cse24 .cse19) (and .cse6 .cse1 .cse12) (and .cse22 (and (<= 9 ~a15~0) .cse1) .cse2 .cse23) (and .cse25 (and .cse11 .cse7)) (and .cse17 .cse16 (not .cse12) .cse1 .cse8 .cse19 .cse2 (not .cse11) .cse5) (and (and .cse10 .cse15 .cse1) .cse4 .cse23) (and .cse25 (and .cse16 (and .cse17 (not .cse4) .cse1) .cse19)) (and .cse16 .cse24 .cse1 .cse19 .cse2) (and .cse1 .cse4 .cse21 .cse13 .cse14) (and .cse0 .cse18 .cse1))))) [2018-11-06 21:29:33,493 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-06 21:29:33,493 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-06 21:29:33,493 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-06 21:29:33,493 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-06 21:29:33,493 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-06 21:29:33,493 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-06 21:29:33,493 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-06 21:29:33,493 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-06 21:29:33,493 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-06 21:29:33,494 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,494 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,494 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,494 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-06 21:29:33,494 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-06 21:29:33,494 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-06 21:29:33,494 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-06 21:29:33,494 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-06 21:29:33,494 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-06 21:29:33,494 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-06 21:29:33,494 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-06 21:29:33,495 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-06 21:29:33,495 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,495 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,495 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,495 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-06 21:29:33,495 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-06 21:29:33,495 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-06 21:29:33,495 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-06 21:29:33,495 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:29:33,495 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-06 21:29:33,495 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-06 21:29:33,496 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-06 21:29:33,496 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-06 21:29:33,496 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,496 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,496 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,496 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-06 21:29:33,496 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-06 21:29:33,496 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-06 21:29:33,496 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-06 21:29:33,496 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-06 21:29:33,497 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-06 21:29:33,497 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-06 21:29:33,497 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-06 21:29:33,497 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-06 21:29:33,497 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,497 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,497 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-11-06 21:29:33,497 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-06 21:29:33,497 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-06 21:29:33,497 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-06 21:29:33,497 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-06 21:29:33,498 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-06 21:29:33,508 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,509 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,509 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,510 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,510 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,510 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,510 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,511 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,511 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,511 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,511 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,512 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,512 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,512 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,513 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,513 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,513 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,513 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,514 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,514 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,514 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,514 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,514 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,515 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,515 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,515 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,515 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,516 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,528 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,529 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,529 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,529 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,530 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,530 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,530 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,530 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,531 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,531 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,531 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,531 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,532 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,532 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,532 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,532 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,532 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,533 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,533 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,533 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,533 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,534 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,534 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,534 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,534 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,534 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,535 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,535 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,540 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,541 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,541 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,541 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,541 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,542 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,542 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,542 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,542 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,543 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,543 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,543 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,543 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,544 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,544 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,544 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,544 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,545 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,545 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,545 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,545 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,546 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,546 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,546 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,546 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,547 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,547 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,547 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,552 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,552 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,552 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,552 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,553 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,553 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,553 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,554 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,554 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,554 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,554 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,555 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,555 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,555 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,555 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,556 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,556 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,556 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,556 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,556 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,557 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,557 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,557 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,557 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,558 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,558 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,558 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,558 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:29:33 BoogieIcfgContainer [2018-11-06 21:29:33,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:29:33,563 INFO L168 Benchmark]: Toolchain (without parser) took 128718.35 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-06 21:29:33,565 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:29:33,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 940.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:29:33,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 248.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -840.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2018-11-06 21:29:33,567 INFO L168 Benchmark]: Boogie Preprocessor took 118.85 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:29:33,569 INFO L168 Benchmark]: RCFGBuilder took 3438.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 132.3 MB). Peak memory consumption was 132.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:29:33,571 INFO L168 Benchmark]: TraceAbstraction took 123963.64 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -129.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-06 21:29:33,581 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 940.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 248.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -840.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.85 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3438.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 132.3 MB). Peak memory consumption was 132.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123963.64 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -129.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant [2018-11-06 21:29:33,605 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,605 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,605 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,607 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,607 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,607 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,607 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,607 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,608 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,608 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,608 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,608 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,615 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,615 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,615 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,616 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,616 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,616 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,616 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,616 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,617 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,617 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,617 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,617 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,621 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,622 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,622 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,622 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,622 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,622 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,623 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,623 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,623 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,623 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,624 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,624 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,624 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,624 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,624 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,629 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,629 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,629 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,629 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,629 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,630 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,631 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,631 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,631 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a15 == 7 && a24 == 1) && !(8 == a21)) || (((a12 <= 76 && a24 == 1) && a21 == 8) && 19 <= a12)) || (a21 == 6 && (a12 + 43 <= 0 && a15 == 8) && a24 == 1)) || (((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307)) || ((a12 + 43 <= 0 && a15 == 7) && a24 == 1)) || (((a12 <= 73282 && a24 == 1) && a21 == 10) && a15 == 5)) || ((((a21 == 9 && !(input == 5)) && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (a24 == 1 && (((a21 == 10 && a12 <= 11) && 0 < a12 + 43) || ((a15 == 8 && a21 == 10) && 19 <= a12)))) || ((((a12 <= 76 && !(7 == a21)) && a15 == 8) && a24 == 1) && 19 <= a12)) || ((((!(a15 == 9) && a12 <= 80) && 11 < a12) && a24 == 1) && !(a15 == 8))) || ((((a15 == 8 && a24 == 1) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || (((((!(7 == a21) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && !(8 == a21)) && 0 < a12 + 43)) || (((a12 <= 599999 && a24 == 1) && 80 < a12) && a15 == 9)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || (((a21 == 6 && !(a15 == 9)) && (\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0))) && !(a15 == 8))) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((a12 <= 599999 && 9 <= a15 && a24 == 1) && !(8 == a21)) && 80 < a12)) || ((\exists v_prenex_38 : int :: ((((((34 * ((v_prenex_38 + -600066) / 5) < 0 && 34 * ((v_prenex_38 + -600066) / 5) + 34 < 0) && v_prenex_38 <= 599999) && a12 <= (34 * ((v_prenex_38 + -600066) / 5) + 34) / 10 + 1) && v_prenex_38 < 600066) && !(0 == (4 * ((v_prenex_38 + -600066) / 5) + 4) % 10)) && !((v_prenex_38 + 4) % 5 == 0)) && !(0 == 4 * ((v_prenex_38 + -600066) / 5) % 10)) && a21 == 10 && (a12 + 43 <= 0 && a15 == 8) && a24 == 1)) || ((((((((!(a15 == 9) && !(7 == a21)) && !(a15 == 5)) && a24 == 1) && a12 <= 586307) && !(a15 == 8)) && !(8 == a21)) && !(a21 == 10)) && 19 <= a12)) || ((((a12 <= 73282 && a15 == 8) && a24 == 1) && a21 == 8) && 80 < a12)) || ((\exists v_prenex_38 : int :: ((((((34 * ((v_prenex_38 + -600066) / 5) < 0 && 34 * ((v_prenex_38 + -600066) / 5) + 34 < 0) && v_prenex_38 <= 599999) && a12 <= (34 * ((v_prenex_38 + -600066) / 5) + 34) / 10 + 1) && v_prenex_38 < 600066) && !(0 == (4 * ((v_prenex_38 + -600066) / 5) + 4) % 10)) && !((v_prenex_38 + 4) % 5 == 0)) && !(0 == 4 * ((v_prenex_38 + -600066) / 5) % 10)) && (!(7 == a21) && (!(a15 == 9) && !(a21 == 8)) && a24 == 1) && !(a15 == 8))) || ((((!(7 == a21) && (\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0))) && a24 == 1) && !(a15 == 8)) && !(8 == a21))) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((a15 == 7 && 11 < a12) && a24 == 1) - InvariantResult [Line: 20]: Loop Invariant [2018-11-06 21:29:33,633 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,633 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,634 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,634 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,634 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,634 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,634 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,635 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,635 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,635 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,635 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,637 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,637 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,637 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,637 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,637 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,638 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,638 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,638 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,638 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,638 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,639 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,639 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,640 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,641 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,641 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,641 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,641 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,642 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,642 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,642 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,642 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,643 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,643 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,643 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,643 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,643 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,645 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,645 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,645 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,645 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,645 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,645 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_38,QUANTIFIED] [2018-11-06 21:29:33,646 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,646 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,646 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,646 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,647 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] [2018-11-06 21:29:33,647 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_438,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a15 == 7 && a24 == 1) && !(8 == a21)) || (((a12 <= 76 && a24 == 1) && a21 == 8) && 19 <= a12)) || (a21 == 6 && (a12 + 43 <= 0 && a15 == 8) && a24 == 1)) || (((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307)) || ((a12 + 43 <= 0 && a15 == 7) && a24 == 1)) || (((a12 <= 73282 && a24 == 1) && a21 == 10) && a15 == 5)) || ((((a21 == 9 && !(input == 5)) && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (a24 == 1 && (((a21 == 10 && a12 <= 11) && 0 < a12 + 43) || ((a15 == 8 && a21 == 10) && 19 <= a12)))) || ((((a12 <= 76 && !(7 == a21)) && a15 == 8) && a24 == 1) && 19 <= a12)) || ((((!(a15 == 9) && a12 <= 80) && 11 < a12) && a24 == 1) && !(a15 == 8))) || ((((a15 == 8 && a24 == 1) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || (((((!(7 == a21) && a24 == 1) && !(a15 == 8)) && a12 <= 11) && !(8 == a21)) && 0 < a12 + 43)) || (((a12 <= 599999 && a24 == 1) && 80 < a12) && a15 == 9)) || (((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0)) || (((a21 == 6 && !(a15 == 9)) && (\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0))) && !(a15 == 8))) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((a12 <= 599999 && 9 <= a15 && a24 == 1) && !(8 == a21)) && 80 < a12)) || ((\exists v_prenex_38 : int :: ((((((34 * ((v_prenex_38 + -600066) / 5) < 0 && 34 * ((v_prenex_38 + -600066) / 5) + 34 < 0) && v_prenex_38 <= 599999) && a12 <= (34 * ((v_prenex_38 + -600066) / 5) + 34) / 10 + 1) && v_prenex_38 < 600066) && !(0 == (4 * ((v_prenex_38 + -600066) / 5) + 4) % 10)) && !((v_prenex_38 + 4) % 5 == 0)) && !(0 == 4 * ((v_prenex_38 + -600066) / 5) % 10)) && a21 == 10 && (a12 + 43 <= 0 && a15 == 8) && a24 == 1)) || ((((((((!(a15 == 9) && !(7 == a21)) && !(a15 == 5)) && a24 == 1) && a12 <= 586307) && !(a15 == 8)) && !(8 == a21)) && !(a21 == 10)) && 19 <= a12)) || ((((a12 <= 73282 && a15 == 8) && a24 == 1) && a21 == 8) && 80 < a12)) || ((\exists v_prenex_38 : int :: ((((((34 * ((v_prenex_38 + -600066) / 5) < 0 && 34 * ((v_prenex_38 + -600066) / 5) + 34 < 0) && v_prenex_38 <= 599999) && a12 <= (34 * ((v_prenex_38 + -600066) / 5) + 34) / 10 + 1) && v_prenex_38 < 600066) && !(0 == (4 * ((v_prenex_38 + -600066) / 5) + 4) % 10)) && !((v_prenex_38 + 4) % 5 == 0)) && !(0 == 4 * ((v_prenex_38 + -600066) / 5) % 10)) && (!(7 == a21) && (!(a15 == 9) && !(a21 == 8)) && a24 == 1) && !(a15 == 8))) || ((((!(7 == a21) && (\exists v_~a12~0_438 : int :: ((((v_~a12~0_438 <= 586307 && 34 * ((v_~a12~0_438 + -600066) / 5) + 34 < 0) && v_~a12~0_438 < 600066) && a12 <= (34 * ((v_~a12~0_438 + -600066) / 5) + 34) / 10 + 1) && !(0 == (4 * ((v_~a12~0_438 + -600066) / 5) + 4) % 10)) && !((v_~a12~0_438 + 4) % 5 == 0))) && a24 == 1) && !(a15 == 8)) && !(8 == a21))) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((a15 == 7 && 11 < a12) && a24 == 1) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. SAFE Result, 123.8s OverallTime, 17 OverallIterations, 18 TraceHistogramMax, 62.8s AutomataDifference, 0.0s DeadEndRemovalTime, 10.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1965 SDtfs, 12456 SDslu, 2326 SDs, 0 SdLazy, 35931 SolverSat, 3581 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9302 GetRequests, 9182 SyntacticMatches, 17 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10008occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 8630 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 168 NumberOfFragments, 1377 HoareAnnotationTreeSize, 3 FomulaSimplifications, 31166 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 13548 FormulaSimplificationTreeSizeReductionInter, 8.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 27.8s InterpolantComputationTime, 26231 NumberOfCodeBlocks, 26231 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 26206 ConstructedInterpolants, 76 QuantifiedInterpolants, 95254955 SizeOfPredicates, 8 NumberOfNonLiveVariables, 11129 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 118353/121595 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...