java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label26_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:09:08,841 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:09:08,843 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:09:08,856 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:09:08,857 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:09:08,858 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:09:08,859 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:09:08,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:09:08,863 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:09:08,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:09:08,868 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:09:08,868 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:09:08,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:09:08,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:09:08,876 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:09:08,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:09:08,878 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:09:08,880 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:09:08,886 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:09:08,888 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:09:08,889 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:09:08,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:09:08,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:09:08,899 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:09:08,899 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:09:08,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:09:08,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:09:08,903 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:09:08,904 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:09:08,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:09:08,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:09:08,908 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:09:08,908 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:09:08,909 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:09:08,911 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:09:08,913 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:09:08,913 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 21:09:08,942 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:09:08,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:09:08,943 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:09:08,945 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:09:08,945 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:09:08,946 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:09:08,946 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:09:08,946 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:09:08,946 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:09:08,946 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:09:08,947 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:09:08,948 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:09:08,948 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:09:08,948 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:09:08,948 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:09:08,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:09:08,949 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:09:08,949 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:09:08,949 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:09:08,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:09:08,951 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:09:08,951 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:09:08,952 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:09:08,952 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:09:08,952 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:09:08,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:09:08,952 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:09:08,952 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:09:09,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:09:09,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:09:09,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:09:09,042 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:09:09,042 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:09:09,043 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label26_true-unreach-call.c [2018-10-26 21:09:09,104 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/83da80229/0309d72aa3c94f689ddc45ab2589654a/FLAG14e10bdb3 [2018-10-26 21:09:09,738 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:09:09,739 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label26_true-unreach-call.c [2018-10-26 21:09:09,756 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/83da80229/0309d72aa3c94f689ddc45ab2589654a/FLAG14e10bdb3 [2018-10-26 21:09:09,774 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/83da80229/0309d72aa3c94f689ddc45ab2589654a [2018-10-26 21:09:09,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:09:09,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:09:09,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:09:09,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:09:09,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:09:09,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:09:09" (1/1) ... [2018-10-26 21:09:09,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11290b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:09, skipping insertion in model container [2018-10-26 21:09:09,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:09:09" (1/1) ... [2018-10-26 21:09:09,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:09:09,908 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:09:10,599 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:09:10,605 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:09:10,844 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:09:10,865 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:09:10,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:10 WrapperNode [2018-10-26 21:09:10,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:09:10,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:09:10,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:09:10,867 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:09:10,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:10" (1/1) ... [2018-10-26 21:09:10,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:10" (1/1) ... [2018-10-26 21:09:11,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:09:11,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:09:11,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:09:11,119 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:09:11,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:10" (1/1) ... [2018-10-26 21:09:11,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:10" (1/1) ... [2018-10-26 21:09:11,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:10" (1/1) ... [2018-10-26 21:09:11,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:10" (1/1) ... [2018-10-26 21:09:11,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:10" (1/1) ... [2018-10-26 21:09:11,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:10" (1/1) ... [2018-10-26 21:09:11,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:10" (1/1) ... [2018-10-26 21:09:11,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:09:11,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:09:11,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:09:11,258 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:09:11,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:09:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:09:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:09:11,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:09:15,828 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:09:15,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:09:15 BoogieIcfgContainer [2018-10-26 21:09:15,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:09:15,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:09:15,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:09:15,834 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:09:15,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:09:09" (1/3) ... [2018-10-26 21:09:15,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60428dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:09:15, skipping insertion in model container [2018-10-26 21:09:15,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:09:10" (2/3) ... [2018-10-26 21:09:15,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60428dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:09:15, skipping insertion in model container [2018-10-26 21:09:15,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:09:15" (3/3) ... [2018-10-26 21:09:15,838 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label26_true-unreach-call.c [2018-10-26 21:09:15,848 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:09:15,858 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:09:15,875 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:09:15,911 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:09:15,912 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:09:15,912 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:09:15,913 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:09:15,913 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:09:15,913 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:09:15,913 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:09:15,914 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:09:15,914 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:09:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-10-26 21:09:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:09:15,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:15,953 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-10-26 21:09:15,955 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:15,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:15,961 INFO L82 PathProgramCache]: Analyzing trace with hash 935177138, now seen corresponding path program 1 times [2018-10-26 21:09:15,964 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:15,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:16,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:16,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:16,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:16,449 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-26 21:09:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:09:16,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:16,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:09:16,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:16,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:16,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:16,494 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-10-26 21:09:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:19,685 INFO L93 Difference]: Finished difference Result 958 states and 1725 transitions. [2018-10-26 21:09:19,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:19,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-10-26 21:09:19,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:19,713 INFO L225 Difference]: With dead ends: 958 [2018-10-26 21:09:19,713 INFO L226 Difference]: Without dead ends: 667 [2018-10-26 21:09:19,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-26 21:09:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2018-10-26 21:09:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-10-26 21:09:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 983 transitions. [2018-10-26 21:09:19,805 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 983 transitions. Word has length 40 [2018-10-26 21:09:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:19,806 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 983 transitions. [2018-10-26 21:09:19,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 983 transitions. [2018-10-26 21:09:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 21:09:19,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:19,812 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] [2018-10-26 21:09:19,813 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:19,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:19,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1825617684, now seen corresponding path program 1 times [2018-10-26 21:09:19,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:19,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:19,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:19,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:09:20,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:20,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:09:20,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:20,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:20,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:20,108 INFO L87 Difference]: Start difference. First operand 667 states and 983 transitions. Second operand 4 states. [2018-10-26 21:09:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:24,765 INFO L93 Difference]: Finished difference Result 2462 states and 3707 transitions. [2018-10-26 21:09:24,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:24,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-10-26 21:09:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:24,779 INFO L225 Difference]: With dead ends: 2462 [2018-10-26 21:09:24,779 INFO L226 Difference]: Without dead ends: 1797 [2018-10-26 21:09:24,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2018-10-26 21:09:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1596. [2018-10-26 21:09:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2018-10-26 21:09:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2261 transitions. [2018-10-26 21:09:24,870 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2261 transitions. Word has length 110 [2018-10-26 21:09:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:24,871 INFO L481 AbstractCegarLoop]: Abstraction has 1596 states and 2261 transitions. [2018-10-26 21:09:24,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2261 transitions. [2018-10-26 21:09:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-26 21:09:24,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:24,882 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] [2018-10-26 21:09:24,883 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:24,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:24,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1897784646, now seen corresponding path program 1 times [2018-10-26 21:09:24,883 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:24,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:24,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:24,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:24,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:25,302 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-10-26 21:09:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:09:25,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:25,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:09:25,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:25,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:25,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:25,325 INFO L87 Difference]: Start difference. First operand 1596 states and 2261 transitions. Second operand 4 states. [2018-10-26 21:09:28,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:28,003 INFO L93 Difference]: Finished difference Result 5796 states and 8174 transitions. [2018-10-26 21:09:28,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:28,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-10-26 21:09:28,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:28,024 INFO L225 Difference]: With dead ends: 5796 [2018-10-26 21:09:28,024 INFO L226 Difference]: Without dead ends: 3642 [2018-10-26 21:09:28,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3642 states. [2018-10-26 21:09:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3642 to 3639. [2018-10-26 21:09:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2018-10-26 21:09:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 4690 transitions. [2018-10-26 21:09:28,100 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 4690 transitions. Word has length 111 [2018-10-26 21:09:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:28,100 INFO L481 AbstractCegarLoop]: Abstraction has 3639 states and 4690 transitions. [2018-10-26 21:09:28,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 4690 transitions. [2018-10-26 21:09:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-26 21:09:28,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:28,107 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, 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] [2018-10-26 21:09:28,107 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:28,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:28,107 INFO L82 PathProgramCache]: Analyzing trace with hash -198764496, now seen corresponding path program 1 times [2018-10-26 21:09:28,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:28,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:28,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:28,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:28,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-26 21:09:28,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:28,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:09:28,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:28,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:28,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:28,486 INFO L87 Difference]: Start difference. First operand 3639 states and 4690 transitions. Second operand 4 states. [2018-10-26 21:09:31,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:31,929 INFO L93 Difference]: Finished difference Result 11367 states and 15053 transitions. [2018-10-26 21:09:31,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:31,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2018-10-26 21:09:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:31,963 INFO L225 Difference]: With dead ends: 11367 [2018-10-26 21:09:31,963 INFO L226 Difference]: Without dead ends: 7730 [2018-10-26 21:09:31,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7730 states. [2018-10-26 21:09:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7730 to 7539. [2018-10-26 21:09:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7539 states. [2018-10-26 21:09:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7539 states to 7539 states and 9135 transitions. [2018-10-26 21:09:32,104 INFO L78 Accepts]: Start accepts. Automaton has 7539 states and 9135 transitions. Word has length 234 [2018-10-26 21:09:32,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:32,105 INFO L481 AbstractCegarLoop]: Abstraction has 7539 states and 9135 transitions. [2018-10-26 21:09:32,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7539 states and 9135 transitions. [2018-10-26 21:09:32,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-26 21:09:32,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:32,117 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, 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] [2018-10-26 21:09:32,118 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:32,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:32,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1824913009, now seen corresponding path program 1 times [2018-10-26 21:09:32,118 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:32,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:32,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:32,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:32,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 21:09:32,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:32,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:09:32,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:32,548 INFO L87 Difference]: Start difference. First operand 7539 states and 9135 transitions. Second operand 4 states. [2018-10-26 21:09:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:34,810 INFO L93 Difference]: Finished difference Result 20452 states and 24945 transitions. [2018-10-26 21:09:34,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:34,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 274 [2018-10-26 21:09:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:34,851 INFO L225 Difference]: With dead ends: 20452 [2018-10-26 21:09:34,851 INFO L226 Difference]: Without dead ends: 12915 [2018-10-26 21:09:34,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12915 states. [2018-10-26 21:09:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12915 to 12529. [2018-10-26 21:09:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12529 states. [2018-10-26 21:09:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12529 states to 12529 states and 14785 transitions. [2018-10-26 21:09:35,102 INFO L78 Accepts]: Start accepts. Automaton has 12529 states and 14785 transitions. Word has length 274 [2018-10-26 21:09:35,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:35,103 INFO L481 AbstractCegarLoop]: Abstraction has 12529 states and 14785 transitions. [2018-10-26 21:09:35,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 12529 states and 14785 transitions. [2018-10-26 21:09:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-26 21:09:35,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:35,126 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, 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] [2018-10-26 21:09:35,127 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:35,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:35,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1414942343, now seen corresponding path program 1 times [2018-10-26 21:09:35,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:35,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:35,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:35,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:35,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-26 21:09:35,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:35,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:09:35,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:09:35,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:09:35,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:09:35,455 INFO L87 Difference]: Start difference. First operand 12529 states and 14785 transitions. Second operand 3 states. [2018-10-26 21:09:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:37,616 INFO L93 Difference]: Finished difference Result 29865 states and 35693 transitions. [2018-10-26 21:09:37,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:09:37,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2018-10-26 21:09:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:37,650 INFO L225 Difference]: With dead ends: 29865 [2018-10-26 21:09:37,651 INFO L226 Difference]: Without dead ends: 15101 [2018-10-26 21:09:37,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:09:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15101 states. [2018-10-26 21:09:37,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15101 to 15101. [2018-10-26 21:09:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15101 states. [2018-10-26 21:09:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15101 states to 15101 states and 17579 transitions. [2018-10-26 21:09:37,861 INFO L78 Accepts]: Start accepts. Automaton has 15101 states and 17579 transitions. Word has length 318 [2018-10-26 21:09:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:37,862 INFO L481 AbstractCegarLoop]: Abstraction has 15101 states and 17579 transitions. [2018-10-26 21:09:37,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:09:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 15101 states and 17579 transitions. [2018-10-26 21:09:37,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-26 21:09:37,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:37,884 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, 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] [2018-10-26 21:09:37,884 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:37,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2126321467, now seen corresponding path program 1 times [2018-10-26 21:09:37,885 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:37,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:37,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:38,714 WARN L179 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-26 21:09:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-26 21:09:38,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:38,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:09:38,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:38,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:38,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:38,771 INFO L87 Difference]: Start difference. First operand 15101 states and 17579 transitions. Second operand 4 states. [2018-10-26 21:09:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:41,087 INFO L93 Difference]: Finished difference Result 30394 states and 35393 transitions. [2018-10-26 21:09:41,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:41,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-10-26 21:09:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:41,119 INFO L225 Difference]: With dead ends: 30394 [2018-10-26 21:09:41,120 INFO L226 Difference]: Without dead ends: 15295 [2018-10-26 21:09:41,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15295 states. [2018-10-26 21:09:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15295 to 14912. [2018-10-26 21:09:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14912 states. [2018-10-26 21:09:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14912 states to 14912 states and 16976 transitions. [2018-10-26 21:09:41,316 INFO L78 Accepts]: Start accepts. Automaton has 14912 states and 16976 transitions. Word has length 323 [2018-10-26 21:09:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:41,317 INFO L481 AbstractCegarLoop]: Abstraction has 14912 states and 16976 transitions. [2018-10-26 21:09:41,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 14912 states and 16976 transitions. [2018-10-26 21:09:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-26 21:09:41,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:41,340 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:09:41,340 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:41,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:41,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1609394383, now seen corresponding path program 1 times [2018-10-26 21:09:41,341 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:41,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:41,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:41,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:41,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 21:09:41,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:41,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:09:41,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:09:41,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:09:41,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:09:41,913 INFO L87 Difference]: Start difference. First operand 14912 states and 16976 transitions. Second operand 5 states. [2018-10-26 21:09:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:44,183 INFO L93 Difference]: Finished difference Result 31695 states and 36221 transitions. [2018-10-26 21:09:44,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:09:44,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 346 [2018-10-26 21:09:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:44,213 INFO L225 Difference]: With dead ends: 31695 [2018-10-26 21:09:44,213 INFO L226 Difference]: Without dead ends: 16785 [2018-10-26 21:09:44,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:09:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16785 states. [2018-10-26 21:09:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16785 to 16029. [2018-10-26 21:09:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16029 states. [2018-10-26 21:09:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16029 states to 16029 states and 18053 transitions. [2018-10-26 21:09:44,414 INFO L78 Accepts]: Start accepts. Automaton has 16029 states and 18053 transitions. Word has length 346 [2018-10-26 21:09:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:44,414 INFO L481 AbstractCegarLoop]: Abstraction has 16029 states and 18053 transitions. [2018-10-26 21:09:44,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:09:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 16029 states and 18053 transitions. [2018-10-26 21:09:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-26 21:09:44,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:44,434 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, 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] [2018-10-26 21:09:44,434 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:44,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:44,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1344999149, now seen corresponding path program 1 times [2018-10-26 21:09:44,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:44,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:44,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:44,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:44,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 21:09:44,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:44,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:09:44,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:44,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:44,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:44,936 INFO L87 Difference]: Start difference. First operand 16029 states and 18053 transitions. Second operand 4 states. [2018-10-26 21:09:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:49,677 INFO L93 Difference]: Finished difference Result 33355 states and 37611 transitions. [2018-10-26 21:09:49,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:49,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 362 [2018-10-26 21:09:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:49,694 INFO L225 Difference]: With dead ends: 33355 [2018-10-26 21:09:49,695 INFO L226 Difference]: Without dead ends: 16398 [2018-10-26 21:09:49,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16398 states. [2018-10-26 21:09:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16398 to 15652. [2018-10-26 21:09:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15652 states. [2018-10-26 21:09:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15652 states to 15652 states and 17467 transitions. [2018-10-26 21:09:49,882 INFO L78 Accepts]: Start accepts. Automaton has 15652 states and 17467 transitions. Word has length 362 [2018-10-26 21:09:49,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:49,883 INFO L481 AbstractCegarLoop]: Abstraction has 15652 states and 17467 transitions. [2018-10-26 21:09:49,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 15652 states and 17467 transitions. [2018-10-26 21:09:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-26 21:09:49,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:49,897 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, 2, 2, 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] [2018-10-26 21:09:49,898 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:49,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:49,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2135143692, now seen corresponding path program 1 times [2018-10-26 21:09:49,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:49,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:49,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:49,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:49,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-26 21:09:50,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:50,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:09:50,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:09:50,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:09:50,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:09:50,560 INFO L87 Difference]: Start difference. First operand 15652 states and 17467 transitions. Second operand 4 states. [2018-10-26 21:09:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:52,736 INFO L93 Difference]: Finished difference Result 36871 states and 41317 transitions. [2018-10-26 21:09:52,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:09:52,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 368 [2018-10-26 21:09:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:52,763 INFO L225 Difference]: With dead ends: 36871 [2018-10-26 21:09:52,763 INFO L226 Difference]: Without dead ends: 20289 [2018-10-26 21:09:52,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-26 21:09:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20289 states. [2018-10-26 21:09:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20289 to 16752. [2018-10-26 21:09:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16752 states. [2018-10-26 21:09:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16752 states to 16752 states and 18449 transitions. [2018-10-26 21:09:52,949 INFO L78 Accepts]: Start accepts. Automaton has 16752 states and 18449 transitions. Word has length 368 [2018-10-26 21:09:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:52,949 INFO L481 AbstractCegarLoop]: Abstraction has 16752 states and 18449 transitions. [2018-10-26 21:09:52,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:09:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 16752 states and 18449 transitions. [2018-10-26 21:09:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-26 21:09:52,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:52,964 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:09:52,965 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:52,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:52,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1695701694, now seen corresponding path program 1 times [2018-10-26 21:09:52,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:52,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:52,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:52,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:52,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-10-26 21:09:53,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:09:53,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 21:09:53,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:09:53,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:09:53,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:09:53,317 INFO L87 Difference]: Start difference. First operand 16752 states and 18449 transitions. Second operand 3 states. [2018-10-26 21:09:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:09:54,770 INFO L93 Difference]: Finished difference Result 33125 states and 36484 transitions. [2018-10-26 21:09:54,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:09:54,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2018-10-26 21:09:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:09:54,785 INFO L225 Difference]: With dead ends: 33125 [2018-10-26 21:09:54,785 INFO L226 Difference]: Without dead ends: 16375 [2018-10-26 21:09:54,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:09:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16375 states. [2018-10-26 21:09:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16375 to 16374. [2018-10-26 21:09:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16374 states. [2018-10-26 21:09:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16374 states to 16374 states and 18029 transitions. [2018-10-26 21:09:54,946 INFO L78 Accepts]: Start accepts. Automaton has 16374 states and 18029 transitions. Word has length 383 [2018-10-26 21:09:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:09:54,947 INFO L481 AbstractCegarLoop]: Abstraction has 16374 states and 18029 transitions. [2018-10-26 21:09:54,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:09:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 16374 states and 18029 transitions. [2018-10-26 21:09:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-10-26 21:09:54,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:09:54,964 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-26 21:09:54,965 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:09:54,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:09:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1543801625, now seen corresponding path program 1 times [2018-10-26 21:09:54,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:09:54,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:09:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:54,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:09:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 477 proven. 103 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-10-26 21:09:55,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:09:55,816 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:09:55,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:09:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:09:56,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:09:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 477 proven. 103 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-10-26 21:09:56,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:09:56,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-10-26 21:09:56,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:09:56,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:09:56,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:09:56,470 INFO L87 Difference]: Start difference. First operand 16374 states and 18029 transitions. Second operand 5 states. [2018-10-26 21:10:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:10:00,280 INFO L93 Difference]: Finished difference Result 39252 states and 43154 transitions. [2018-10-26 21:10:00,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:10:00,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 508 [2018-10-26 21:10:00,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:10:00,316 INFO L225 Difference]: With dead ends: 39252 [2018-10-26 21:10:00,316 INFO L226 Difference]: Without dead ends: 22880 [2018-10-26 21:10:00,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:10:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22880 states. [2018-10-26 21:10:00,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22880 to 16929. [2018-10-26 21:10:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16929 states. [2018-10-26 21:10:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16929 states to 16929 states and 18631 transitions. [2018-10-26 21:10:00,642 INFO L78 Accepts]: Start accepts. Automaton has 16929 states and 18631 transitions. Word has length 508 [2018-10-26 21:10:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:10:00,643 INFO L481 AbstractCegarLoop]: Abstraction has 16929 states and 18631 transitions. [2018-10-26 21:10:00,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:10:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 16929 states and 18631 transitions. [2018-10-26 21:10:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2018-10-26 21:10:00,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:10:00,665 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, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:10:00,665 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:10:00,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:10:00,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1903999203, now seen corresponding path program 1 times [2018-10-26 21:10:00,666 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:10:00,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:10:00,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:00,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:10:00,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:10:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:10:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 999 proven. 82 refuted. 0 times theorem prover too weak. 1169 trivial. 0 not checked. [2018-10-26 21:10:02,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:10:02,113 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:10:02,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:10:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:10:02,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:10:02,572 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2018-10-26 21:10:03,055 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 27 [2018-10-26 21:10:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1223 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2018-10-26 21:10:04,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:10:04,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-10-26 21:10:04,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:10:04,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:10:04,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:10:04,528 INFO L87 Difference]: Start difference. First operand 16929 states and 18631 transitions. Second operand 7 states. [2018-10-26 21:10:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:10:26,349 INFO L93 Difference]: Finished difference Result 39237 states and 43203 transitions. [2018-10-26 21:10:26,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:10:26,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 809 [2018-10-26 21:10:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:10:26,350 INFO L225 Difference]: With dead ends: 39237 [2018-10-26 21:10:26,350 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:10:26,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-10-26 21:10:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:10:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:10:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:10:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:10:26,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 809 [2018-10-26 21:10:26,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:10:26,367 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:10:26,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:10:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:10:26,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:10:26,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:10:26,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,796 WARN L179 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 224 [2018-10-26 21:10:26,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:26,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:10:27,215 WARN L179 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 224 [2018-10-26 21:10:29,820 WARN L179 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 216 DAG size of output: 71 [2018-10-26 21:10:31,395 WARN L179 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 216 DAG size of output: 71 [2018-10-26 21:10:31,398 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-10-26 21:10:31,398 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-10-26 21:10:31,398 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-10-26 21:10:31,398 INFO L428 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-10-26 21:10:31,398 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,398 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,399 INFO L425 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,400 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,400 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,400 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,400 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-10-26 21:10:31,400 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-10-26 21:10:31,400 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-10-26 21:10:31,400 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,400 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-10-26 21:10:31,401 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse8 (= ~a4~0 1)) (.cse9 (= ~a25~0 9))) (let ((.cse3 (exists ((v_~a23~0_472 Int)) (let ((.cse11 (mod v_~a23~0_472 90))) (and (<= .cse11 (+ ~a23~0 43)) (< v_~a23~0_472 0) (<= (+ v_~a23~0_472 43) 0) (not (= .cse11 0)))))) (.cse1 (not (= ~a25~0 11))) (.cse0 (not .cse9)) (.cse6 (not (= ~a25~0 13))) (.cse4 (not .cse8)) (.cse2 (= ~a8~0 15)) (.cse5 (= ~a25~0 10)) (.cse10 (<= ~a29~0 140)) (.cse7 (<= (+ ~a23~0 43) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5)) (and .cse2 .cse6 (<= (+ ~a29~0 28445) 0) .cse7) (and .cse8 .cse5 .cse7) (and .cse2 (= ~a25~0 12)) (and .cse2 .cse8 (< 138 ~a23~0)) (and .cse2 .cse6 (< 245 ~a29~0)) (and .cse3 (and (and .cse9 .cse10) .cse2)) (and .cse8 (<= ~a29~0 277) .cse7) (and .cse1 .cse2 .cse8 (<= ~a29~0 245) (<= 130 ~a29~0)) (and .cse9 .cse8 .cse10) (and .cse2 (and .cse0 .cse6 .cse4 .cse10)) (and .cse2 (and .cse5 .cse10)) (and .cse9 .cse8 .cse7)))) [2018-10-26 21:10:31,401 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,401 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,401 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,401 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,401 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,401 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,401 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,402 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,402 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-10-26 21:10:31,402 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-10-26 21:10:31,402 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-10-26 21:10:31,402 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-10-26 21:10:31,402 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-10-26 21:10:31,402 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-10-26 21:10:31,402 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-10-26 21:10:31,402 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,402 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,403 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,404 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,404 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,404 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,404 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-10-26 21:10:31,404 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-10-26 21:10:31,404 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-10-26 21:10:31,404 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 123) no Hoare annotation was computed. [2018-10-26 21:10:31,404 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,404 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,404 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,405 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,405 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-10-26 21:10:31,405 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-10-26 21:10:31,405 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,405 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,405 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,405 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,405 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,405 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,405 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-10-26 21:10:31,406 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-10-26 21:10:31,406 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,406 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,406 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-10-26 21:10:31,406 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-10-26 21:10:31,406 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-10-26 21:10:31,406 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,406 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,406 INFO L425 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,407 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,407 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,407 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,407 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,407 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-10-26 21:10:31,407 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-10-26 21:10:31,407 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-10-26 21:10:31,407 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-10-26 21:10:31,407 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-10-26 21:10:31,407 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-10-26 21:10:31,408 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-10-26 21:10:31,408 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,408 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,408 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:10:31,408 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-10-26 21:10:31,408 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-10-26 21:10:31,408 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,408 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,408 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,408 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,409 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,409 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-10-26 21:10:31,409 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-10-26 21:10:31,409 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-10-26 21:10:31,409 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,409 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,409 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,409 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,409 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,409 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,410 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-10-26 21:10:31,410 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-10-26 21:10:31,410 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-10-26 21:10:31,410 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,410 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,410 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,410 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,410 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,410 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,411 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,411 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-26 21:10:31,411 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,411 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-10-26 21:10:31,411 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-10-26 21:10:31,411 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-10-26 21:10:31,411 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,411 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,412 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,412 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,412 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,412 INFO L425 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,412 INFO L425 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,412 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,412 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,412 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,412 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,413 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-10-26 21:10:31,413 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-10-26 21:10:31,413 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-10-26 21:10:31,413 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-10-26 21:10:31,413 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-10-26 21:10:31,413 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,413 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,413 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,413 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,414 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,414 INFO L425 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,414 INFO L425 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,414 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-10-26 21:10:31,414 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-10-26 21:10:31,414 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-10-26 21:10:31,414 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,414 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,415 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,415 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-10-26 21:10:31,415 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-10-26 21:10:31,415 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,415 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,415 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,415 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,415 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,415 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-10-26 21:10:31,415 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-10-26 21:10:31,416 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,416 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,416 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-10-26 21:10:31,416 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-10-26 21:10:31,416 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,416 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,416 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,416 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,416 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,417 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,417 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-10-26 21:10:31,417 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-10-26 21:10:31,417 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-10-26 21:10:31,417 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-10-26 21:10:31,417 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,417 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,417 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,417 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,418 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,418 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,418 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,418 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,418 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-10-26 21:10:31,418 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-10-26 21:10:31,418 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-10-26 21:10:31,418 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-10-26 21:10:31,418 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-10-26 21:10:31,418 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-10-26 21:10:31,419 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,419 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,419 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,419 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,419 INFO L425 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,419 INFO L425 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,419 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,419 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-10-26 21:10:31,419 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-10-26 21:10:31,419 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-26 21:10:31,420 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,420 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,420 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,420 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,420 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,420 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,420 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-10-26 21:10:31,420 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-10-26 21:10:31,420 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,420 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,421 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,421 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,421 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,421 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,421 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,421 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-10-26 21:10:31,421 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,421 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,421 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,421 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-10-26 21:10:31,422 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-10-26 21:10:31,422 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-10-26 21:10:31,422 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,422 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-10-26 21:10:31,422 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,422 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-10-26 21:10:31,422 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,422 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,422 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,422 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,423 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,423 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,423 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-10-26 21:10:31,423 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-10-26 21:10:31,423 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-10-26 21:10:31,423 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,423 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,423 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,423 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:10:31,423 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,424 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,424 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,424 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,424 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,424 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,424 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,424 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-10-26 21:10:31,424 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-10-26 21:10:31,424 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-10-26 21:10:31,425 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,425 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-10-26 21:10:31,425 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-10-26 21:10:31,425 INFO L425 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,425 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,425 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,425 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,425 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,425 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,426 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-10-26 21:10:31,426 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-10-26 21:10:31,426 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-10-26 21:10:31,426 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,426 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,426 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,427 INFO L421 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse8 (= ~a4~0 1)) (.cse9 (= ~a25~0 9))) (let ((.cse3 (exists ((v_~a23~0_472 Int)) (let ((.cse11 (mod v_~a23~0_472 90))) (and (<= .cse11 (+ ~a23~0 43)) (< v_~a23~0_472 0) (<= (+ v_~a23~0_472 43) 0) (not (= .cse11 0)))))) (.cse1 (not (= ~a25~0 11))) (.cse0 (not .cse9)) (.cse6 (not (= ~a25~0 13))) (.cse4 (not .cse8)) (.cse2 (= ~a8~0 15)) (.cse5 (= ~a25~0 10)) (.cse10 (<= ~a29~0 140)) (.cse7 (<= (+ ~a23~0 43) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5)) (and .cse2 .cse6 (<= (+ ~a29~0 28445) 0) .cse7) (and .cse8 .cse5 .cse7) (and .cse2 (= ~a25~0 12)) (and .cse2 .cse8 (< 138 ~a23~0)) (and .cse2 .cse6 (< 245 ~a29~0)) (and .cse3 (and (and .cse9 .cse10) .cse2)) (and .cse8 (<= ~a29~0 277) .cse7) (and .cse1 .cse2 .cse8 (<= ~a29~0 245) (<= 130 ~a29~0)) (and .cse9 .cse8 .cse10) (and .cse2 (and .cse0 .cse6 .cse4 .cse10)) (and .cse2 (and .cse5 .cse10)) (and .cse9 .cse8 .cse7)))) [2018-10-26 21:10:31,427 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,427 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-10-26 21:10:31,427 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-10-26 21:10:31,427 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,427 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,427 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-10-26 21:10:31,427 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,427 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,427 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-10-26 21:10:31,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,439 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,449 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,450 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,453 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,453 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,453 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,453 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,454 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,454 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,454 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,455 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,457 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,458 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,458 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,458 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,459 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:10:31 BoogieIcfgContainer [2018-10-26 21:10:31,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:10:31,463 INFO L168 Benchmark]: Toolchain (without parser) took 81674.90 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-26 21:10:31,464 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:10:31,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1075.46 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.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-26 21:10:31,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 251.58 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-10-26 21:10:31,466 INFO L168 Benchmark]: Boogie Preprocessor took 139.02 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:10:31,467 INFO L168 Benchmark]: RCFGBuilder took 4571.68 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 195.9 MB). Peak memory consumption was 195.9 MB. Max. memory is 7.1 GB. [2018-10-26 21:10:31,467 INFO L168 Benchmark]: TraceAbstraction took 75631.51 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-26 21:10:31,472 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.22 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 1075.46 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.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 251.58 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.02 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4571.68 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 195.9 MB). Peak memory consumption was 195.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75631.51 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 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_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 123]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2018-10-26 21:10:31,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,491 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,492 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,493 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] Derived loop invariant: ((((((((((((((((!(a25 == 9) && !(a25 == 11)) && a8 == 15) && (\exists v_~a23~0_472 : int :: ((v_~a23~0_472 % 90 <= a23 + 43 && v_~a23~0_472 < 0) && v_~a23~0_472 + 43 <= 0) && !(v_~a23~0_472 % 90 == 0))) && !(a4 == 1)) && !(a25 == 10)) || (((a8 == 15 && !(a25 == 13)) && a29 + 28445 <= 0) && a23 + 43 <= 0)) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (a8 == 15 && a25 == 12)) || ((a8 == 15 && a4 == 1) && 138 < a23)) || ((a8 == 15 && !(a25 == 13)) && 245 < a29)) || ((\exists v_~a23~0_472 : int :: ((v_~a23~0_472 % 90 <= a23 + 43 && v_~a23~0_472 < 0) && v_~a23~0_472 + 43 <= 0) && !(v_~a23~0_472 % 90 == 0)) && (a25 == 9 && a29 <= 140) && a8 == 15)) || ((a4 == 1 && a29 <= 277) && a23 + 43 <= 0)) || ((((!(a25 == 11) && a8 == 15) && a4 == 1) && a29 <= 245) && 130 <= a29)) || ((a25 == 9 && a4 == 1) && a29 <= 140)) || (a8 == 15 && ((!(a25 == 9) && !(a25 == 13)) && !(a4 == 1)) && a29 <= 140)) || (a8 == 15 && a25 == 10 && a29 <= 140)) || ((a25 == 9 && a4 == 1) && a23 + 43 <= 0) - InvariantResult [Line: 22]: Loop Invariant [2018-10-26 21:10:31,494 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,495 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,495 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,495 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,496 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,496 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,496 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,496 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,498 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,500 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,500 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,500 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,501 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,501 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,501 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2018-10-26 21:10:31,501 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] Derived loop invariant: ((((((((((((((((!(a25 == 9) && !(a25 == 11)) && a8 == 15) && (\exists v_~a23~0_472 : int :: ((v_~a23~0_472 % 90 <= a23 + 43 && v_~a23~0_472 < 0) && v_~a23~0_472 + 43 <= 0) && !(v_~a23~0_472 % 90 == 0))) && !(a4 == 1)) && !(a25 == 10)) || (((a8 == 15 && !(a25 == 13)) && a29 + 28445 <= 0) && a23 + 43 <= 0)) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (a8 == 15 && a25 == 12)) || ((a8 == 15 && a4 == 1) && 138 < a23)) || ((a8 == 15 && !(a25 == 13)) && 245 < a29)) || ((\exists v_~a23~0_472 : int :: ((v_~a23~0_472 % 90 <= a23 + 43 && v_~a23~0_472 < 0) && v_~a23~0_472 + 43 <= 0) && !(v_~a23~0_472 % 90 == 0)) && (a25 == 9 && a29 <= 140) && a8 == 15)) || ((a4 == 1 && a29 <= 277) && a23 + 43 <= 0)) || ((((!(a25 == 11) && a8 == 15) && a4 == 1) && a29 <= 245) && 130 <= a29)) || ((a25 == 9 && a4 == 1) && a29 <= 140)) || (a8 == 15 && ((!(a25 == 9) && !(a25 == 13)) && !(a4 == 1)) && a29 <= 140)) || (a8 == 15 && a25 == 10 && a29 <= 140)) || ((a25 == 9 && a4 == 1) && a23 + 43 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. SAFE Result, 75.5s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 57.4s AutomataDifference, 0.0s DeadEndRemovalTime, 5.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3176 SDtfs, 6483 SDslu, 1396 SDs, 0 SdLazy, 15169 SolverSat, 3533 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 50.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1379 GetRequests, 1337 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16929occurred 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.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 12155 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 296 NumberOfFragments, 439 HoareAnnotationTreeSize, 3 FomulaSimplifications, 11270 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 9450 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 5503 NumberOfCodeBlocks, 5503 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 5488 ConstructedInterpolants, 274 QuantifiedInterpolants, 10197316 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1704 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 8383/8671 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...