java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label44_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:04:58,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:04:58,827 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:04:58,841 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:04:58,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:04:58,843 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:04:58,844 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:04:58,847 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:04:58,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:04:58,859 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:04:58,860 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:04:58,860 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:04:58,861 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:04:58,862 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:04:58,863 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:04:58,869 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:04:58,870 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:04:58,875 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:04:58,877 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:04:58,881 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:04:58,882 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:04:58,883 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:04:58,887 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:04:58,887 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:04:58,888 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:04:58,889 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:04:58,889 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:04:58,892 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:04:58,893 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:04:58,895 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:04:58,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:04:58,897 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:04:58,897 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:04:58,898 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:04:58,900 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:04:58,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:04:58,901 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:04:58,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:04:58,927 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:04:58,928 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:04:58,929 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:04:58,929 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:04:58,929 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:04:58,930 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:04:58,930 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:04:58,930 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:04:58,930 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:04:58,931 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:04:58,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:04:58,932 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:04:58,932 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:04:58,932 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:04:58,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:04:58,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:04:58,933 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:04:58,933 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:04:58,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:04:58,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:04:58,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:04:58,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:04:58,936 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:04:58,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:04:58,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:04:58,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:04:58,937 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:04:59,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:04:59,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:04:59,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:04:59,035 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:04:59,035 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:04:59,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label44_true-unreach-call.c [2018-11-06 21:04:59,101 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fa52cf3/ed596d9537064857a40e83a45c9c21fa/FLAG58b1fe950 [2018-11-06 21:04:59,741 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:04:59,742 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label44_true-unreach-call.c [2018-11-06 21:04:59,760 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fa52cf3/ed596d9537064857a40e83a45c9c21fa/FLAG58b1fe950 [2018-11-06 21:04:59,778 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fa52cf3/ed596d9537064857a40e83a45c9c21fa [2018-11-06 21:04:59,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:04:59,793 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:04:59,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:04:59,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:04:59,800 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:04:59,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:04:59" (1/1) ... [2018-11-06 21:04:59,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a5a8152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:59, skipping insertion in model container [2018-11-06 21:04:59,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:04:59" (1/1) ... [2018-11-06 21:04:59,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:04:59,910 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:05:00,536 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:05:00,542 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:05:00,726 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:05:00,756 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:05:00,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:00 WrapperNode [2018-11-06 21:05:00,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:05:00,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:05:00,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:05:00,758 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:05:00,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:00" (1/1) ... [2018-11-06 21:05:00,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:00" (1/1) ... [2018-11-06 21:05:01,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:05:01,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:05:01,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:05:01,035 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:05:01,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:00" (1/1) ... [2018-11-06 21:05:01,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:00" (1/1) ... [2018-11-06 21:05:01,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:00" (1/1) ... [2018-11-06 21:05:01,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:00" (1/1) ... [2018-11-06 21:05:01,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:00" (1/1) ... [2018-11-06 21:05:01,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:00" (1/1) ... [2018-11-06 21:05:01,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:00" (1/1) ... [2018-11-06 21:05:01,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:05:01,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:05:01,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:05:01,166 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:05:01,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:05:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:05:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:05:01,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:05:05,685 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:05:05,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:05:05 BoogieIcfgContainer [2018-11-06 21:05:05,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:05:05,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:05:05,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:05:05,690 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:05:05,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:04:59" (1/3) ... [2018-11-06 21:05:05,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2658e0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:05:05, skipping insertion in model container [2018-11-06 21:05:05,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:00" (2/3) ... [2018-11-06 21:05:05,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2658e0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:05:05, skipping insertion in model container [2018-11-06 21:05:05,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:05:05" (3/3) ... [2018-11-06 21:05:05,694 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label44_true-unreach-call.c [2018-11-06 21:05:05,704 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:05:05,713 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:05:05,731 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:05:05,769 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:05:05,770 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:05:05,770 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:05:05,770 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:05:05,770 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:05:05,771 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:05:05,771 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:05:05,771 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:05:05,771 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:05:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-11-06 21:05:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-06 21:05:05,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:05,806 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] [2018-11-06 21:05:05,809 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:05,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:05,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1740446778, now seen corresponding path program 1 times [2018-11-06 21:05:05,817 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:05,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:05,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:05,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:06,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:06,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:05:06,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:05:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:05:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:06,223 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-11-06 21:05:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:09,858 INFO L93 Difference]: Finished difference Result 964 states and 1743 transitions. [2018-11-06 21:05:09,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:05:09,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-06 21:05:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:09,887 INFO L225 Difference]: With dead ends: 964 [2018-11-06 21:05:09,887 INFO L226 Difference]: Without dead ends: 673 [2018-11-06 21:05:09,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-11-06 21:05:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 658. [2018-11-06 21:05:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-11-06 21:05:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1087 transitions. [2018-11-06 21:05:09,979 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1087 transitions. Word has length 27 [2018-11-06 21:05:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:09,980 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 1087 transitions. [2018-11-06 21:05:09,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1087 transitions. [2018-11-06 21:05:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-06 21:05:09,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:09,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:09,985 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:09,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:09,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1836350057, now seen corresponding path program 1 times [2018-11-06 21:05:09,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:09,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:09,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:09,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:09,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-06 21:05:10,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:10,275 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:05:10,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:10,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:10,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:05:10,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 21:05:10,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:05:10,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:05:10,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:10,440 INFO L87 Difference]: Start difference. First operand 658 states and 1087 transitions. Second operand 4 states. [2018-11-06 21:05:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:15,414 INFO L93 Difference]: Finished difference Result 2434 states and 4125 transitions. [2018-11-06 21:05:15,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:05:15,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-06 21:05:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:15,425 INFO L225 Difference]: With dead ends: 2434 [2018-11-06 21:05:15,426 INFO L226 Difference]: Without dead ends: 1778 [2018-11-06 21:05:15,429 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2018-11-06 21:05:15,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1216. [2018-11-06 21:05:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-11-06 21:05:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1765 transitions. [2018-11-06 21:05:15,485 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1765 transitions. Word has length 101 [2018-11-06 21:05:15,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:15,486 INFO L480 AbstractCegarLoop]: Abstraction has 1216 states and 1765 transitions. [2018-11-06 21:05:15,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1765 transitions. [2018-11-06 21:05:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-06 21:05:15,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:15,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:15,495 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:15,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:15,495 INFO L82 PathProgramCache]: Analyzing trace with hash 731753899, now seen corresponding path program 1 times [2018-11-06 21:05:15,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:15,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:15,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:15,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:15,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:15,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:15,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:05:15,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:05:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:05:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:15,893 INFO L87 Difference]: Start difference. First operand 1216 states and 1765 transitions. Second operand 4 states. [2018-11-06 21:05:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:18,543 INFO L93 Difference]: Finished difference Result 4679 states and 6858 transitions. [2018-11-06 21:05:18,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:05:18,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-11-06 21:05:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:18,561 INFO L225 Difference]: With dead ends: 4679 [2018-11-06 21:05:18,562 INFO L226 Difference]: Without dead ends: 3465 [2018-11-06 21:05:18,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:18,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2018-11-06 21:05:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 3459. [2018-11-06 21:05:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3459 states. [2018-11-06 21:05:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4638 transitions. [2018-11-06 21:05:18,634 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4638 transitions. Word has length 168 [2018-11-06 21:05:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:18,634 INFO L480 AbstractCegarLoop]: Abstraction has 3459 states and 4638 transitions. [2018-11-06 21:05:18,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4638 transitions. [2018-11-06 21:05:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-06 21:05:18,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:18,639 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:05:18,640 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:18,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:18,640 INFO L82 PathProgramCache]: Analyzing trace with hash 392979134, now seen corresponding path program 1 times [2018-11-06 21:05:18,640 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:18,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:18,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:18,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:18,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:19,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:19,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:05:19,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:05:19,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:05:19,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:19,094 INFO L87 Difference]: Start difference. First operand 3459 states and 4638 transitions. Second operand 4 states. [2018-11-06 21:05:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:22,912 INFO L93 Difference]: Finished difference Result 8781 states and 12011 transitions. [2018-11-06 21:05:22,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:05:22,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 209 [2018-11-06 21:05:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:22,996 INFO L225 Difference]: With dead ends: 8781 [2018-11-06 21:05:22,996 INFO L226 Difference]: Without dead ends: 5509 [2018-11-06 21:05:23,001 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2018-11-06 21:05:23,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5310. [2018-11-06 21:05:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5310 states. [2018-11-06 21:05:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5310 states to 5310 states and 6987 transitions. [2018-11-06 21:05:23,100 INFO L78 Accepts]: Start accepts. Automaton has 5310 states and 6987 transitions. Word has length 209 [2018-11-06 21:05:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:23,100 INFO L480 AbstractCegarLoop]: Abstraction has 5310 states and 6987 transitions. [2018-11-06 21:05:23,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 5310 states and 6987 transitions. [2018-11-06 21:05:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-06 21:05:23,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:23,105 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:05:23,105 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:23,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:23,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1357313059, now seen corresponding path program 1 times [2018-11-06 21:05:23,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:23,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:23,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:23,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:23,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:23,607 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-06 21:05:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 49 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:05:23,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:23,917 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:05:23,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:23,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:24,743 WARN L179 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 500 DAG size of output: 25 [2018-11-06 21:05:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-06 21:05:24,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:24,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2018-11-06 21:05:24,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:05:24,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:05:24,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:05:24,905 INFO L87 Difference]: Start difference. First operand 5310 states and 6987 transitions. Second operand 9 states. [2018-11-06 21:05:25,216 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-11-06 21:05:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:40,865 INFO L93 Difference]: Finished difference Result 24228 states and 32910 transitions. [2018-11-06 21:05:40,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-06 21:05:40,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 210 [2018-11-06 21:05:40,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:40,944 INFO L225 Difference]: With dead ends: 24228 [2018-11-06 21:05:40,944 INFO L226 Difference]: Without dead ends: 19105 [2018-11-06 21:05:40,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2018-11-06 21:05:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19105 states. [2018-11-06 21:05:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19105 to 15742. [2018-11-06 21:05:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15742 states. [2018-11-06 21:05:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15742 states to 15742 states and 19495 transitions. [2018-11-06 21:05:41,423 INFO L78 Accepts]: Start accepts. Automaton has 15742 states and 19495 transitions. Word has length 210 [2018-11-06 21:05:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:41,423 INFO L480 AbstractCegarLoop]: Abstraction has 15742 states and 19495 transitions. [2018-11-06 21:05:41,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:05:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 15742 states and 19495 transitions. [2018-11-06 21:05:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-06 21:05:41,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:41,434 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:41,435 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:41,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:41,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1567167504, now seen corresponding path program 1 times [2018-11-06 21:05:41,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:41,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:41,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:41,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:41,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-06 21:05:41,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:41,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:05:41,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:05:41,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:05:41,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:41,929 INFO L87 Difference]: Start difference. First operand 15742 states and 19495 transitions. Second operand 5 states. [2018-11-06 21:05:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:45,643 INFO L93 Difference]: Finished difference Result 46546 states and 57892 transitions. [2018-11-06 21:05:45,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:05:45,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2018-11-06 21:05:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:45,699 INFO L225 Difference]: With dead ends: 46546 [2018-11-06 21:05:45,700 INFO L226 Difference]: Without dead ends: 28016 [2018-11-06 21:05:45,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28016 states. [2018-11-06 21:05:46,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28016 to 24286. [2018-11-06 21:05:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24286 states. [2018-11-06 21:05:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24286 states to 24286 states and 29176 transitions. [2018-11-06 21:05:46,082 INFO L78 Accepts]: Start accepts. Automaton has 24286 states and 29176 transitions. Word has length 264 [2018-11-06 21:05:46,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:46,083 INFO L480 AbstractCegarLoop]: Abstraction has 24286 states and 29176 transitions. [2018-11-06 21:05:46,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:05:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 24286 states and 29176 transitions. [2018-11-06 21:05:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-11-06 21:05:46,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:46,100 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-06 21:05:46,100 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:46,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:46,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1791854745, now seen corresponding path program 1 times [2018-11-06 21:05:46,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:46,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:46,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:46,393 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-06 21:05:46,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:46,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:05:46,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:05:46,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:05:46,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:05:46,395 INFO L87 Difference]: Start difference. First operand 24286 states and 29176 transitions. Second operand 3 states. [2018-11-06 21:05:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:47,481 INFO L93 Difference]: Finished difference Result 48007 states and 57634 transitions. [2018-11-06 21:05:47,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:05:47,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2018-11-06 21:05:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:47,533 INFO L225 Difference]: With dead ends: 48007 [2018-11-06 21:05:47,533 INFO L226 Difference]: Without dead ends: 24093 [2018-11-06 21:05:47,564 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:05:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24093 states. [2018-11-06 21:05:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24093 to 24091. [2018-11-06 21:05:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24091 states. [2018-11-06 21:05:48,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24091 states to 24091 states and 28842 transitions. [2018-11-06 21:05:48,146 INFO L78 Accepts]: Start accepts. Automaton has 24091 states and 28842 transitions. Word has length 311 [2018-11-06 21:05:48,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:48,146 INFO L480 AbstractCegarLoop]: Abstraction has 24091 states and 28842 transitions. [2018-11-06 21:05:48,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:05:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 24091 states and 28842 transitions. [2018-11-06 21:05:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-11-06 21:05:48,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:48,171 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:48,172 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:48,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1523957267, now seen corresponding path program 1 times [2018-11-06 21:05:48,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:48,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:48,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:48,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:48,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-06 21:05:48,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:48,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:05:48,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:05:48,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:05:48,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:05:48,462 INFO L87 Difference]: Start difference. First operand 24091 states and 28842 transitions. Second operand 3 states. [2018-11-06 21:05:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:49,832 INFO L93 Difference]: Finished difference Result 55207 states and 66304 transitions. [2018-11-06 21:05:49,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:05:49,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2018-11-06 21:05:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:49,870 INFO L225 Difference]: With dead ends: 55207 [2018-11-06 21:05:49,870 INFO L226 Difference]: Without dead ends: 30558 [2018-11-06 21:05:49,891 INFO L604 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-11-06 21:05:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30558 states. [2018-11-06 21:05:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30558 to 30002. [2018-11-06 21:05:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30002 states. [2018-11-06 21:05:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30002 states to 30002 states and 35148 transitions. [2018-11-06 21:05:50,240 INFO L78 Accepts]: Start accepts. Automaton has 30002 states and 35148 transitions. Word has length 351 [2018-11-06 21:05:50,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:50,241 INFO L480 AbstractCegarLoop]: Abstraction has 30002 states and 35148 transitions. [2018-11-06 21:05:50,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:05:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 30002 states and 35148 transitions. [2018-11-06 21:05:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-11-06 21:05:50,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:50,279 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-11-06 21:05:50,279 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:50,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:50,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1697026094, now seen corresponding path program 1 times [2018-11-06 21:05:50,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:50,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:50,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:50,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:50,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-06 21:05:50,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:50,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:05:50,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:05:50,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:05:50,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:05:50,607 INFO L87 Difference]: Start difference. First operand 30002 states and 35148 transitions. Second operand 3 states. [2018-11-06 21:05:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:52,573 INFO L93 Difference]: Finished difference Result 62572 states and 73198 transitions. [2018-11-06 21:05:52,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:05:52,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2018-11-06 21:05:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:52,610 INFO L225 Difference]: With dead ends: 62572 [2018-11-06 21:05:52,610 INFO L226 Difference]: Without dead ends: 24563 [2018-11-06 21:05:52,626 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:05:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24563 states. [2018-11-06 21:05:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24563 to 23634. [2018-11-06 21:05:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23634 states. [2018-11-06 21:05:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23634 states to 23634 states and 26379 transitions. [2018-11-06 21:05:52,900 INFO L78 Accepts]: Start accepts. Automaton has 23634 states and 26379 transitions. Word has length 381 [2018-11-06 21:05:52,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:52,900 INFO L480 AbstractCegarLoop]: Abstraction has 23634 states and 26379 transitions. [2018-11-06 21:05:52,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:05:52,901 INFO L276 IsEmpty]: Start isEmpty. Operand 23634 states and 26379 transitions. [2018-11-06 21:05:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-11-06 21:05:52,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:52,934 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:52,934 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:52,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:52,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1069241432, now seen corresponding path program 1 times [2018-11-06 21:05:52,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:52,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:52,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:52,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:52,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2018-11-06 21:05:53,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:53,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:05:53,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:05:53,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:05:53,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:05:53,373 INFO L87 Difference]: Start difference. First operand 23634 states and 26379 transitions. Second operand 3 states. [2018-11-06 21:05:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:54,713 INFO L93 Difference]: Finished difference Result 49669 states and 55508 transitions. [2018-11-06 21:05:54,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:05:54,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2018-11-06 21:05:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:54,716 INFO L225 Difference]: With dead ends: 49669 [2018-11-06 21:05:54,716 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:05:54,734 INFO L604 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-11-06 21:05:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:05:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:05:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:05:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:05:54,735 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 496 [2018-11-06 21:05:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:54,736 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:05:54,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:05:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:05:54,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:05:54,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:05:54,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:54,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,178 WARN L179 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 182 [2018-11-06 21:05:55,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:55,615 WARN L179 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 182 [2018-11-06 21:06:00,171 WARN L179 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 180 DAG size of output: 75 [2018-11-06 21:06:02,330 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 180 DAG size of output: 75 [2018-11-06 21:06:02,333 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-06 21:06:02,333 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-06 21:06:02,333 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-06 21:06:02,334 INFO L428 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-11-06 21:06:02,334 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,334 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,334 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,334 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,334 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,335 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,335 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,335 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-06 21:06:02,335 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-06 21:06:02,335 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-06 21:06:02,335 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,335 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,335 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,335 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,335 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,336 INFO L425 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,336 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,336 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,336 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,336 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-06 21:06:02,336 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-06 21:06:02,336 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-06 21:06:02,337 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,337 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-11-06 21:06:02,337 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse4 (< 0 (+ ~a23~0 43))) (.cse8 (not (= ~a25~0 13))) (.cse1 (<= ~a29~0 277)) (.cse6 (< 245 ~a29~0))) (let ((.cse9 (<= 262 ~a29~0)) (.cse12 (<= ~a29~0 130)) (.cse11 (<= ~a29~0 140)) (.cse3 (<= ~a23~0 138)) (.cse2 (and .cse4 .cse8 .cse1 .cse6)) (.cse10 (= ~a4~0 1)) (.cse7 (not (= ~a25~0 9))) (.cse0 (= ~a8~0 15)) (.cse5 (exists ((v_prenex_26 Int)) (let ((.cse14 (* 9 v_prenex_26))) (let ((.cse13 (div .cse14 10))) (and (<= 312 v_prenex_26) (<= 0 (+ .cse13 58980)) (<= 0 (+ .cse13 58979)) (<= ~a23~0 (+ (mod (+ .cse13 29) 90) 48)) (<= 0 .cse14))))))) (or (and (= ~a25~0 12) .cse0 .cse1) (and .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse3 .cse9) (and .cse7 .cse0 .cse10) (and .cse0 .cse10 .cse9) (and .cse0 .cse10 .cse11) (and .cse0 .cse5 .cse12) (and .cse0 .cse5 .cse9) (and .cse0 .cse12 (= ~a25~0 10)) (and .cse0 .cse4 .cse8 .cse3 .cse11) (and .cse0 .cse10 .cse3) (and .cse0 .cse2 .cse10) (and .cse0 (< 306 ~a23~0) .cse10) (and .cse7 .cse0 .cse5)))) [2018-11-06 21:06:02,337 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,337 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,338 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,338 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,338 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,338 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,338 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,338 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,338 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-06 21:06:02,338 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-06 21:06:02,338 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-06 21:06:02,339 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:06:02,339 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:06:02,339 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:06:02,339 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:06:02,339 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,339 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,339 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,339 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,339 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,339 INFO L425 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,339 INFO L425 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,340 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,340 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,340 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,340 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-06 21:06:02,340 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-06 21:06:02,340 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-11-06 21:06:02,340 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-11-06 21:06:02,340 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,340 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,341 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,341 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,341 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,341 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-06 21:06:02,341 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-11-06 21:06:02,341 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-06 21:06:02,341 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,342 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,342 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,342 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,342 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:06:02,342 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:06:02,342 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,342 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,343 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,343 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,343 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,343 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,343 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:06:02,343 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:06:02,343 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,343 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,344 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-06 21:06:02,344 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-06 21:06:02,344 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-06 21:06:02,344 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,344 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,344 INFO L425 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,344 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,344 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,345 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,345 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,345 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-06 21:06:02,345 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-06 21:06:02,345 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-11-06 21:06:02,345 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:06:02,345 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:06:02,345 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:06:02,346 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:06:02,346 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,346 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,346 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:06:02,346 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:06:02,346 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:06:02,347 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,347 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,347 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,347 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,347 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,347 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-11-06 21:06:02,347 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-06 21:06:02,348 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-06 21:06:02,348 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,348 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,348 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,348 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,348 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,348 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,348 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-06 21:06:02,349 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-06 21:06:02,349 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-11-06 21:06:02,349 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,349 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,349 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,349 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,349 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,349 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,350 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,350 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:06:02,350 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,350 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-11-06 21:06:02,350 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-06 21:06:02,350 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-06 21:06:02,350 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,350 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,350 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,351 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,351 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,351 INFO L425 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,351 INFO L425 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,351 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,351 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,351 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,351 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,352 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:06:02,352 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:06:02,352 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-11-06 21:06:02,352 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-06 21:06:02,352 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-06 21:06:02,352 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,352 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,352 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,352 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,352 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,352 INFO L425 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,353 INFO L425 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,353 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-06 21:06:02,353 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-06 21:06:02,353 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-11-06 21:06:02,353 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,353 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,353 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,353 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:06:02,353 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:06:02,353 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,353 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,354 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,354 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,354 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,354 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-06 21:06:02,354 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-11-06 21:06:02,354 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,354 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,354 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:06:02,354 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:06:02,354 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,354 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,354 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,355 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,355 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,355 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,355 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-06 21:06:02,355 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-06 21:06:02,355 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:06:02,355 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:06:02,355 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,355 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2018-11-06 21:06:02,355 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,356 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,356 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,356 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,356 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,356 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,356 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,356 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-06 21:06:02,356 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-06 21:06:02,356 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:06:02,356 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:06:02,356 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:06:02,357 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:06:02,357 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,357 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,357 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,357 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,357 INFO L425 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,357 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,357 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,357 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-06 21:06:02,357 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-06 21:06:02,357 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:06:02,357 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,358 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,358 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,358 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,358 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,358 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,358 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-06 21:06:02,358 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-06 21:06:02,358 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,358 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,358 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,358 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,359 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,359 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,359 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,359 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-06 21:06:02,359 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,359 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,359 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,359 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-06 21:06:02,359 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-06 21:06:02,359 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-06 21:06:02,359 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,359 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:06:02,360 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,360 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:06:02,360 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,360 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,360 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,360 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,360 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,360 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,360 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-06 21:06:02,360 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-06 21:06:02,360 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-06 21:06:02,361 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,361 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,361 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,361 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:06:02,361 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,361 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,361 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,361 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,362 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,362 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,362 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,362 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-06 21:06:02,362 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-06 21:06:02,362 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-11-06 21:06:02,362 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,363 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:06:02,363 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:06:02,363 INFO L425 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,363 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,363 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,363 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,363 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,363 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,363 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-06 21:06:02,363 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-06 21:06:02,364 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-06 21:06:02,364 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,364 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,364 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,364 INFO L421 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse4 (< 0 (+ ~a23~0 43))) (.cse8 (not (= ~a25~0 13))) (.cse1 (<= ~a29~0 277)) (.cse6 (< 245 ~a29~0))) (let ((.cse9 (<= 262 ~a29~0)) (.cse12 (<= ~a29~0 130)) (.cse11 (<= ~a29~0 140)) (.cse3 (<= ~a23~0 138)) (.cse2 (and .cse4 .cse8 .cse1 .cse6)) (.cse10 (= ~a4~0 1)) (.cse7 (not (= ~a25~0 9))) (.cse0 (= ~a8~0 15)) (.cse5 (exists ((v_prenex_26 Int)) (let ((.cse14 (* 9 v_prenex_26))) (let ((.cse13 (div .cse14 10))) (and (<= 312 v_prenex_26) (<= 0 (+ .cse13 58980)) (<= 0 (+ .cse13 58979)) (<= ~a23~0 (+ (mod (+ .cse13 29) 90) 48)) (<= 0 .cse14))))))) (or (and (= ~a25~0 12) .cse0 .cse1) (and .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse3 .cse9) (and .cse7 .cse0 .cse10) (and .cse0 .cse10 .cse9) (and .cse0 .cse10 .cse11) (and .cse0 .cse5 .cse12) (and .cse0 .cse5 .cse9) (and .cse0 .cse12 (= ~a25~0 10)) (and .cse0 .cse4 .cse8 .cse3 .cse11) (and .cse0 .cse10 .cse3) (and .cse0 .cse2 .cse10) (and .cse0 (< 306 ~a23~0) .cse10) (and .cse7 .cse0 .cse5)))) [2018-11-06 21:06:02,364 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,365 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:06:02,365 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:06:02,365 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,365 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,365 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-11-06 21:06:02,365 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,366 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,366 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:02,376 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,378 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,378 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,400 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,400 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,400 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,401 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,402 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,405 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,405 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,414 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,414 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,415 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,419 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,422 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,423 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,424 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,424 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,424 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,425 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,425 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,425 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,428 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,428 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,428 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,429 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,429 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,429 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,429 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,430 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,430 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,430 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,430 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,431 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,431 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:06:02 BoogieIcfgContainer [2018-11-06 21:06:02,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:06:02,435 INFO L168 Benchmark]: Toolchain (without parser) took 62644.16 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -50.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:06:02,437 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-11-06 21:06:02,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 962.82 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: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:02,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 276.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:02,440 INFO L168 Benchmark]: Boogie Preprocessor took 130.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:02,442 INFO L168 Benchmark]: RCFGBuilder took 4519.49 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: 178.4 MB). Peak memory consumption was 178.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:02,442 INFO L168 Benchmark]: TraceAbstraction took 56747.66 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 863.0 MB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 512.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-11-06 21:06:02,450 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 962.82 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: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 276.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4519.49 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: 178.4 MB). Peak memory consumption was 178.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56747.66 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 863.0 MB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 512.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 84]: 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-11-06 21:06:02,465 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,465 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,465 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,466 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,466 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,466 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,467 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,467 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,467 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,467 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,468 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,468 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,468 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,468 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,469 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,469 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,469 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,469 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,470 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,470 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,472 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,472 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,472 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,473 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,473 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,473 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,473 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,474 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,474 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,474 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,474 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,475 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,475 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,475 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,475 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,476 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,476 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] Derived loop invariant: (((((((((((((((a25 == 12 && a8 == 15) && a29 <= 277) || ((a8 == 15 && ((0 < a23 + 43 && !(a25 == 13)) && a29 <= 277) && 245 < a29) && a23 <= 138)) || ((0 < a23 + 43 && (\exists v_prenex_26 : int :: (((312 <= v_prenex_26 && 0 <= 9 * v_prenex_26 / 10 + 58980) && 0 <= 9 * v_prenex_26 / 10 + 58979) && a23 <= (9 * v_prenex_26 / 10 + 29) % 90 + 48) && 0 <= 9 * v_prenex_26)) && 245 < a29)) || ((((!(a25 == 9) && a8 == 15) && !(a25 == 13)) && a23 <= 138) && 262 <= a29)) || ((!(a25 == 9) && a8 == 15) && a4 == 1)) || ((a8 == 15 && a4 == 1) && 262 <= a29)) || ((a8 == 15 && a4 == 1) && a29 <= 140)) || ((a8 == 15 && (\exists v_prenex_26 : int :: (((312 <= v_prenex_26 && 0 <= 9 * v_prenex_26 / 10 + 58980) && 0 <= 9 * v_prenex_26 / 10 + 58979) && a23 <= (9 * v_prenex_26 / 10 + 29) % 90 + 48) && 0 <= 9 * v_prenex_26)) && a29 <= 130)) || ((a8 == 15 && (\exists v_prenex_26 : int :: (((312 <= v_prenex_26 && 0 <= 9 * v_prenex_26 / 10 + 58980) && 0 <= 9 * v_prenex_26 / 10 + 58979) && a23 <= (9 * v_prenex_26 / 10 + 29) % 90 + 48) && 0 <= 9 * v_prenex_26)) && 262 <= a29)) || ((a8 == 15 && a29 <= 130) && a25 == 10)) || ((((a8 == 15 && 0 < a23 + 43) && !(a25 == 13)) && a23 <= 138) && a29 <= 140)) || ((a8 == 15 && a4 == 1) && a23 <= 138)) || ((a8 == 15 && ((0 < a23 + 43 && !(a25 == 13)) && a29 <= 277) && 245 < a29) && a4 == 1)) || ((a8 == 15 && 306 < a23) && a4 == 1)) || ((!(a25 == 9) && a8 == 15) && (\exists v_prenex_26 : int :: (((312 <= v_prenex_26 && 0 <= 9 * v_prenex_26 / 10 + 58980) && 0 <= 9 * v_prenex_26 / 10 + 58979) && a23 <= (9 * v_prenex_26 / 10 + 29) % 90 + 48) && 0 <= 9 * v_prenex_26)) - InvariantResult [Line: 22]: Loop Invariant [2018-11-06 21:06:02,477 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,477 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,478 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,478 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,478 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,478 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,480 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,480 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,480 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,480 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,486 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,487 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-06 21:06:02,488 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] Derived loop invariant: (((((((((((((((a25 == 12 && a8 == 15) && a29 <= 277) || ((a8 == 15 && ((0 < a23 + 43 && !(a25 == 13)) && a29 <= 277) && 245 < a29) && a23 <= 138)) || ((0 < a23 + 43 && (\exists v_prenex_26 : int :: (((312 <= v_prenex_26 && 0 <= 9 * v_prenex_26 / 10 + 58980) && 0 <= 9 * v_prenex_26 / 10 + 58979) && a23 <= (9 * v_prenex_26 / 10 + 29) % 90 + 48) && 0 <= 9 * v_prenex_26)) && 245 < a29)) || ((((!(a25 == 9) && a8 == 15) && !(a25 == 13)) && a23 <= 138) && 262 <= a29)) || ((!(a25 == 9) && a8 == 15) && a4 == 1)) || ((a8 == 15 && a4 == 1) && 262 <= a29)) || ((a8 == 15 && a4 == 1) && a29 <= 140)) || ((a8 == 15 && (\exists v_prenex_26 : int :: (((312 <= v_prenex_26 && 0 <= 9 * v_prenex_26 / 10 + 58980) && 0 <= 9 * v_prenex_26 / 10 + 58979) && a23 <= (9 * v_prenex_26 / 10 + 29) % 90 + 48) && 0 <= 9 * v_prenex_26)) && a29 <= 130)) || ((a8 == 15 && (\exists v_prenex_26 : int :: (((312 <= v_prenex_26 && 0 <= 9 * v_prenex_26 / 10 + 58980) && 0 <= 9 * v_prenex_26 / 10 + 58979) && a23 <= (9 * v_prenex_26 / 10 + 29) % 90 + 48) && 0 <= 9 * v_prenex_26)) && 262 <= a29)) || ((a8 == 15 && a29 <= 130) && a25 == 10)) || ((((a8 == 15 && 0 < a23 + 43) && !(a25 == 13)) && a23 <= 138) && a29 <= 140)) || ((a8 == 15 && a4 == 1) && a23 <= 138)) || ((a8 == 15 && ((0 < a23 + 43 && !(a25 == 13)) && a29 <= 277) && 245 < a29) && a4 == 1)) || ((a8 == 15 && 306 < a23) && a4 == 1)) || ((!(a25 == 9) && a8 == 15) && (\exists v_prenex_26 : int :: (((312 <= v_prenex_26 && 0 <= 9 * v_prenex_26 / 10 + 58980) && 0 <= 9 * v_prenex_26 / 10 + 58979) && a23 <= (9 * v_prenex_26 / 10 + 29) % 90 + 48) && 0 <= 9 * v_prenex_26)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. SAFE Result, 56.6s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 41.0s AutomataDifference, 0.0s DeadEndRemovalTime, 7.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1839 SDtfs, 6239 SDslu, 1344 SDs, 0 SdLazy, 16678 SolverSat, 3527 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30002occurred in iteration=8, 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: 2.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 9362 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 398 NumberOfFragments, 701 HoareAnnotationTreeSize, 3 FomulaSimplifications, 15220 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 5730 FormulaSimplificationTreeSizeReductionInter, 6.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2829 NumberOfCodeBlocks, 2829 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2817 ConstructedInterpolants, 25 QuantifiedInterpolants, 2068458 SizeOfPredicates, 2 NumberOfNonLiveVariables, 476 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 1820/1946 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...