java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:11:29,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:11:29,048 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:11:29,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:11:29,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:11:29,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:11:29,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:11:29,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:11:29,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:11:29,070 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:11:29,071 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:11:29,071 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:11:29,072 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:11:29,073 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:11:29,074 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:11:29,075 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:11:29,076 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:11:29,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:11:29,080 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:11:29,081 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:11:29,082 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:11:29,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:11:29,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:11:29,089 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:11:29,092 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:11:29,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:11:29,097 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:11:29,097 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:11:29,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:11:29,101 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:11:29,101 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:11:29,102 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:11:29,102 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:11:29,102 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:11:29,105 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:11:29,105 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:11:29,107 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-27 04:11:29,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:11:29,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:11:29,131 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:11:29,131 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:11:29,132 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:11:29,132 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:11:29,132 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 04:11:29,132 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:11:29,132 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 04:11:29,133 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 04:11:29,133 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 04:11:29,133 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:11:29,134 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:11:29,134 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:11:29,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:11:29,134 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 04:11:29,135 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:11:29,135 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 04:11:29,135 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 04:11:29,135 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 04:11:29,135 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:11:29,136 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:11:29,136 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:11:29,136 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:11:29,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:11:29,136 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:11:29,137 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:11:29,137 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 04:11:29,137 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 04:11:29,137 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:11:29,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 04:11:29,138 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 04:11:29,138 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 04:11:29,138 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 04:11:29,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:11:29,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:11:29,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:11:29,218 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:11:29,218 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:11:29,219 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-10-27 04:11:29,291 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2b86f9055/075ddf56b3b6477a87dc309df24314fc/FLAGb571c4666 [2018-10-27 04:11:29,733 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:11:29,734 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-10-27 04:11:29,741 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2b86f9055/075ddf56b3b6477a87dc309df24314fc/FLAGb571c4666 [2018-10-27 04:11:29,755 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2b86f9055/075ddf56b3b6477a87dc309df24314fc [2018-10-27 04:11:29,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:11:29,767 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:11:29,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:11:29,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:11:29,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:11:29,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:11:29" (1/1) ... [2018-10-27 04:11:29,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cab73e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:29, skipping insertion in model container [2018-10-27 04:11:29,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:11:29" (1/1) ... [2018-10-27 04:11:29,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:11:29,808 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:11:29,982 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:11:29,986 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:11:30,011 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:11:30,028 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:11:30,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:30 WrapperNode [2018-10-27 04:11:30,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:11:30,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:11:30,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:11:30,030 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:11:30,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:30" (1/1) ... [2018-10-27 04:11:30,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:30" (1/1) ... [2018-10-27 04:11:30,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:11:30,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:11:30,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:11:30,056 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:11:30,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:30" (1/1) ... [2018-10-27 04:11:30,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:30" (1/1) ... [2018-10-27 04:11:30,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:30" (1/1) ... [2018-10-27 04:11:30,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:30" (1/1) ... [2018-10-27 04:11:30,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:30" (1/1) ... [2018-10-27 04:11:30,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:30" (1/1) ... [2018-10-27 04:11:30,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:30" (1/1) ... [2018-10-27 04:11:30,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:11:30,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:11:30,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:11:30,084 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:11:30,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:11:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:11:30,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:11:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:11:30,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:11:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:11:30,241 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:11:30,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 04:11:30,241 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 04:11:30,761 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:11:30,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:11:30 BoogieIcfgContainer [2018-10-27 04:11:30,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:11:30,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:11:30,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:11:30,766 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:11:30,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:11:29" (1/3) ... [2018-10-27 04:11:30,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4e86cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:11:30, skipping insertion in model container [2018-10-27 04:11:30,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:11:30" (2/3) ... [2018-10-27 04:11:30,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4e86cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:11:30, skipping insertion in model container [2018-10-27 04:11:30,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:11:30" (3/3) ... [2018-10-27 04:11:30,770 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-10-27 04:11:30,780 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:11:30,789 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 04:11:30,807 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 04:11:30,840 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:11:30,841 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 04:11:30,841 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:11:30,841 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:11:30,841 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:11:30,841 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:11:30,841 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:11:30,841 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:11:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-10-27 04:11:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 04:11:30,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:11:30,868 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:11:30,870 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:11:30,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:30,876 INFO L82 PathProgramCache]: Analyzing trace with hash 64061581, now seen corresponding path program 1 times [2018-10-27 04:11:30,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:11:30,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:30,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:30,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:30,925 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:11:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:11:31,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:11:31,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:11:31,013 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:11:31,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 04:11:31,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 04:11:31,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:11:31,037 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-10-27 04:11:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:11:31,070 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-27 04:11:31,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 04:11:31,072 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-10-27 04:11:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:11:31,089 INFO L225 Difference]: With dead ends: 83 [2018-10-27 04:11:31,089 INFO L226 Difference]: Without dead ends: 40 [2018-10-27 04:11:31,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:11:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-27 04:11:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-27 04:11:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 04:11:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2018-10-27 04:11:31,140 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 15 [2018-10-27 04:11:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:11:31,141 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-10-27 04:11:31,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 04:11:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-10-27 04:11:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 04:11:31,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:11:31,143 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:11:31,143 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:11:31,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:31,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1525893932, now seen corresponding path program 1 times [2018-10-27 04:11:31,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:11:31,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:31,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:31,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:31,146 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:11:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:31,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:11:31,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:11:31,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:11:31,330 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:11:31,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:11:31,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:11:31,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:11:31,333 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 6 states. [2018-10-27 04:11:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:11:31,980 INFO L93 Difference]: Finished difference Result 77 states and 114 transitions. [2018-10-27 04:11:31,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:11:31,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-27 04:11:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:11:31,985 INFO L225 Difference]: With dead ends: 77 [2018-10-27 04:11:31,985 INFO L226 Difference]: Without dead ends: 75 [2018-10-27 04:11:31,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:11:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-27 04:11:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-10-27 04:11:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-27 04:11:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2018-10-27 04:11:32,009 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 16 [2018-10-27 04:11:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:11:32,010 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-10-27 04:11:32,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:11:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2018-10-27 04:11:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 04:11:32,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:11:32,011 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:11:32,012 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:11:32,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1513649831, now seen corresponding path program 1 times [2018-10-27 04:11:32,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:11:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:32,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:32,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:32,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:11:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:11:32,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:11:32,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:11:32,223 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:11:32,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:11:32,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:11:32,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:11:32,228 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand 6 states. [2018-10-27 04:11:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:11:32,775 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2018-10-27 04:11:32,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:11:32,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-27 04:11:32,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:11:32,782 INFO L225 Difference]: With dead ends: 121 [2018-10-27 04:11:32,782 INFO L226 Difference]: Without dead ends: 119 [2018-10-27 04:11:32,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:11:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-27 04:11:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-10-27 04:11:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-27 04:11:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2018-10-27 04:11:32,827 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 16 [2018-10-27 04:11:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:11:32,827 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2018-10-27 04:11:32,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:11:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2018-10-27 04:11:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 04:11:32,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:11:32,832 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:11:32,832 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:11:32,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash -492506935, now seen corresponding path program 1 times [2018-10-27 04:11:32,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:11:32,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:32,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:32,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:32,836 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:11:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:11:32,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:11:32,982 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:11:32,983 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-27 04:11:32,985 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109] [2018-10-27 04:11:33,034 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:11:33,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:11:33,175 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:11:33,237 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:11:33,239 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-27 04:11:33,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:33,255 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:11:33,380 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 74.43% of their original sizes. [2018-10-27 04:11:33,381 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:11:33,656 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-10-27 04:11:33,657 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:11:33,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:11:33,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-10-27 04:11:33,658 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:11:33,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:11:33,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:11:33,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:11:33,660 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand 10 states. [2018-10-27 04:11:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:11:37,566 INFO L93 Difference]: Finished difference Result 294 states and 467 transitions. [2018-10-27 04:11:37,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:11:37,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-10-27 04:11:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:11:37,571 INFO L225 Difference]: With dead ends: 294 [2018-10-27 04:11:37,571 INFO L226 Difference]: Without dead ends: 292 [2018-10-27 04:11:37,572 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:11:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-27 04:11:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 249. [2018-10-27 04:11:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-27 04:11:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 398 transitions. [2018-10-27 04:11:37,649 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 398 transitions. Word has length 21 [2018-10-27 04:11:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:11:37,649 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 398 transitions. [2018-10-27 04:11:37,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:11:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 398 transitions. [2018-10-27 04:11:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 04:11:37,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:11:37,651 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:11:37,652 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:11:37,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:37,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1032051649, now seen corresponding path program 1 times [2018-10-27 04:11:37,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:11:37,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:37,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:37,654 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:11:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:11:37,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:11:37,767 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:11:37,768 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-27 04:11:37,768 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [31], [69], [84], [87], [89], [92], [94], [95], [96], [97], [119], [120], [121] [2018-10-27 04:11:37,771 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:11:37,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:11:37,779 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:11:37,793 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:11:37,794 INFO L272 AbstractInterpreter]: Visited 20 different actions 24 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-27 04:11:37,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:37,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:11:37,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:11:37,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:11:37,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:37,840 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:11:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:37,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:11:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:11:38,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:11:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:11:38,844 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:11:38,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 15 [2018-10-27 04:11:38,844 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:11:38,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:11:38,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:11:38,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:11:38,845 INFO L87 Difference]: Start difference. First operand 249 states and 398 transitions. Second operand 5 states. [2018-10-27 04:11:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:11:39,945 INFO L93 Difference]: Finished difference Result 552 states and 895 transitions. [2018-10-27 04:11:39,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:11:39,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-10-27 04:11:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:11:39,954 INFO L225 Difference]: With dead ends: 552 [2018-10-27 04:11:39,954 INFO L226 Difference]: Without dead ends: 388 [2018-10-27 04:11:39,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:11:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-27 04:11:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 297. [2018-10-27 04:11:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-27 04:11:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 477 transitions. [2018-10-27 04:11:40,060 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 477 transitions. Word has length 21 [2018-10-27 04:11:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:11:40,061 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 477 transitions. [2018-10-27 04:11:40,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:11:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 477 transitions. [2018-10-27 04:11:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 04:11:40,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:11:40,063 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:11:40,063 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:11:40,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:40,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1772370613, now seen corresponding path program 1 times [2018-10-27 04:11:40,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:11:40,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:40,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:40,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:40,065 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:11:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:11:40,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:11:40,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:11:40,187 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-27 04:11:40,188 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [13], [17], [23], [27], [33], [49], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109] [2018-10-27 04:11:40,190 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:11:40,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:11:40,196 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:11:40,208 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:11:40,208 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-27 04:11:40,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:40,226 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:11:40,262 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 74.43% of their original sizes. [2018-10-27 04:11:40,262 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:11:40,483 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-10-27 04:11:40,483 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:11:40,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:11:40,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2018-10-27 04:11:40,484 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:11:40,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:11:40,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:11:40,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:11:40,485 INFO L87 Difference]: Start difference. First operand 297 states and 477 transitions. Second operand 9 states. [2018-10-27 04:11:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:11:44,027 INFO L93 Difference]: Finished difference Result 502 states and 796 transitions. [2018-10-27 04:11:44,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:11:44,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-10-27 04:11:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:11:44,030 INFO L225 Difference]: With dead ends: 502 [2018-10-27 04:11:44,031 INFO L226 Difference]: Without dead ends: 397 [2018-10-27 04:11:44,032 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:11:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-27 04:11:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 385. [2018-10-27 04:11:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-27 04:11:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 611 transitions. [2018-10-27 04:11:44,112 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 611 transitions. Word has length 21 [2018-10-27 04:11:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:11:44,112 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 611 transitions. [2018-10-27 04:11:44,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:11:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 611 transitions. [2018-10-27 04:11:44,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:11:44,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:11:44,114 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:11:44,115 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:11:44,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:44,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1278784497, now seen corresponding path program 1 times [2018-10-27 04:11:44,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:11:44,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:44,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:44,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:44,116 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:11:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:11:44,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:11:44,243 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:11:44,243 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-27 04:11:44,243 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111] [2018-10-27 04:11:44,245 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:11:44,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:11:44,250 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:11:44,264 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:11:44,265 INFO L272 AbstractInterpreter]: Visited 23 different actions 31 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-27 04:11:44,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:44,306 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:11:44,340 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 75.64% of their original sizes. [2018-10-27 04:11:44,340 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:11:44,470 INFO L415 sIntCurrentIteration]: We unified 27 AI predicates to 27 [2018-10-27 04:11:44,471 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:11:44,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:11:44,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-10-27 04:11:44,471 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:11:44,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:11:44,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:11:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:11:44,473 INFO L87 Difference]: Start difference. First operand 385 states and 611 transitions. Second operand 12 states. [2018-10-27 04:11:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:11:50,350 INFO L93 Difference]: Finished difference Result 463 states and 731 transitions. [2018-10-27 04:11:50,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 04:11:50,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-27 04:11:50,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:11:50,354 INFO L225 Difference]: With dead ends: 463 [2018-10-27 04:11:50,354 INFO L226 Difference]: Without dead ends: 461 [2018-10-27 04:11:50,355 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2018-10-27 04:11:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-10-27 04:11:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 399. [2018-10-27 04:11:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-27 04:11:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 632 transitions. [2018-10-27 04:11:50,458 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 632 transitions. Word has length 28 [2018-10-27 04:11:50,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:11:50,459 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 632 transitions. [2018-10-27 04:11:50,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:11:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 632 transitions. [2018-10-27 04:11:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:11:50,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:11:50,461 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:11:50,461 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:11:50,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:50,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1497639215, now seen corresponding path program 1 times [2018-10-27 04:11:50,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:11:50,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:50,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:50,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:50,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:11:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 04:11:50,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:11:50,677 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:11:50,678 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-27 04:11:50,678 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [13], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111] [2018-10-27 04:11:50,680 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:11:50,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:11:50,685 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:11:50,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:11:50,698 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-27 04:11:50,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:50,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:11:50,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:11:50,703 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:11:50,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:50,714 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:11:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:50,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:11:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 04:11:50,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:11:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 04:11:50,927 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:11:50,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-10-27 04:11:50,927 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:11:50,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:11:50,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:11:50,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:11:50,928 INFO L87 Difference]: Start difference. First operand 399 states and 632 transitions. Second operand 6 states. [2018-10-27 04:11:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:11:51,625 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2018-10-27 04:11:51,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:11:51,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-10-27 04:11:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:11:51,633 INFO L225 Difference]: With dead ends: 727 [2018-10-27 04:11:51,633 INFO L226 Difference]: Without dead ends: 725 [2018-10-27 04:11:51,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:11:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-10-27 04:11:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 628. [2018-10-27 04:11:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-27 04:11:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1028 transitions. [2018-10-27 04:11:51,768 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1028 transitions. Word has length 28 [2018-10-27 04:11:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:11:51,768 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 1028 transitions. [2018-10-27 04:11:51,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:11:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1028 transitions. [2018-10-27 04:11:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 04:11:51,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:11:51,770 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:11:51,770 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:11:51,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:51,771 INFO L82 PathProgramCache]: Analyzing trace with hash -249410930, now seen corresponding path program 1 times [2018-10-27 04:11:51,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:11:51,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:51,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:51,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:51,772 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:11:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:11:51,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:11:51,990 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:11:51,990 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-27 04:11:51,990 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105] [2018-10-27 04:11:51,992 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:11:51,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:11:51,996 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:11:52,008 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:11:52,008 INFO L272 AbstractInterpreter]: Visited 23 different actions 35 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-27 04:11:52,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:52,044 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:11:52,073 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 77.67% of their original sizes. [2018-10-27 04:11:52,073 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:11:52,705 INFO L415 sIntCurrentIteration]: We unified 30 AI predicates to 30 [2018-10-27 04:11:52,706 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:11:52,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:11:52,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-10-27 04:11:52,706 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:11:52,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:11:52,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:11:52,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:11:52,707 INFO L87 Difference]: Start difference. First operand 628 states and 1028 transitions. Second operand 10 states. [2018-10-27 04:11:55,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:11:55,719 INFO L93 Difference]: Finished difference Result 672 states and 1091 transitions. [2018-10-27 04:11:55,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:11:55,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-10-27 04:11:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:11:55,724 INFO L225 Difference]: With dead ends: 672 [2018-10-27 04:11:55,724 INFO L226 Difference]: Without dead ends: 670 [2018-10-27 04:11:55,725 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:11:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-10-27 04:11:55,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 632. [2018-10-27 04:11:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-10-27 04:11:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1031 transitions. [2018-10-27 04:11:55,849 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1031 transitions. Word has length 31 [2018-10-27 04:11:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:11:55,850 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 1031 transitions. [2018-10-27 04:11:55,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:11:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1031 transitions. [2018-10-27 04:11:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 04:11:55,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:11:55,851 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:11:55,851 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:11:55,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:55,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1125815644, now seen corresponding path program 1 times [2018-10-27 04:11:55,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:11:55,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:55,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:55,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:55,853 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:11:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:11:55,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:11:55,936 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:11:55,936 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-10-27 04:11:55,936 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113] [2018-10-27 04:11:55,939 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:11:55,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:11:55,943 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:11:55,955 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:11:55,956 INFO L272 AbstractInterpreter]: Visited 26 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-27 04:11:55,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:55,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:11:55,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:11:55,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:11:55,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:55,997 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:11:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:11:56,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:11:56,473 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-10-27 04:11:56,785 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-27 04:11:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:11:56,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:11:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:11:57,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:11:57,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 19 [2018-10-27 04:11:57,001 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:11:57,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 04:11:57,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 04:11:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-10-27 04:11:57,003 INFO L87 Difference]: Start difference. First operand 632 states and 1031 transitions. Second operand 14 states. [2018-10-27 04:11:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:11:59,198 INFO L93 Difference]: Finished difference Result 981 states and 1602 transitions. [2018-10-27 04:11:59,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:11:59,205 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-10-27 04:11:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:11:59,213 INFO L225 Difference]: With dead ends: 981 [2018-10-27 04:11:59,213 INFO L226 Difference]: Without dead ends: 979 [2018-10-27 04:11:59,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-10-27 04:11:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-10-27 04:11:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 893. [2018-10-27 04:11:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-10-27 04:11:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1461 transitions. [2018-10-27 04:11:59,456 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1461 transitions. Word has length 33 [2018-10-27 04:11:59,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:11:59,457 INFO L481 AbstractCegarLoop]: Abstraction has 893 states and 1461 transitions. [2018-10-27 04:11:59,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 04:11:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1461 transitions. [2018-10-27 04:11:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 04:11:59,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:11:59,458 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:11:59,459 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:11:59,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:11:59,459 INFO L82 PathProgramCache]: Analyzing trace with hash 797412390, now seen corresponding path program 1 times [2018-10-27 04:11:59,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:11:59,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:59,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:11:59,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:11:59,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:11:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:12:00,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:00,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:00,076 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-10-27 04:12:00,076 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [13], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113] [2018-10-27 04:12:00,078 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:12:00,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:12:00,082 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:12:00,099 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:12:00,099 INFO L272 AbstractInterpreter]: Visited 26 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-27 04:12:00,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:00,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:12:00,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:00,112 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:12:00,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:00,122 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:12:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:00,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:12:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 04:12:00,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:12:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 04:12:00,548 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:12:00,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [9] total 17 [2018-10-27 04:12:00,548 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:12:00,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:12:00,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:12:00,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:12:00,549 INFO L87 Difference]: Start difference. First operand 893 states and 1461 transitions. Second operand 8 states. [2018-10-27 04:12:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:01,182 INFO L93 Difference]: Finished difference Result 953 states and 1541 transitions. [2018-10-27 04:12:01,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:12:01,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-10-27 04:12:01,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:01,194 INFO L225 Difference]: With dead ends: 953 [2018-10-27 04:12:01,194 INFO L226 Difference]: Without dead ends: 951 [2018-10-27 04:12:01,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:12:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-10-27 04:12:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 899. [2018-10-27 04:12:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-27 04:12:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1459 transitions. [2018-10-27 04:12:01,416 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1459 transitions. Word has length 33 [2018-10-27 04:12:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:01,417 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 1459 transitions. [2018-10-27 04:12:01,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:12:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1459 transitions. [2018-10-27 04:12:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 04:12:01,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:12:01,419 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:12:01,419 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:12:01,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502379, now seen corresponding path program 1 times [2018-10-27 04:12:01,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:12:01,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:01,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:01,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:01,420 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:12:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 04:12:01,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:01,926 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:01,927 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-10-27 04:12:01,927 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109] [2018-10-27 04:12:01,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:12:01,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:12:01,937 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:12:01,957 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:12:01,958 INFO L272 AbstractInterpreter]: Visited 29 different actions 49 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-27 04:12:01,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:01,966 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:12:02,003 INFO L227 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 79.08% of their original sizes. [2018-10-27 04:12:02,004 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:12:02,208 INFO L415 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-10-27 04:12:02,208 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:12:02,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:12:02,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2018-10-27 04:12:02,209 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:12:02,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:12:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:12:02,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:12:02,209 INFO L87 Difference]: Start difference. First operand 899 states and 1459 transitions. Second operand 12 states. [2018-10-27 04:12:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:06,018 INFO L93 Difference]: Finished difference Result 984 states and 1581 transitions. [2018-10-27 04:12:06,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 04:12:06,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-10-27 04:12:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:06,025 INFO L225 Difference]: With dead ends: 984 [2018-10-27 04:12:06,025 INFO L226 Difference]: Without dead ends: 982 [2018-10-27 04:12:06,026 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-10-27 04:12:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2018-10-27 04:12:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 888. [2018-10-27 04:12:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-10-27 04:12:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1427 transitions. [2018-10-27 04:12:06,236 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1427 transitions. Word has length 43 [2018-10-27 04:12:06,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:06,236 INFO L481 AbstractCegarLoop]: Abstraction has 888 states and 1427 transitions. [2018-10-27 04:12:06,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:12:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1427 transitions. [2018-10-27 04:12:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-27 04:12:06,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:12:06,238 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:12:06,238 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:12:06,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:06,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1887033901, now seen corresponding path program 1 times [2018-10-27 04:12:06,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:12:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:06,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:06,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:06,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:12:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 04:12:06,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:06,529 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:06,529 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-10-27 04:12:06,529 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [13], [17], [23], [27], [33], [36], [41], [44], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109] [2018-10-27 04:12:06,531 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:12:06,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:12:06,535 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:12:06,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:12:06,547 INFO L272 AbstractInterpreter]: Visited 30 different actions 52 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-27 04:12:06,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:06,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:12:06,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:06,568 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:12:06,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:06,614 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:12:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:06,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:12:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-27 04:12:06,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:12:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 04:12:06,815 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:12:06,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 11 [2018-10-27 04:12:06,816 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:12:06,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:12:06,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:12:06,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:12:06,817 INFO L87 Difference]: Start difference. First operand 888 states and 1427 transitions. Second operand 4 states. [2018-10-27 04:12:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:06,967 INFO L93 Difference]: Finished difference Result 1039 states and 1656 transitions. [2018-10-27 04:12:06,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:12:06,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-10-27 04:12:06,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:06,973 INFO L225 Difference]: With dead ends: 1039 [2018-10-27 04:12:06,973 INFO L226 Difference]: Without dead ends: 680 [2018-10-27 04:12:06,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:12:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-10-27 04:12:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2018-10-27 04:12:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-27 04:12:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1076 transitions. [2018-10-27 04:12:07,123 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1076 transitions. Word has length 43 [2018-10-27 04:12:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:07,123 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 1076 transitions. [2018-10-27 04:12:07,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:12:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1076 transitions. [2018-10-27 04:12:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 04:12:07,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:12:07,124 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:12:07,124 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:12:07,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1269153316, now seen corresponding path program 1 times [2018-10-27 04:12:07,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:12:07,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:07,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:07,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:07,126 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:12:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 04:12:07,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:07,247 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:07,247 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-10-27 04:12:07,248 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [49], [53], [56], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [99], [107], [108], [109], [110], [119], [120], [121], [122] [2018-10-27 04:12:07,250 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:12:07,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:12:07,253 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:12:07,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:12:07,267 INFO L272 AbstractInterpreter]: Visited 31 different actions 47 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-10-27 04:12:07,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:07,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:12:07,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:07,273 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:12:07,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:07,280 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:12:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:07,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:12:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:12:07,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:12:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:12:07,453 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:12:07,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 11 [2018-10-27 04:12:07,454 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:12:07,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:12:07,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:12:07,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:12:07,455 INFO L87 Difference]: Start difference. First operand 680 states and 1076 transitions. Second operand 7 states. [2018-10-27 04:12:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:07,819 INFO L93 Difference]: Finished difference Result 690 states and 1084 transitions. [2018-10-27 04:12:07,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:12:07,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-10-27 04:12:07,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:07,829 INFO L225 Difference]: With dead ends: 690 [2018-10-27 04:12:07,829 INFO L226 Difference]: Without dead ends: 688 [2018-10-27 04:12:07,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:12:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-27 04:12:07,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 682. [2018-10-27 04:12:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-10-27 04:12:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1075 transitions. [2018-10-27 04:12:07,986 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1075 transitions. Word has length 45 [2018-10-27 04:12:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:07,986 INFO L481 AbstractCegarLoop]: Abstraction has 682 states and 1075 transitions. [2018-10-27 04:12:07,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:12:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1075 transitions. [2018-10-27 04:12:07,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-27 04:12:07,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:12:07,987 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:12:07,987 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:12:07,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash -893792404, now seen corresponding path program 1 times [2018-10-27 04:12:07,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:12:07,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:07,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:07,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:07,992 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:12:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-27 04:12:08,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:08,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:08,105 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-10-27 04:12:08,106 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [56], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [119], [120], [121], [122] [2018-10-27 04:12:08,107 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:12:08,107 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:12:08,111 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:12:08,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:12:08,123 INFO L272 AbstractInterpreter]: Visited 29 different actions 41 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-10-27 04:12:08,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:08,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:12:08,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:08,126 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:12:08,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:08,134 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:12:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:08,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:12:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 04:12:08,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:12:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 04:12:08,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:12:08,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2018-10-27 04:12:08,397 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:12:08,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:12:08,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:12:08,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:12:08,404 INFO L87 Difference]: Start difference. First operand 682 states and 1075 transitions. Second operand 11 states. [2018-10-27 04:12:09,530 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-27 04:12:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:11,102 INFO L93 Difference]: Finished difference Result 1359 states and 2199 transitions. [2018-10-27 04:12:11,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 04:12:11,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-10-27 04:12:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:11,110 INFO L225 Difference]: With dead ends: 1359 [2018-10-27 04:12:11,110 INFO L226 Difference]: Without dead ends: 1035 [2018-10-27 04:12:11,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-10-27 04:12:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-10-27 04:12:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 806. [2018-10-27 04:12:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-27 04:12:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1291 transitions. [2018-10-27 04:12:11,304 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1291 transitions. Word has length 50 [2018-10-27 04:12:11,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:11,304 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1291 transitions. [2018-10-27 04:12:11,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:12:11,305 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1291 transitions. [2018-10-27 04:12:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 04:12:11,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:12:11,306 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:12:11,306 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:12:11,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:11,307 INFO L82 PathProgramCache]: Analyzing trace with hash -254314127, now seen corresponding path program 1 times [2018-10-27 04:12:11,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:12:11,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:11,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:11,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:11,308 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:12:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-27 04:12:11,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:11,489 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:11,489 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-10-27 04:12:11,489 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [49], [53], [56], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [107], [108], [109], [110], [119], [120], [121], [122] [2018-10-27 04:12:11,491 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:12:11,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:12:11,495 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:12:11,512 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:12:11,512 INFO L272 AbstractInterpreter]: Visited 37 different actions 65 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-10-27 04:12:11,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:11,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:12:11,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:11,520 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:12:11,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:11,528 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:12:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:11,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:12:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-27 04:12:11,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:12:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-27 04:12:11,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:12:11,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2018-10-27 04:12:11,901 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:12:11,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 04:12:11,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 04:12:11,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-10-27 04:12:11,902 INFO L87 Difference]: Start difference. First operand 806 states and 1291 transitions. Second operand 14 states. [2018-10-27 04:12:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:13,800 INFO L93 Difference]: Finished difference Result 1054 states and 1688 transitions. [2018-10-27 04:12:13,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:12:13,800 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-10-27 04:12:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:13,806 INFO L225 Difference]: With dead ends: 1054 [2018-10-27 04:12:13,806 INFO L226 Difference]: Without dead ends: 1052 [2018-10-27 04:12:13,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2018-10-27 04:12:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-10-27 04:12:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 824. [2018-10-27 04:12:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2018-10-27 04:12:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1317 transitions. [2018-10-27 04:12:13,997 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1317 transitions. Word has length 60 [2018-10-27 04:12:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:13,997 INFO L481 AbstractCegarLoop]: Abstraction has 824 states and 1317 transitions. [2018-10-27 04:12:13,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 04:12:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1317 transitions. [2018-10-27 04:12:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 04:12:13,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:12:13,999 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:12:13,999 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:12:13,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1004327087, now seen corresponding path program 1 times [2018-10-27 04:12:14,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:12:14,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:14,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:14,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:14,001 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:12:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-27 04:12:14,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:14,460 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:14,461 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-10-27 04:12:14,461 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [49], [53], [56], [74], [77], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [107], [108], [109], [110], [123], [124], [125], [126] [2018-10-27 04:12:14,462 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:12:14,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:12:14,466 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:12:14,587 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:12:14,587 INFO L272 AbstractInterpreter]: Visited 36 different actions 406 times. Merged at 17 different actions 102 times. Widened at 2 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-10-27 04:12:14,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:14,614 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:12:14,666 INFO L227 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 76.37% of their original sizes. [2018-10-27 04:12:14,666 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:12:15,002 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-10-27 04:12:15,003 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:12:15,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:12:15,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [8] total 22 [2018-10-27 04:12:15,003 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:12:15,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:12:15,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:12:15,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:12:15,004 INFO L87 Difference]: Start difference. First operand 824 states and 1317 transitions. Second operand 16 states. [2018-10-27 04:12:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:23,176 INFO L93 Difference]: Finished difference Result 1475 states and 2366 transitions. [2018-10-27 04:12:23,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-27 04:12:23,176 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-10-27 04:12:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:23,181 INFO L225 Difference]: With dead ends: 1475 [2018-10-27 04:12:23,181 INFO L226 Difference]: Without dead ends: 1052 [2018-10-27 04:12:23,184 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=478, Invalid=1684, Unknown=0, NotChecked=0, Total=2162 [2018-10-27 04:12:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-10-27 04:12:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 966. [2018-10-27 04:12:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-10-27 04:12:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1544 transitions. [2018-10-27 04:12:23,407 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1544 transitions. Word has length 60 [2018-10-27 04:12:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:23,408 INFO L481 AbstractCegarLoop]: Abstraction has 966 states and 1544 transitions. [2018-10-27 04:12:23,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:12:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1544 transitions. [2018-10-27 04:12:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-27 04:12:23,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:12:23,410 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:12:23,410 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:12:23,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash -283854137, now seen corresponding path program 1 times [2018-10-27 04:12:23,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:12:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:23,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:23,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:12:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-27 04:12:23,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:23,465 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:23,465 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-10-27 04:12:23,465 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [58], [63], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118] [2018-10-27 04:12:23,467 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:12:23,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:12:23,470 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:12:23,498 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:12:23,498 INFO L272 AbstractInterpreter]: Visited 32 different actions 95 times. Merged at 12 different actions 12 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 14 variables. [2018-10-27 04:12:23,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:23,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:12:23,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:23,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:12:23,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:23,539 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:12:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:23,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:12:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-27 04:12:23,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:12:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-27 04:12:23,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:12:23,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2018-10-27 04:12:23,744 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:12:23,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:12:23,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:12:23,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:12:23,745 INFO L87 Difference]: Start difference. First operand 966 states and 1544 transitions. Second operand 6 states. [2018-10-27 04:12:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:24,339 INFO L93 Difference]: Finished difference Result 1860 states and 2967 transitions. [2018-10-27 04:12:24,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:12:24,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-10-27 04:12:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:24,344 INFO L225 Difference]: With dead ends: 1860 [2018-10-27 04:12:24,344 INFO L226 Difference]: Without dead ends: 971 [2018-10-27 04:12:24,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:12:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-10-27 04:12:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 914. [2018-10-27 04:12:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-10-27 04:12:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1448 transitions. [2018-10-27 04:12:24,585 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1448 transitions. Word has length 69 [2018-10-27 04:12:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:24,585 INFO L481 AbstractCegarLoop]: Abstraction has 914 states and 1448 transitions. [2018-10-27 04:12:24,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:12:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1448 transitions. [2018-10-27 04:12:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-27 04:12:24,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:12:24,587 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:12:24,587 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:12:24,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1790518670, now seen corresponding path program 1 times [2018-10-27 04:12:24,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:12:24,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:24,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:24,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:24,589 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:12:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-27 04:12:24,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:24,944 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:24,944 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-10-27 04:12:24,944 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [49], [53], [56], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [119], [120], [121], [122] [2018-10-27 04:12:24,945 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:12:24,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:12:24,948 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:12:24,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:12:24,973 INFO L272 AbstractInterpreter]: Visited 40 different actions 97 times. Merged at 8 different actions 8 times. Never widened. Found 2 fixpoints after 1 different actions. Largest state had 16 variables. [2018-10-27 04:12:24,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:24,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:12:24,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:24,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:12:24,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:24,988 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:12:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:25,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:12:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-27 04:12:25,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:12:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-27 04:12:25,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:12:25,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2018-10-27 04:12:25,572 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:12:25,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:12:25,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:12:25,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=353, Unknown=1, NotChecked=0, Total=420 [2018-10-27 04:12:25,573 INFO L87 Difference]: Start difference. First operand 914 states and 1448 transitions. Second operand 16 states. [2018-10-27 04:12:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:28,213 INFO L93 Difference]: Finished difference Result 1323 states and 2089 transitions. [2018-10-27 04:12:28,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 04:12:28,214 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-10-27 04:12:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:28,221 INFO L225 Difference]: With dead ends: 1323 [2018-10-27 04:12:28,221 INFO L226 Difference]: Without dead ends: 1321 [2018-10-27 04:12:28,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=258, Invalid=931, Unknown=1, NotChecked=0, Total=1190 [2018-10-27 04:12:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2018-10-27 04:12:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1054. [2018-10-27 04:12:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-10-27 04:12:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1685 transitions. [2018-10-27 04:12:28,528 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1685 transitions. Word has length 72 [2018-10-27 04:12:28,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:28,528 INFO L481 AbstractCegarLoop]: Abstraction has 1054 states and 1685 transitions. [2018-10-27 04:12:28,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:12:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1685 transitions. [2018-10-27 04:12:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-27 04:12:28,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:12:28,530 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:12:28,530 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:12:28,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:28,530 INFO L82 PathProgramCache]: Analyzing trace with hash -71103634, now seen corresponding path program 1 times [2018-10-27 04:12:28,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:12:28,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:28,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:28,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:28,532 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:12:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-27 04:12:28,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:28,752 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:28,752 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-10-27 04:12:28,752 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [49], [53], [56], [74], [77], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [123], [124], [125], [126] [2018-10-27 04:12:28,753 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:12:28,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:12:28,755 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:12:28,910 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 04:12:28,910 INFO L272 AbstractInterpreter]: Visited 39 different actions 481 times. Merged at 20 different actions 129 times. Widened at 2 different actions 3 times. Found 7 fixpoints after 4 different actions. Largest state had 16 variables. [2018-10-27 04:12:28,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:28,949 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 04:12:29,012 INFO L227 lantSequenceWeakener]: Weakened 56 states. On average, predicates are now at 77.38% of their original sizes. [2018-10-27 04:12:29,012 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 04:12:29,314 INFO L415 sIntCurrentIteration]: We unified 71 AI predicates to 71 [2018-10-27 04:12:29,315 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 04:12:29,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:12:29,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [9] total 25 [2018-10-27 04:12:29,315 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:12:29,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 04:12:29,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 04:12:29,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:12:29,317 INFO L87 Difference]: Start difference. First operand 1054 states and 1685 transitions. Second operand 18 states. [2018-10-27 04:12:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:40,301 INFO L93 Difference]: Finished difference Result 1759 states and 2796 transitions. [2018-10-27 04:12:40,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-27 04:12:40,301 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2018-10-27 04:12:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:40,307 INFO L225 Difference]: With dead ends: 1759 [2018-10-27 04:12:40,307 INFO L226 Difference]: Without dead ends: 1270 [2018-10-27 04:12:40,311 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=707, Invalid=2599, Unknown=0, NotChecked=0, Total=3306 [2018-10-27 04:12:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-10-27 04:12:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1066. [2018-10-27 04:12:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2018-10-27 04:12:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1694 transitions. [2018-10-27 04:12:40,668 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1694 transitions. Word has length 72 [2018-10-27 04:12:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:40,668 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1694 transitions. [2018-10-27 04:12:40,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 04:12:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1694 transitions. [2018-10-27 04:12:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-27 04:12:40,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:12:40,671 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:12:40,671 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:12:40,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:40,671 INFO L82 PathProgramCache]: Analyzing trace with hash -217479284, now seen corresponding path program 1 times [2018-10-27 04:12:40,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:12:40,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:40,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:40,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:40,672 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:12:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-27 04:12:40,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:40,829 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:40,829 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-10-27 04:12:40,829 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [49], [53], [56], [58], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [119], [120], [121], [122] [2018-10-27 04:12:40,830 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:12:40,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:12:40,833 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:12:40,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:12:40,857 INFO L272 AbstractInterpreter]: Visited 42 different actions 109 times. Merged at 9 different actions 9 times. Never widened. Found 2 fixpoints after 1 different actions. Largest state had 16 variables. [2018-10-27 04:12:40,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:40,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:12:40,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:40,858 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:12:40,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:40,866 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:12:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:40,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:12:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-10-27 04:12:40,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:12:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-10-27 04:12:40,998 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:12:40,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 10 [2018-10-27 04:12:40,998 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:12:40,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:12:40,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:12:40,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:12:40,999 INFO L87 Difference]: Start difference. First operand 1066 states and 1694 transitions. Second operand 7 states. [2018-10-27 04:12:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:41,483 INFO L93 Difference]: Finished difference Result 1166 states and 1830 transitions. [2018-10-27 04:12:41,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:12:41,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-10-27 04:12:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:41,490 INFO L225 Difference]: With dead ends: 1166 [2018-10-27 04:12:41,491 INFO L226 Difference]: Without dead ends: 1164 [2018-10-27 04:12:41,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:12:41,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-10-27 04:12:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1086. [2018-10-27 04:12:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-10-27 04:12:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1709 transitions. [2018-10-27 04:12:41,825 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1709 transitions. Word has length 79 [2018-10-27 04:12:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:41,825 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1709 transitions. [2018-10-27 04:12:41,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:12:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1709 transitions. [2018-10-27 04:12:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-27 04:12:41,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:12:41,828 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:12:41,828 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:12:41,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:41,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1211133516, now seen corresponding path program 1 times [2018-10-27 04:12:41,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:12:41,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:41,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:41,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:41,829 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:12:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 35 proven. 57 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-10-27 04:12:41,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:41,941 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:41,941 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 87 with the following transitions: [2018-10-27 04:12:41,941 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [49], [53], [58], [63], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118] [2018-10-27 04:12:41,942 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:12:41,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:12:41,944 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:12:42,019 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:12:42,019 INFO L272 AbstractInterpreter]: Visited 43 different actions 339 times. Merged at 19 different actions 63 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 15 variables. [2018-10-27 04:12:42,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:42,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:12:42,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:42,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:12:42,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:42,031 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:12:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:42,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:12:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-27 04:12:42,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:12:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-27 04:12:42,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:12:42,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2018-10-27 04:12:42,266 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:12:42,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:12:42,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:12:42,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:12:42,267 INFO L87 Difference]: Start difference. First operand 1086 states and 1709 transitions. Second operand 13 states. [2018-10-27 04:12:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:43,998 INFO L93 Difference]: Finished difference Result 1851 states and 3014 transitions. [2018-10-27 04:12:44,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 04:12:44,000 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-10-27 04:12:44,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:44,012 INFO L225 Difference]: With dead ends: 1851 [2018-10-27 04:12:44,012 INFO L226 Difference]: Without dead ends: 1849 [2018-10-27 04:12:44,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-10-27 04:12:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2018-10-27 04:12:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1098. [2018-10-27 04:12:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2018-10-27 04:12:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1718 transitions. [2018-10-27 04:12:44,339 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1718 transitions. Word has length 86 [2018-10-27 04:12:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:44,339 INFO L481 AbstractCegarLoop]: Abstraction has 1098 states and 1718 transitions. [2018-10-27 04:12:44,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:12:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1718 transitions. [2018-10-27 04:12:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 04:12:44,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:12:44,342 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 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] [2018-10-27 04:12:44,342 INFO L424 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:12:44,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:12:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1543835351, now seen corresponding path program 2 times [2018-10-27 04:12:44,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:12:44,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:44,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:12:44,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:12:44,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:12:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:12:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-10-27 04:12:45,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:45,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:12:45,050 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:12:45,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:12:45,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:12:45,051 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:12:45,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:12:45,059 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:12:45,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 04:12:45,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:12:45,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:12:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-10-27 04:12:45,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:12:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-10-27 04:12:45,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:12:45,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2018-10-27 04:12:45,316 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:12:45,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 04:12:45,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 04:12:45,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:12:45,317 INFO L87 Difference]: Start difference. First operand 1098 states and 1718 transitions. Second operand 14 states. [2018-10-27 04:12:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:12:46,345 INFO L93 Difference]: Finished difference Result 1238 states and 1922 transitions. [2018-10-27 04:12:46,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:12:46,346 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2018-10-27 04:12:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:12:46,346 INFO L225 Difference]: With dead ends: 1238 [2018-10-27 04:12:46,346 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 04:12:46,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-10-27 04:12:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 04:12:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 04:12:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 04:12:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 04:12:46,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2018-10-27 04:12:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:12:46,356 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 04:12:46,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 04:12:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 04:12:46,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 04:12:46,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 04:12:46,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:46,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:47,609 WARN L179 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 460 DAG size of output: 288 [2018-10-27 04:12:48,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:48,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:48,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:48,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:49,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:49,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:49,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:49,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,011 WARN L179 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 457 DAG size of output: 426 [2018-10-27 04:12:50,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,786 WARN L179 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 460 DAG size of output: 288 [2018-10-27 04:12:50,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:50,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:51,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,529 WARN L179 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 462 DAG size of output: 438 [2018-10-27 04:12:52,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,735 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 227 [2018-10-27 04:12:52,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:52,942 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 226 [2018-10-27 04:12:53,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:53,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,120 WARN L179 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 541 DAG size of output: 373 [2018-10-27 04:12:54,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,291 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 227 [2018-10-27 04:12:54,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:54,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:55,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:55,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:55,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:55,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:55,148 WARN L179 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 463 DAG size of output: 286 [2018-10-27 04:12:55,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:55,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:55,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:55,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:55,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:55,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:56,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:56,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:56,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:56,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:56,851 WARN L179 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 484 DAG size of output: 431 [2018-10-27 04:12:56,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:56,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:56,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:56,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:56,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:56,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,013 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 225 [2018-10-27 04:12:57,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:57,862 WARN L179 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 632 DAG size of output: 455 [2018-10-27 04:12:57,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:58,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:58,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:58,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:58,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:58,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:58,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:58,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:58,974 WARN L179 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 521 DAG size of output: 479 [2018-10-27 04:12:58,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:12:59,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,234 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 728 DAG size of output: 545 [2018-10-27 04:13:00,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 04:13:00,730 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 266 [2018-10-27 04:13:03,906 WARN L179 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 269 DAG size of output: 69 [2018-10-27 04:13:11,985 WARN L179 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 424 DAG size of output: 75 [2018-10-27 04:13:14,636 WARN L179 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 269 DAG size of output: 69 [2018-10-27 04:13:20,590 WARN L179 SmtUtils]: Spent 5.95 s on a formula simplification. DAG size of input: 435 DAG size of output: 91 [2018-10-27 04:13:22,963 WARN L179 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 221 DAG size of output: 61 [2018-10-27 04:13:25,311 WARN L179 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 220 DAG size of output: 61 [2018-10-27 04:13:28,758 WARN L179 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 350 DAG size of output: 68 [2018-10-27 04:13:31,130 WARN L179 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 221 DAG size of output: 61 [2018-10-27 04:13:33,748 WARN L179 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 268 DAG size of output: 69 [2018-10-27 04:13:38,403 WARN L179 SmtUtils]: Spent 4.65 s on a formula simplification. DAG size of input: 421 DAG size of output: 70 [2018-10-27 04:13:40,762 WARN L179 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 219 DAG size of output: 61 [2018-10-27 04:13:45,917 WARN L179 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 423 DAG size of output: 71 [2018-10-27 04:13:51,959 WARN L179 SmtUtils]: Spent 6.04 s on a formula simplification. DAG size of input: 470 DAG size of output: 83 [2018-10-27 04:13:58,103 WARN L179 SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 508 DAG size of output: 59 [2018-10-27 04:14:01,148 WARN L179 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 254 DAG size of output: 81 [2018-10-27 04:14:01,152 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 04:14:01,152 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 04:14:01,152 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 04:14:01,152 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 04:14:01,153 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 04:14:01,153 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 04:14:01,153 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~i~0)))) (.cse2 (= (mod main_~j~0 2) 0)) (.cse1 (<= .cse11 main_~n~0)) (.cse3 (<= main_~r~0 main_~n~0)) (.cse4 (<= main_~n~0 main_~r~0)) (.cse9 (<= .cse11 main_~r~0)) (.cse12 (exists ((main_~l~0 Int)) (and (<= main_~l~0 main_~i~0) (<= main_~j~0 (* 2 main_~l~0))))) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse13 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse6 (<= (+ main_~j~0 1) main_~n~0)) (.cse10 (<= (+ main_~r~0 1) main_~n~0)) (.cse7 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse8 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse2 .cse5 .cse6 .cse10 .cse7 .cse8) (and (<= 1 main_~l~0) (<= (* 2 main_~n~0) 4294967294) .cse6 .cse9 (<= 1 main_~i~0) .cse3 (<= (+ .cse11 2) main_~n~0) .cse5) (and (<= .cse11 main_~j~0) .cse12 .cse3 .cse5 .cse6 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse7 .cse8) (and .cse12 .cse1 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse12 .cse5 .cse13 .cse6 .cse10 .cse7 .cse8)))) [2018-10-27 04:14:01,153 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2018-10-27 04:14:01,153 INFO L421 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (let ((.cse10 (* 2 main_~l~0))) (let ((.cse2 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse4 (< 0 main_~l~0)) (.cse6 (<= 1 main_~l~0)) (.cse9 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse7 (<= (* 2 main_~n~0) 4294967294)) (.cse3 (<= main_~j~0 main_~n~0)) (.cse8 (<= .cse10 main_~r~0)) (.cse0 (<= 1 main_~i~0)) (.cse1 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53))))) (or (and (and .cse0 (and .cse1 (<= main_~n~0 main_~r~0) .cse2 (and .cse3 (<= main_~l~0 (div main_~n~0 2)) .cse4))) .cse5) (and (and .cse0 (and (and .cse6 .cse7 .cse3 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25)))) .cse1)) .cse5) (and (and .cse3 .cse8 .cse0 .cse9 (<= (+ main_~r~0 1) main_~n~0) .cse2 .cse4) .cse5) (and (and .cse6 .cse9 .cse7 .cse3 .cse8 .cse0 .cse1 (<= (+ .cse10 2) main_~n~0)) .cse5)))) [2018-10-27 04:14:01,153 INFO L421 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~i~0)))) (.cse2 (= (mod main_~j~0 2) 0)) (.cse1 (<= .cse11 main_~n~0)) (.cse3 (<= main_~r~0 main_~n~0)) (.cse4 (<= main_~n~0 main_~r~0)) (.cse9 (<= .cse11 main_~r~0)) (.cse12 (exists ((main_~l~0 Int)) (and (<= main_~l~0 main_~i~0) (<= main_~j~0 (* 2 main_~l~0))))) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse13 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse6 (<= (+ main_~j~0 1) main_~n~0)) (.cse10 (<= (+ main_~r~0 1) main_~n~0)) (.cse7 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse8 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse2 .cse5 .cse6 .cse10 .cse7 .cse8) (and (<= 1 main_~l~0) (<= (* 2 main_~n~0) 4294967294) .cse6 .cse9 (<= 1 main_~i~0) .cse3 (<= (+ .cse11 2) main_~n~0) .cse5) (and (<= .cse11 main_~j~0) .cse12 .cse3 .cse5 .cse6 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse7 .cse8) (and .cse12 .cse1 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse12 .cse5 .cse13 .cse6 .cse10 .cse7 .cse8)))) [2018-10-27 04:14:01,154 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 44) no Hoare annotation was computed. [2018-10-27 04:14:01,155 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 44) the Hoare annotation is: (let ((.cse6 (* 2 main_~l~0)) (.cse10 (* 2 main_~n~0))) (let ((.cse0 (<= 1 main_~l~0)) (.cse2 (<= .cse10 4294967294)) (.cse13 (<= 2 main_~r~0)) (.cse8 (<= .cse6 main_~j~0)) (.cse16 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~i~0)))) (.cse3 (<= .cse6 main_~r~0)) (.cse9 (exists ((main_~l~0 Int)) (and (<= main_~l~0 main_~i~0) (<= main_~j~0 (* 2 main_~l~0))))) (.cse7 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse22 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse11 (<= (+ main_~r~0 1) main_~n~0)) (.cse1 (<= main_~i~0 main_~n~0)) (.cse5 (<= main_~r~0 main_~n~0)) (.cse15 (<= (* 2 main_~j~0) 4294967296)) (.cse4 (<= 1 main_~i~0)) (.cse17 (<= .cse6 main_~n~0)) (.cse18 (= (mod main_~j~0 2) 0)) (.cse19 (<= main_~n~0 main_~r~0)) (.cse21 (exists ((v_main_~j~0_39 Int) (main_~l~0 Int)) (and (<= main_~r~0 v_main_~j~0_39) (<= (* 2 v_main_~j~0_39) main_~j~0) (<= 1 main_~l~0) (<= (* 2 main_~l~0) v_main_~j~0_39)))) (.cse20 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse12 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ .cse6 2) main_~n~0) .cse7) (and .cse8 .cse9 (<= main_~i~0 (div main_~n~0 2)) (<= .cse10 2000000) .cse7 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse9 .cse8 (exists ((main_~l~0 Int)) (let ((.cse14 (* 2 main_~l~0))) (and (<= (+ .cse14 2) main_~n~0) (<= main_~j~0 .cse14)))) .cse5 .cse13 .cse7) (and .cse15 .cse16 .cse17 .cse18 .cse5 .cse19 .cse7 .cse1 .cse20 .cse12) (and .cse8 .cse9 .cse5 .cse7 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse20 .cse12) (and (and .cse18 .cse15 .cse3 .cse4 .cse21 .cse11 .cse20 .cse12) .cse1 .cse7) (and .cse15 .cse3 .cse16 .cse18 .cse7 .cse1 .cse11 .cse20 .cse12) (and .cse9 .cse17 .cse5 .cse19 .cse7 .cse1 .cse22 .cse20 .cse12) (and .cse3 .cse9 .cse7 .cse1 .cse22 .cse11 .cse20 .cse12) (and .cse1 .cse5 (and .cse15 .cse4 .cse17 .cse18 .cse19 .cse21 .cse20 .cse12))))) [2018-10-27 04:14:01,155 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 21 54) no Hoare annotation was computed. [2018-10-27 04:14:01,155 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-10-27 04:14:01,156 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2018-10-27 04:14:01,156 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-10-27 04:14:01,156 INFO L421 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (<= 1 main_~l~0)) (.cse7 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse1 (<= (* 2 main_~n~0) 4294967294)) (.cse8 (<= (+ main_~r~0 1) main_~n~0)) (.cse6 (<= .cse11 main_~r~0)) (.cse3 (<= 1 main_~i~0)) (.cse2 (<= main_~j~0 main_~n~0)) (.cse12 (<= 2 (* 2 main_~i~0))) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse9 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse10 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25))) .cse5) (and .cse2 (and .cse6 .cse3 .cse7 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse8 .cse9 .cse10) .cse5) (and .cse2 (and .cse0 .cse7 .cse1 .cse8 .cse6 .cse3 (<= (+ .cse11 2) main_~n~0)) .cse5) (and .cse2 (<= .cse11 main_~n~0) .cse12 .cse4 (<= main_~n~0 main_~r~0) .cse5 (<= 6 (* 2 main_~j~0)) .cse9 .cse10) (and (<= .cse11 main_~j~0) .cse12 .cse4 .cse5 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse9 .cse10)))) [2018-10-27 04:14:01,156 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-27 04:14:01,156 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2018-10-27 04:14:01,156 INFO L421 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (<= 1 main_~l~0)) (.cse7 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse1 (<= (* 2 main_~n~0) 4294967294)) (.cse8 (<= (+ main_~r~0 1) main_~n~0)) (.cse6 (<= .cse11 main_~r~0)) (.cse3 (<= 1 main_~i~0)) (.cse2 (<= main_~j~0 main_~n~0)) (.cse12 (<= 2 (* 2 main_~i~0))) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse9 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse10 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25))) .cse5) (and .cse2 (and .cse6 .cse3 .cse7 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse8 .cse9 .cse10) .cse5) (and .cse2 (and .cse0 .cse7 .cse1 .cse8 .cse6 .cse3 (<= (+ .cse11 2) main_~n~0)) .cse5) (and .cse2 (<= .cse11 main_~n~0) .cse12 .cse4 (<= main_~n~0 main_~r~0) .cse5 (<= 6 (* 2 main_~j~0)) .cse9 .cse10) (and (<= .cse11 main_~j~0) .cse12 .cse4 .cse5 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse9 .cse10)))) [2018-10-27 04:14:01,157 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 54) no Hoare annotation was computed. [2018-10-27 04:14:01,157 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 21 54) no Hoare annotation was computed. [2018-10-27 04:14:01,157 INFO L421 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (let ((.cse16 (* 2 main_~l~0))) (let ((.cse0 (<= main_~i~0 main_~n~0)) (.cse6 (<= 1 main_~i~0)) (.cse11 (<= .cse16 2)) (.cse7 (= (mod main_~j~0 2) 0)) (.cse8 (<= (* 2 main_~j~0) 4294967296)) (.cse10 (<= main_~j~0 main_~n~0)) (.cse12 (< 0 main_~l~0)) (.cse1 (<= main_~r~0 main_~n~0)) (.cse2 (<= 2 main_~j~0)) (.cse3 (<= 1 main_~l~0)) (.cse13 (<= 2 main_~r~0)) (.cse14 (<= (+ main_~r~0 1) main_~n~0)) (.cse4 (<= (* 2 main_~n~0) 4294967294)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53))))) (or (and .cse0 .cse1 (and (and (and .cse2 .cse3) (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25)))) .cse4) .cse5) (and (and .cse6 (let ((.cse9 (and .cse11 (and .cse2 .cse12 .cse13 .cse14) (<= main_~n~0 (+ main_~l~0 999999))))) (or (and .cse7 .cse8 .cse9) (and .cse10 .cse9)))) .cse5) (and .cse0 (and .cse6 (and (and .cse11 (and (and (let ((.cse15 (and (and .cse2 (<= main_~n~0 main_~r~0)) .cse12))) (or (and .cse15 .cse7 .cse8) (and .cse15 .cse10))) .cse1) (<= .cse16 main_~n~0))) (<= (+ main_~n~0 main_~r~0) 2000000))) .cse5) (and (and (and (let ((.cse17 (and .cse13 .cse14))) (or (and .cse2 (<= .cse16 main_~r~0) .cse3 .cse17) (and .cse3 .cse17 (<= .cse16 main_~j~0)))) (<= (+ .cse16 2) main_~n~0)) .cse4) .cse5)))) [2018-10-27 04:14:01,157 INFO L421 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse1 (<= main_~r~0 main_~n~0)) (.cse7 (<= 1 main_~i~0)) (.cse12 (<= main_~j~0 main_~n~0)) (.cse10 (= (mod main_~j~0 2) 0)) (.cse11 (<= (* 2 main_~j~0) 4294967296)) (.cse8 (<= .cse3 2)) (.cse4 (<= 2 main_~j~0)) (.cse5 (<= .cse3 main_~r~0)) (.cse13 (< 0 main_~l~0)) (.cse6 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53))))) (or (and (and (let ((.cse0 (<= 1 main_~l~0)) (.cse2 (<= (* 2 main_~n~0) 4294967294))) (or (and .cse0 .cse1 .cse2 (<= .cse3 main_~j~0)) (and .cse4 .cse5 .cse0 .cse1 .cse2))) (<= (+ .cse3 2) main_~n~0)) (< 1 main_~r~0) .cse6) (and (<= main_~i~0 main_~n~0) (and .cse7 (and (and .cse8 (and (and (let ((.cse9 (and (and .cse4 (<= main_~n~0 main_~r~0)) .cse13))) (or (and .cse9 .cse10 .cse11) (and .cse9 .cse12))) .cse1) (<= .cse3 main_~n~0))) (<= (+ main_~n~0 main_~r~0) 2000000))) .cse6) (and (and .cse7 (let ((.cse14 (and .cse8 (and .cse4 .cse5 .cse13 (<= (+ main_~r~0 1) main_~n~0)) (<= main_~n~0 (+ main_~l~0 999999))))) (or (and .cse12 .cse14) (and .cse10 .cse11 .cse14)))) .cse6)))) [2018-10-27 04:14:01,158 INFO L421 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (let ((.cse20 (* 2 main_~n~0))) (let ((.cse22 (<= .cse20 4294967294))) (let ((.cse3 (and (<= 1 main_~l~0) .cse22 (<= 2 main_~r~0))) (.cse8 (* 2 main_~l~0)) (.cse19 (div main_~n~0 2)) (.cse21 (<= (+ main_~r~0 1) main_~n~0))) (let ((.cse2 (<= 2 main_~j~0)) (.cse7 (and (<= main_~l~0 (+ .cse19 1)) .cse22 (< 1 main_~r~0) .cse21)) (.cse6 (<= .cse8 main_~r~0)) (.cse13 (and .cse3 .cse21)) (.cse10 (<= .cse8 main_~j~0)) (.cse9 (<= 1 main_~i~0)) (.cse1 (<= main_~r~0 main_~n~0)) (.cse4 (<= 2 main_~l~0)) (.cse14 (<= main_~j~0 main_~n~0)) (.cse15 (= (mod main_~j~0 2) 0)) (.cse16 (<= (* 2 main_~j~0) 4294967296)) (.cse12 (<= .cse20 2000000)) (.cse0 (<= main_~i~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53))))) (or (and .cse0 .cse1 (and (and .cse2 .cse3 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25)))) .cse4) .cse5) (and (and (and (and .cse2 .cse6 .cse7) (<= (+ .cse8 2) main_~n~0)) .cse4) .cse5) (and .cse9 (and .cse7 .cse4) .cse10 (exists ((main_~l~0 Int)) (let ((.cse11 (* 2 main_~l~0))) (and (<= (+ .cse11 2) main_~n~0) (<= main_~j~0 .cse11)))) .cse5) (and (and .cse9 (and (and (and .cse12 (and .cse6 .cse13)) .cse14) .cse4)) .cse5) (and .cse9 .cse4 (and (and .cse13 .cse10) (<= .cse8 main_~n~0) .cse12 .cse15 .cse16) .cse5) (and (and .cse9 (and .cse1 (and .cse4 (let ((.cse17 (and (and (<= main_~r~0 (+ main_~l~0 999999)) .cse12) (< 0 main_~l~0) (<= main_~l~0 .cse19))) (.cse18 (<= main_~n~0 main_~r~0))) (or (and .cse14 .cse17 .cse18) (and .cse15 .cse16 .cse17 .cse18)))))) .cse0 .cse5)))))) [2018-10-27 04:14:01,158 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-10-27 04:14:01,158 INFO L421 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse11 (* 2 main_~n~0))) (let ((.cse12 (div main_~n~0 2)) (.cse8 (and (<= 1 main_~l~0) (<= .cse11 4294967294)))) (let ((.cse7 (<= 2 main_~j~0)) (.cse1 (* 2 main_~l~0)) (.cse2 (and (and (<= main_~l~0 (+ .cse12 1)) .cse8) (< 1 main_~r~0) (<= (+ main_~r~0 1) main_~n~0))) (.cse0 (<= 1 main_~i~0)) (.cse6 (<= main_~r~0 main_~n~0)) (.cse3 (<= 2 main_~l~0)) (.cse5 (<= main_~i~0 main_~n~0)) (.cse4 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53))))) (or (and .cse0 (and (<= .cse1 main_~j~0) (and .cse2 (<= .cse1 main_~n~0))) .cse3 .cse4) (and .cse5 .cse6 (and (and .cse7 .cse8 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25)))) .cse3) .cse4) (and (and .cse7 (<= .cse1 main_~r~0) .cse3 .cse2) .cse4) (and (and .cse0 (and .cse6 (and .cse3 (let ((.cse9 (and (and (<= main_~r~0 (+ main_~l~0 999999)) (<= .cse11 2000000)) (< 0 main_~l~0) (<= main_~l~0 .cse12))) (.cse10 (<= main_~n~0 main_~r~0))) (or (and (<= main_~j~0 main_~n~0) .cse9 .cse10) (and (= (mod main_~j~0 2) 0) (<= (* 2 main_~j~0) 4294967296) .cse9 .cse10)))))) .cse5 .cse4))))) [2018-10-27 04:14:01,158 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2018-10-27 04:14:01,159 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (<= 1 main_~l~0)) (.cse7 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse1 (<= (* 2 main_~n~0) 4294967294)) (.cse8 (<= (+ main_~r~0 1) main_~n~0)) (.cse6 (<= .cse11 main_~r~0)) (.cse3 (<= 1 main_~i~0)) (.cse2 (<= main_~j~0 main_~n~0)) (.cse12 (<= 2 (* 2 main_~i~0))) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse9 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse10 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25))) .cse5) (and .cse2 (and .cse6 .cse3 .cse7 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse8 .cse9 .cse10) .cse5) (and .cse2 (and .cse0 .cse7 .cse1 .cse8 .cse6 .cse3 (<= (+ .cse11 2) main_~n~0)) .cse5) (and .cse2 (<= .cse11 main_~n~0) .cse12 .cse4 (<= main_~n~0 main_~r~0) .cse5 (<= 6 (* 2 main_~j~0)) .cse9 .cse10) (and (<= .cse11 main_~j~0) .cse12 .cse4 .cse5 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse9 .cse10)))) [2018-10-27 04:14:01,159 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse12 (* 2 main_~l~0))) (let ((.cse0 (<= 1 main_~l~0)) (.cse7 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse1 (<= (* 2 main_~n~0) 4294967294)) (.cse9 (<= (+ main_~r~0 1) main_~n~0)) (.cse6 (<= .cse12 main_~r~0)) (.cse3 (<= 1 main_~i~0)) (.cse2 (<= main_~j~0 main_~n~0)) (.cse8 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse10 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse11 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25))) .cse5) (and .cse2 (and .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11) .cse5) (and .cse2 (and .cse0 .cse7 .cse1 .cse9 .cse6 .cse3 (<= (+ .cse12 2) main_~n~0)) .cse5) (and (and .cse3 (and .cse2 (<= main_~l~0 (div main_~n~0 2))) .cse4 (<= main_~n~0 main_~r~0) .cse8 (<= 2 .cse12) .cse10) .cse5) (and (<= .cse12 main_~j~0) (<= 2 (* 2 main_~i~0)) .cse4 .cse5 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse10 .cse11)))) [2018-10-27 04:14:01,159 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-27 04:14:01,159 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-10-27 04:14:01,160 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2018-10-27 04:14:01,160 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~i~0)))) (.cse2 (= (mod main_~j~0 2) 0)) (.cse1 (<= .cse11 main_~n~0)) (.cse3 (<= main_~r~0 main_~n~0)) (.cse4 (<= main_~n~0 main_~r~0)) (.cse9 (<= .cse11 main_~r~0)) (.cse12 (exists ((main_~l~0 Int)) (and (<= main_~l~0 main_~i~0) (<= main_~j~0 (* 2 main_~l~0))))) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse13 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse6 (<= (+ main_~j~0 1) main_~n~0)) (.cse10 (<= (+ main_~r~0 1) main_~n~0)) (.cse7 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse8 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse2 .cse5 .cse6 .cse10 .cse7 .cse8) (and (<= 1 main_~l~0) (<= (* 2 main_~n~0) 4294967294) .cse6 .cse9 (<= 1 main_~i~0) .cse3 (<= (+ .cse11 2) main_~n~0) .cse5) (and (<= .cse11 main_~j~0) .cse12 .cse3 .cse5 .cse6 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse7 .cse8) (and .cse12 .cse1 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse12 .cse5 .cse13 .cse6 .cse10 .cse7 .cse8)))) [2018-10-27 04:14:01,160 INFO L421 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse0 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~i~0)))) (.cse2 (= (mod main_~j~0 2) 0)) (.cse1 (<= .cse11 main_~n~0)) (.cse3 (<= main_~r~0 main_~n~0)) (.cse4 (<= main_~n~0 main_~r~0)) (.cse9 (<= .cse11 main_~r~0)) (.cse12 (exists ((main_~l~0 Int)) (and (<= main_~l~0 main_~i~0) (<= main_~j~0 (* 2 main_~l~0))))) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse13 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse6 (<= (+ main_~j~0 1) main_~n~0)) (.cse10 (<= (+ main_~r~0 1) main_~n~0)) (.cse7 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse8 (< 0 main_~l~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse2 .cse5 .cse6 .cse10 .cse7 .cse8) (and (<= 1 main_~l~0) (<= (* 2 main_~n~0) 4294967294) .cse6 .cse9 (<= 1 main_~i~0) .cse3 (<= (+ .cse11 2) main_~n~0) .cse5) (and (<= .cse11 main_~j~0) .cse12 .cse3 .cse5 .cse6 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse7 .cse8) (and .cse12 .cse1 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse12 .cse5 .cse13 .cse6 .cse10 .cse7 .cse8)))) [2018-10-27 04:14:01,160 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-10-27 04:14:01,161 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-10-27 04:14:01,161 INFO L421 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse11 (* 2 main_~l~0))) (let ((.cse1 (<= 1 main_~l~0)) (.cse7 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~n~0)))) (.cse2 (<= (* 2 main_~n~0) 4294967294)) (.cse6 (<= .cse11 main_~r~0)) (.cse0 (<= 1 main_~i~0)) (.cse3 (<= main_~j~0 main_~n~0)) (.cse8 (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0)))) (.cse4 (<= main_~r~0 main_~n~0)) (.cse5 (exists ((v_main_~j~0_53 Int)) (and (<= (* 2 v_main_~j~0_53) main_~j~0) (<= main_~i~0 v_main_~j~0_53)))) (.cse9 (<= (+ main_~n~0 main_~r~0) 2000000)) (.cse10 (< 0 main_~l~0))) (or (and (and .cse0 (and (and .cse1 .cse2 .cse3 (exists ((v_main_~l~0_25 Int)) (and (<= (* 2 v_main_~l~0_25) main_~r~0) (<= (+ main_~l~0 1) v_main_~l~0_25)))) .cse4)) .cse5) (and .cse3 (and .cse6 .cse0 .cse7 .cse8 (<= (+ main_~r~0 1) main_~n~0) .cse9 .cse10) .cse5) (and (and .cse1 .cse7 .cse2 .cse3 .cse6 .cse0 .cse4 (<= (+ .cse11 2) main_~n~0)) .cse5) (and (and .cse0 (and .cse3 (<= main_~l~0 (div main_~n~0 2))) .cse4 (<= main_~n~0 main_~r~0) .cse8 (<= 2 .cse11) .cse9) .cse5) (and (<= .cse11 main_~j~0) (<= 2 (* 2 main_~i~0)) .cse4 .cse5 (exists ((main_~l~0 Int) (main_~n~0 Int)) (and (<= 0 main_~n~0) (<= 1 main_~n~0) (<= main_~n~0 main_~r~0) (<= main_~j~0 (* 2 main_~l~0)) (<= main_~l~0 (div main_~n~0 2)))) .cse9 .cse10)))) [2018-10-27 04:14:01,161 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-10-27 04:14:01,161 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-27 04:14:01,161 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-27 04:14:01,161 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-27 04:14:01,161 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-27 04:14:01,162 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-27 04:14:01,162 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-27 04:14:01,169 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,170 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,170 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,170 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,171 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,171 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,171 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,171 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,172 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,172 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,172 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,172 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,172 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,173 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,173 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,173 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,173 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,174 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,174 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,174 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,174 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,175 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,175 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,175 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,175 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,176 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,176 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,176 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,176 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,177 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,177 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,177 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,177 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,177 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,178 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,178 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,178 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,178 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,178 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,179 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,179 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,179 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,179 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,180 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,180 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,180 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,180 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,181 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,181 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,181 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,181 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,181 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,182 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,182 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,191 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,191 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,191 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,191 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,192 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,192 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,192 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,192 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,193 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,193 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,193 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,193 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,193 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,194 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,194 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,194 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,194 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,195 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,195 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,195 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,195 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,195 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,196 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,196 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,196 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,196 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,197 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,197 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,197 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,197 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,197 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,198 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,198 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,198 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,198 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,199 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,199 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,199 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,199 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,199 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,200 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,200 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,200 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,200 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,200 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,201 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,201 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,201 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,201 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,202 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,202 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,202 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,202 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,202 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:14:01 BoogieIcfgContainer [2018-10-27 04:14:01,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:14:01,207 INFO L168 Benchmark]: Toolchain (without parser) took 151440.97 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 2.4 GB in the end (delta: -943.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-27 04:14:01,208 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 04:14:01,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.66 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-27 04:14:01,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 04:14:01,210 INFO L168 Benchmark]: Boogie Preprocessor took 28.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 04:14:01,210 INFO L168 Benchmark]: RCFGBuilder took 678.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-10-27 04:14:01,211 INFO L168 Benchmark]: TraceAbstraction took 150443.36 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 832.6 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -185.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-27 04:14:01,215 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 260.66 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 678.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 150443.36 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 832.6 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -185.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 24]: Loop Invariant [2018-10-27 04:14:01,227 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,228 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,228 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,228 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,228 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,228 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,229 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,229 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,229 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,229 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,229 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,230 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,230 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,230 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,230 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,230 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,231 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,231 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,231 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,231 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,231 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,232 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,232 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,232 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,232 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,232 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,232 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,233 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,233 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,233 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,233 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,233 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,234 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,234 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,234 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,234 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,234 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,234 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,235 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,235 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,235 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,235 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,235 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,235 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,236 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,236 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,236 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,236 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,236 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,236 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,237 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,237 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,237 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,237 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,239 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,239 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,239 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,239 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,240 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,240 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,240 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,240 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,240 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,242 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,242 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,242 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,242 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,242 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,244 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-27 04:14:01,244 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,244 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,244 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,244 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,245 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,245 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,245 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,245 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,245 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,245 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,246 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,246 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,246 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,246 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,246 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-27 04:14:01,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-27 04:14:01,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-27 04:14:01,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] Derived loop invariant: (((((((((((((((1 <= l && i <= n) && 2 * n <= 4294967294) && 2 * l <= r) && 1 <= i) && r <= n) && 2 * l + 2 <= n) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) || (((((((2 * l <= j && (\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0)) && i <= n / 2) && 2 * n <= 2000000) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && r + 1 <= n) && 0 < l) && 2 <= r)) || (((((((1 <= l && 2 * n <= 4294967294) && (\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0)) && 2 * l <= j) && (\exists main_~l~0 : int :: 2 * main_~l~0 + 2 <= n && j <= 2 * main_~l~0)) && r <= n) && 2 <= r) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53))) || (((((((((2 * j <= 4294967296 && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= i)) && 2 * l <= n) && j % 2 == 0) && r <= n) && n <= r) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && i <= n) && n + r <= 2000000) && 0 < l)) || ((((((2 * l <= j && (\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0)) && r <= n) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && (\exists main_~l~0 : int, main_~n~0 : int :: (((0 <= main_~n~0 && 1 <= main_~n~0) && main_~n~0 <= r) && j <= 2 * main_~l~0) && main_~l~0 <= main_~n~0 / 2)) && n + r <= 2000000) && 0 < l)) || (((((((((j % 2 == 0 && 2 * j <= 4294967296) && 2 * l <= r) && 1 <= i) && (\exists v_main_~j~0_39 : int, main_~l~0 : int :: ((r <= v_main_~j~0_39 && 2 * v_main_~j~0_39 <= j) && 1 <= main_~l~0) && 2 * main_~l~0 <= v_main_~j~0_39)) && r + 1 <= n) && n + r <= 2000000) && 0 < l) && i <= n) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53))) || ((((((((2 * j <= 4294967296 && 2 * l <= r) && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= i)) && j % 2 == 0) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && i <= n) && r + 1 <= n) && n + r <= 2000000) && 0 < l)) || (((((((((\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0) && 2 * l <= n) && r <= n) && n <= r) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && i <= n) && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && n + r <= 2000000) && 0 < l)) || (((((((2 * l <= r && (\exists main_~l~0 : int :: main_~l~0 <= i && j <= 2 * main_~l~0)) && (\exists v_main_~j~0_53 : int :: 2 * v_main_~j~0_53 <= j && i <= v_main_~j~0_53)) && i <= n) && (\exists main_~l~0 : int :: 1 <= main_~l~0 && 2 * main_~l~0 + 1 <= j)) && r + 1 <= n) && n + r <= 2000000) && 0 < l)) || ((i <= n && r <= n) && ((((((2 * j <= 4294967296 && 1 <= i) && 2 * l <= n) && j % 2 == 0) && n <= r) && (\exists v_main_~j~0_39 : int, main_~l~0 : int :: ((r <= v_main_~j~0_39 && 2 * v_main_~j~0_39 <= j) && 1 <= main_~l~0) && 2 * main_~l~0 <= v_main_~j~0_39)) && n + r <= 2000000) && 0 < l) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. SAFE Result, 150.3s OverallTime, 23 OverallIterations, 14 TraceHistogramMax, 56.9s AutomataDifference, 0.0s DeadEndRemovalTime, 74.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1720 SDtfs, 2109 SDslu, 6453 SDs, 0 SdLazy, 7636 SolverSat, 4246 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 2040 GetRequests, 1578 SyntacticMatches, 22 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 19 AbstIntIterations, 7 AbstIntStrong, 0.8741993136974552 AbsIntWeakeningRatio, 0.6988847583643123 AbsIntAvgWeakeningVarsNumRemoved, 14.680297397769516 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 2501 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 1910 PreInvPairs, 2495 NumberOfFragments, 4392 HoareAnnotationTreeSize, 1910 FomulaSimplifications, 70464259599 FormulaSimplificationTreeSizeReduction, 14.3s HoareSimplificationTime, 20 FomulaSimplificationsInter, 19098922446 FormulaSimplificationTreeSizeReductionInter, 60.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1682 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2404 ConstructedInterpolants, 156 QuantifiedInterpolants, 401926 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1472 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 49 InterpolantComputations, 16 PerfectInterpolantSequences, 4409/4807 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...