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-d380424 [2018-10-24 12:15:19,397 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:15:19,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:15:19,415 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:15:19,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:15:19,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:15:19,418 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:15:19,421 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:15:19,423 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:15:19,425 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:15:19,426 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:15:19,426 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:15:19,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:15:19,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:15:19,433 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:15:19,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:15:19,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:15:19,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:15:19,439 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:15:19,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:15:19,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:15:19,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:15:19,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:15:19,446 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:15:19,446 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:15:19,447 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:15:19,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:15:19,449 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:15:19,450 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:15:19,451 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:15:19,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:15:19,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:15:19,452 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:15:19,452 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:15:19,453 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:15:19,454 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:15:19,454 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-24 12:15:19,472 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:15:19,472 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:15:19,473 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:15:19,474 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:15:19,474 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:15:19,474 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:15:19,474 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:15:19,474 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:15:19,474 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:15:19,475 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:15:19,475 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:15:19,475 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:15:19,476 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:15:19,476 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:15:19,477 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:15:19,477 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:15:19,477 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:15:19,477 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:15:19,477 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:15:19,477 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:15:19,478 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:15:19,478 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:15:19,478 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:15:19,478 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:15:19,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:15:19,480 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:15:19,480 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:15:19,480 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:15:19,480 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:15:19,481 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:15:19,481 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:15:19,481 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:15:19,481 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:15:19,481 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:15:19,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:15:19,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:15:19,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:15:19,544 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:15:19,545 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:15:19,546 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-24 12:15:19,610 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/daeb11b1a/096c150a495a488097c7a5fdf13ac506/FLAGc42f8c78e [2018-10-24 12:15:20,066 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:15:20,067 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-10-24 12:15:20,074 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/daeb11b1a/096c150a495a488097c7a5fdf13ac506/FLAGc42f8c78e [2018-10-24 12:15:20,090 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/daeb11b1a/096c150a495a488097c7a5fdf13ac506 [2018-10-24 12:15:20,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:15:20,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:15:20,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:15:20,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:15:20,108 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:15:20,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:15:20" (1/1) ... [2018-10-24 12:15:20,112 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 24.10 12:15:20, skipping insertion in model container [2018-10-24 12:15:20,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:15:20" (1/1) ... [2018-10-24 12:15:20,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:15:20,148 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:15:20,313 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:15:20,317 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:15:20,338 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:15:20,354 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:15:20,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:20 WrapperNode [2018-10-24 12:15:20,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:15:20,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:15:20,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:15:20,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:15:20,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:20" (1/1) ... [2018-10-24 12:15:20,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:20" (1/1) ... [2018-10-24 12:15:20,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:15:20,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:15:20,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:15:20,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:15:20,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:20" (1/1) ... [2018-10-24 12:15:20,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:20" (1/1) ... [2018-10-24 12:15:20,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:20" (1/1) ... [2018-10-24 12:15:20,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:20" (1/1) ... [2018-10-24 12:15:20,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:20" (1/1) ... [2018-10-24 12:15:20,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:20" (1/1) ... [2018-10-24 12:15:20,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:20" (1/1) ... [2018-10-24 12:15:20,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:15:20,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:15:20,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:15:20,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:15:20,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:20" (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-24 12:15:20,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:15:20,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:15:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:15:20,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:15:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:15:20,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:15:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:15:20,493 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:15:21,027 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:15:21,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:15:21 BoogieIcfgContainer [2018-10-24 12:15:21,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:15:21,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:15:21,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:15:21,033 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:15:21,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:15:20" (1/3) ... [2018-10-24 12:15:21,034 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 24.10 12:15:21, skipping insertion in model container [2018-10-24 12:15:21,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:15:20" (2/3) ... [2018-10-24 12:15:21,034 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 24.10 12:15:21, skipping insertion in model container [2018-10-24 12:15:21,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:15:21" (3/3) ... [2018-10-24 12:15:21,036 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-10-24 12:15:21,047 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:15:21,055 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:15:21,073 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:15:21,109 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:15:21,109 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:15:21,109 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:15:21,110 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:15:21,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:15:21,110 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:15:21,110 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:15:21,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:15:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-10-24 12:15:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-24 12:15:21,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:21,140 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:15:21,142 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:21,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:21,149 INFO L82 PathProgramCache]: Analyzing trace with hash 64061581, now seen corresponding path program 1 times [2018-10-24 12:15:21,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:21,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:21,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:21,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:21,203 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:21,291 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-24 12:15:21,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:15:21,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:15:21,293 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:21,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:15:21,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:15:21,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:15:21,316 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-10-24 12:15:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:21,350 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-24 12:15:21,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:15:21,352 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-10-24 12:15:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:21,363 INFO L225 Difference]: With dead ends: 83 [2018-10-24 12:15:21,363 INFO L226 Difference]: Without dead ends: 40 [2018-10-24 12:15:21,368 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-24 12:15:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-24 12:15:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-24 12:15:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-24 12:15:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2018-10-24 12:15:21,421 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 15 [2018-10-24 12:15:21,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:21,421 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-10-24 12:15:21,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:15:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-10-24 12:15:21,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 12:15:21,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:21,423 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:15:21,423 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:21,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:21,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1525893932, now seen corresponding path program 1 times [2018-10-24 12:15:21,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:21,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:21,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:21,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:21,426 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:21,769 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-24 12:15:21,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:15:21,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 12:15:21,770 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:21,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:15:21,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:15:21,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:15:21,773 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 6 states. [2018-10-24 12:15:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:22,459 INFO L93 Difference]: Finished difference Result 77 states and 114 transitions. [2018-10-24 12:15:22,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:15:22,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-24 12:15:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:22,464 INFO L225 Difference]: With dead ends: 77 [2018-10-24 12:15:22,464 INFO L226 Difference]: Without dead ends: 75 [2018-10-24 12:15:22,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-24 12:15:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-24 12:15:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-10-24 12:15:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-24 12:15:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2018-10-24 12:15:22,507 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 16 [2018-10-24 12:15:22,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:22,507 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-10-24 12:15:22,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:15:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2018-10-24 12:15:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 12:15:22,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:22,508 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:15:22,509 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:22,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:22,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1513649831, now seen corresponding path program 1 times [2018-10-24 12:15:22,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:22,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:22,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:22,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:22,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:22,616 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-24 12:15:22,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:15:22,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 12:15:22,617 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:22,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:15:22,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:15:22,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-24 12:15:22,618 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand 6 states. [2018-10-24 12:15:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:23,258 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2018-10-24 12:15:23,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:15:23,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-24 12:15:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:23,261 INFO L225 Difference]: With dead ends: 121 [2018-10-24 12:15:23,262 INFO L226 Difference]: Without dead ends: 119 [2018-10-24 12:15:23,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-24 12:15:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-24 12:15:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-10-24 12:15:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-24 12:15:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2018-10-24 12:15:23,294 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 16 [2018-10-24 12:15:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:23,294 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2018-10-24 12:15:23,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:15:23,295 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2018-10-24 12:15:23,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 12:15:23,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:23,296 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-24 12:15:23,296 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:23,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:23,297 INFO L82 PathProgramCache]: Analyzing trace with hash -492506935, now seen corresponding path program 1 times [2018-10-24 12:15:23,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:23,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:23,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:23,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:23,299 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:23,451 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-24 12:15:23,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:23,452 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:23,453 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-24 12:15:23,455 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-24 12:15:23,506 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:23,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:23,656 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:15:23,719 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:15:23,721 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-24 12:15:23,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:23,753 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:15:23,888 INFO L232 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 74.43% of their original sizes. [2018-10-24 12:15:23,889 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:15:24,159 INFO L413 sIntCurrentIteration]: We have 20 unified AI predicates [2018-10-24 12:15:24,159 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:15:24,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:24,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-10-24 12:15:24,161 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:24,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:15:24,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:15:24,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:15:24,162 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand 10 states. [2018-10-24 12:15:28,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:28,410 INFO L93 Difference]: Finished difference Result 294 states and 467 transitions. [2018-10-24 12:15:28,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 12:15:28,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-10-24 12:15:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:28,422 INFO L225 Difference]: With dead ends: 294 [2018-10-24 12:15:28,422 INFO L226 Difference]: Without dead ends: 292 [2018-10-24 12:15:28,424 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-24 12:15:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-24 12:15:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 249. [2018-10-24 12:15:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-24 12:15:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 398 transitions. [2018-10-24 12:15:28,550 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 398 transitions. Word has length 21 [2018-10-24 12:15:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:28,551 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 398 transitions. [2018-10-24 12:15:28,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:15:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 398 transitions. [2018-10-24 12:15:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 12:15:28,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:28,554 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-24 12:15:28,556 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:28,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:28,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1032051649, now seen corresponding path program 1 times [2018-10-24 12:15:28,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:28,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:28,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:28,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:28,559 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:28,753 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-24 12:15:28,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:28,754 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:28,755 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-24 12:15:28,755 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-24 12:15:28,757 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:28,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:28,766 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:15:28,781 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:15:28,781 INFO L272 AbstractInterpreter]: Visited 20 different actions 24 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-24 12:15:28,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:28,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:15:28,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:28,789 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-24 12:15:28,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:28,800 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:15:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:28,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:15:29,157 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-24 12:15:29,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:15:29,289 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-24 12:15:29,313 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:29,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 15 [2018-10-24 12:15:29,314 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:29,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:15:29,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:15:29,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:15:29,315 INFO L87 Difference]: Start difference. First operand 249 states and 398 transitions. Second operand 5 states. [2018-10-24 12:15:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:30,387 INFO L93 Difference]: Finished difference Result 552 states and 895 transitions. [2018-10-24 12:15:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:15:30,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-10-24 12:15:30,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:30,394 INFO L225 Difference]: With dead ends: 552 [2018-10-24 12:15:30,394 INFO L226 Difference]: Without dead ends: 388 [2018-10-24 12:15:30,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:15:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-24 12:15:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 297. [2018-10-24 12:15:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-24 12:15:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 477 transitions. [2018-10-24 12:15:30,509 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 477 transitions. Word has length 21 [2018-10-24 12:15:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:30,510 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 477 transitions. [2018-10-24 12:15:30,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:15:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 477 transitions. [2018-10-24 12:15:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 12:15:30,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:30,512 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-24 12:15:30,513 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:30,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:30,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1772370613, now seen corresponding path program 1 times [2018-10-24 12:15:30,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:30,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:30,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:30,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:30,519 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:30,677 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-24 12:15:30,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:30,678 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:30,678 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-24 12:15:30,678 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-24 12:15:30,680 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:30,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:30,688 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:15:30,700 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:15:30,701 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-24 12:15:30,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:30,723 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:15:30,763 INFO L232 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 74.43% of their original sizes. [2018-10-24 12:15:30,763 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:15:31,103 INFO L413 sIntCurrentIteration]: We have 20 unified AI predicates [2018-10-24 12:15:31,104 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:15:31,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:31,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2018-10-24 12:15:31,104 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:31,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:15:31,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:15:31,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-24 12:15:31,106 INFO L87 Difference]: Start difference. First operand 297 states and 477 transitions. Second operand 9 states. [2018-10-24 12:15:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:34,545 INFO L93 Difference]: Finished difference Result 502 states and 796 transitions. [2018-10-24 12:15:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:15:34,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-10-24 12:15:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:34,549 INFO L225 Difference]: With dead ends: 502 [2018-10-24 12:15:34,550 INFO L226 Difference]: Without dead ends: 397 [2018-10-24 12:15:34,551 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:15:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-24 12:15:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 385. [2018-10-24 12:15:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-24 12:15:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 611 transitions. [2018-10-24 12:15:34,627 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 611 transitions. Word has length 21 [2018-10-24 12:15:34,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:34,627 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 611 transitions. [2018-10-24 12:15:34,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:15:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 611 transitions. [2018-10-24 12:15:34,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-24 12:15:34,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:34,629 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-24 12:15:34,629 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:34,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:34,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1278784497, now seen corresponding path program 1 times [2018-10-24 12:15:34,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:34,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:34,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:34,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:34,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:34,731 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-24 12:15:34,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:34,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:34,731 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-24 12:15:34,732 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-24 12:15:34,734 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:34,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:34,740 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:15:34,755 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:15:34,755 INFO L272 AbstractInterpreter]: Visited 23 different actions 31 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-24 12:15:34,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:34,762 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:15:34,797 INFO L232 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 75.64% of their original sizes. [2018-10-24 12:15:34,798 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:15:35,818 INFO L413 sIntCurrentIteration]: We have 27 unified AI predicates [2018-10-24 12:15:35,819 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:15:35,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:35,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-10-24 12:15:35,819 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:35,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 12:15:35,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 12:15:35,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:15:35,820 INFO L87 Difference]: Start difference. First operand 385 states and 611 transitions. Second operand 12 states. [2018-10-24 12:15:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:40,993 INFO L93 Difference]: Finished difference Result 463 states and 731 transitions. [2018-10-24 12:15:40,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 12:15:40,993 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-24 12:15:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:40,997 INFO L225 Difference]: With dead ends: 463 [2018-10-24 12:15:40,998 INFO L226 Difference]: Without dead ends: 461 [2018-10-24 12:15:40,999 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2018-10-24 12:15:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-10-24 12:15:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 399. [2018-10-24 12:15:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-24 12:15:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 632 transitions. [2018-10-24 12:15:41,104 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 632 transitions. Word has length 28 [2018-10-24 12:15:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:41,105 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 632 transitions. [2018-10-24 12:15:41,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 12:15:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 632 transitions. [2018-10-24 12:15:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-24 12:15:41,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:41,107 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-24 12:15:41,107 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:41,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:41,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1497639215, now seen corresponding path program 1 times [2018-10-24 12:15:41,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:41,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:41,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:41,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:41,115 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:41,276 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-24 12:15:41,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:41,277 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:41,277 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-24 12:15:41,277 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-24 12:15:41,280 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:41,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:41,285 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:15:41,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:15:41,301 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-24 12:15:41,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:41,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:15:41,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:41,327 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-24 12:15:41,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:41,372 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:15:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:41,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:15:41,486 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-24 12:15:41,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:15:41,517 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-24 12:15:41,538 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:41,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-10-24 12:15:41,539 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:41,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:15:41,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:15:41,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:15:41,540 INFO L87 Difference]: Start difference. First operand 399 states and 632 transitions. Second operand 6 states. [2018-10-24 12:15:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:42,221 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2018-10-24 12:15:42,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:15:42,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-10-24 12:15:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:42,228 INFO L225 Difference]: With dead ends: 727 [2018-10-24 12:15:42,228 INFO L226 Difference]: Without dead ends: 725 [2018-10-24 12:15:42,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:15:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-10-24 12:15:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 628. [2018-10-24 12:15:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-24 12:15:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1028 transitions. [2018-10-24 12:15:42,366 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1028 transitions. Word has length 28 [2018-10-24 12:15:42,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:42,366 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 1028 transitions. [2018-10-24 12:15:42,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:15:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1028 transitions. [2018-10-24 12:15:42,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-24 12:15:42,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:42,368 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-24 12:15:42,368 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:42,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:42,368 INFO L82 PathProgramCache]: Analyzing trace with hash -249410930, now seen corresponding path program 1 times [2018-10-24 12:15:42,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:42,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:42,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:42,370 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:42,596 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-24 12:15:42,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:42,596 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:42,597 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-24 12:15:42,597 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-24 12:15:42,599 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:42,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:42,606 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:15:42,621 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:15:42,622 INFO L272 AbstractInterpreter]: Visited 23 different actions 35 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-10-24 12:15:42,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:42,637 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:15:42,664 INFO L232 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 77.67% of their original sizes. [2018-10-24 12:15:42,664 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:15:42,975 INFO L413 sIntCurrentIteration]: We have 30 unified AI predicates [2018-10-24 12:15:42,976 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:15:42,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:42,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-10-24 12:15:42,976 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:42,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:15:42,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:15:42,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:15:42,977 INFO L87 Difference]: Start difference. First operand 628 states and 1028 transitions. Second operand 10 states. [2018-10-24 12:15:45,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:45,464 INFO L93 Difference]: Finished difference Result 672 states and 1091 transitions. [2018-10-24 12:15:45,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 12:15:45,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-10-24 12:15:45,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:45,470 INFO L225 Difference]: With dead ends: 672 [2018-10-24 12:15:45,470 INFO L226 Difference]: Without dead ends: 670 [2018-10-24 12:15:45,471 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:15:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-10-24 12:15:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 632. [2018-10-24 12:15:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-10-24 12:15:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1031 transitions. [2018-10-24 12:15:45,608 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1031 transitions. Word has length 31 [2018-10-24 12:15:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:45,608 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 1031 transitions. [2018-10-24 12:15:45,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:15:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1031 transitions. [2018-10-24 12:15:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-24 12:15:45,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:45,610 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-24 12:15:45,610 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:45,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:45,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1125815644, now seen corresponding path program 1 times [2018-10-24 12:15:45,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:45,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:45,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:45,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:45,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:46,240 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-24 12:15:46,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:46,241 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:46,241 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-10-24 12:15:46,241 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-24 12:15:46,244 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:46,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:46,251 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:15:46,271 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:15:46,271 INFO L272 AbstractInterpreter]: Visited 26 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-24 12:15:46,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:46,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:15:46,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:46,310 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-24 12:15:46,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:46,327 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:15:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:46,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:15:46,725 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-24 12:15:46,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:15:46,860 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-24 12:15:46,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:15:46,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 19 [2018-10-24 12:15:46,881 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:15:46,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 12:15:46,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 12:15:46,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-10-24 12:15:46,882 INFO L87 Difference]: Start difference. First operand 632 states and 1031 transitions. Second operand 14 states. [2018-10-24 12:15:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:49,271 INFO L93 Difference]: Finished difference Result 981 states and 1602 transitions. [2018-10-24 12:15:49,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 12:15:49,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-10-24 12:15:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:49,279 INFO L225 Difference]: With dead ends: 981 [2018-10-24 12:15:49,279 INFO L226 Difference]: Without dead ends: 979 [2018-10-24 12:15:49,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-10-24 12:15:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-10-24 12:15:49,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 893. [2018-10-24 12:15:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-10-24 12:15:49,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1461 transitions. [2018-10-24 12:15:49,573 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1461 transitions. Word has length 33 [2018-10-24 12:15:49,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:49,575 INFO L481 AbstractCegarLoop]: Abstraction has 893 states and 1461 transitions. [2018-10-24 12:15:49,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 12:15:49,575 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1461 transitions. [2018-10-24 12:15:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-24 12:15:49,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:49,576 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-24 12:15:49,576 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:49,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:49,577 INFO L82 PathProgramCache]: Analyzing trace with hash 797412390, now seen corresponding path program 1 times [2018-10-24 12:15:49,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:49,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:49,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:49,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:49,582 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:50,072 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-24 12:15:50,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:50,073 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:50,073 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-10-24 12:15:50,074 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-24 12:15:50,076 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:50,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:50,080 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:15:50,092 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:15:50,093 INFO L272 AbstractInterpreter]: Visited 26 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-24 12:15:50,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:50,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:15:50,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:50,100 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-24 12:15:50,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:50,109 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:15:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:50,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:15:50,439 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-24 12:15:50,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:15:50,543 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-24 12:15:50,564 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:50,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [9] total 17 [2018-10-24 12:15:50,564 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:50,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:15:50,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:15:50,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:15:50,565 INFO L87 Difference]: Start difference. First operand 893 states and 1461 transitions. Second operand 8 states. [2018-10-24 12:15:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:51,041 INFO L93 Difference]: Finished difference Result 953 states and 1541 transitions. [2018-10-24 12:15:51,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:15:51,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-10-24 12:15:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:51,049 INFO L225 Difference]: With dead ends: 953 [2018-10-24 12:15:51,049 INFO L226 Difference]: Without dead ends: 951 [2018-10-24 12:15:51,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:15:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-10-24 12:15:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 899. [2018-10-24 12:15:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-24 12:15:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1459 transitions. [2018-10-24 12:15:51,266 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1459 transitions. Word has length 33 [2018-10-24 12:15:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:51,266 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 1459 transitions. [2018-10-24 12:15:51,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:15:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1459 transitions. [2018-10-24 12:15:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-24 12:15:51,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:51,268 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-24 12:15:51,268 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:51,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502379, now seen corresponding path program 1 times [2018-10-24 12:15:51,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:51,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:51,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:51,479 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-24 12:15:51,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:51,480 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:51,481 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-10-24 12:15:51,481 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-24 12:15:51,483 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:51,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:51,487 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:15:51,509 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:15:51,509 INFO L272 AbstractInterpreter]: Visited 29 different actions 49 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-24 12:15:51,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:51,529 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:15:51,571 INFO L232 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 79.08% of their original sizes. [2018-10-24 12:15:51,571 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:15:51,937 INFO L413 sIntCurrentIteration]: We have 42 unified AI predicates [2018-10-24 12:15:51,937 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:15:51,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:51,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2018-10-24 12:15:51,938 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:51,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 12:15:51,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 12:15:51,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:15:51,939 INFO L87 Difference]: Start difference. First operand 899 states and 1459 transitions. Second operand 12 states. [2018-10-24 12:15:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:57,199 INFO L93 Difference]: Finished difference Result 984 states and 1581 transitions. [2018-10-24 12:15:57,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 12:15:57,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-10-24 12:15:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:57,205 INFO L225 Difference]: With dead ends: 984 [2018-10-24 12:15:57,205 INFO L226 Difference]: Without dead ends: 982 [2018-10-24 12:15:57,206 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:15:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2018-10-24 12:15:57,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 888. [2018-10-24 12:15:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-10-24 12:15:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1427 transitions. [2018-10-24 12:15:57,455 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1427 transitions. Word has length 43 [2018-10-24 12:15:57,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:57,456 INFO L481 AbstractCegarLoop]: Abstraction has 888 states and 1427 transitions. [2018-10-24 12:15:57,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 12:15:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1427 transitions. [2018-10-24 12:15:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-24 12:15:57,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:57,457 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-24 12:15:57,457 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:57,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1887033901, now seen corresponding path program 1 times [2018-10-24 12:15:57,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:57,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:57,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:57,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:57,542 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-24 12:15:57,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:57,542 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:57,543 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-10-24 12:15:57,543 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-24 12:15:57,544 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:57,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:57,549 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:15:57,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:15:57,565 INFO L272 AbstractInterpreter]: Visited 30 different actions 52 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-10-24 12:15:57,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:57,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:15:57,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:57,600 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-24 12:15:57,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:57,616 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:15:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:57,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:15:57,739 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-24 12:15:57,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:15:57,790 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-24 12:15:57,811 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:57,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 11 [2018-10-24 12:15:57,812 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:57,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:15:57,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:15:57,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:15:57,813 INFO L87 Difference]: Start difference. First operand 888 states and 1427 transitions. Second operand 4 states. [2018-10-24 12:15:57,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:57,970 INFO L93 Difference]: Finished difference Result 1039 states and 1656 transitions. [2018-10-24 12:15:57,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:15:57,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-10-24 12:15:57,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:57,975 INFO L225 Difference]: With dead ends: 1039 [2018-10-24 12:15:57,975 INFO L226 Difference]: Without dead ends: 680 [2018-10-24 12:15:57,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:15:57,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-10-24 12:15:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2018-10-24 12:15:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-24 12:15:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1076 transitions. [2018-10-24 12:15:58,136 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1076 transitions. Word has length 43 [2018-10-24 12:15:58,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:58,137 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 1076 transitions. [2018-10-24 12:15:58,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:15:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1076 transitions. [2018-10-24 12:15:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-24 12:15:58,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:58,138 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-24 12:15:58,138 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:58,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:58,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1269153316, now seen corresponding path program 1 times [2018-10-24 12:15:58,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:58,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:58,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:58,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:58,140 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:58,268 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-24 12:15:58,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:58,269 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:58,269 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-10-24 12:15:58,269 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-24 12:15:58,270 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:58,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:58,274 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:15:58,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:15:58,288 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-24 12:15:58,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:58,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:15:58,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:58,295 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-24 12:15:58,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:58,303 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:15:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:58,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:15:58,396 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-24 12:15:58,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:15:58,442 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-24 12:15:58,463 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:15:58,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 11 [2018-10-24 12:15:58,463 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:15:58,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:15:58,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:15:58,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:15:58,464 INFO L87 Difference]: Start difference. First operand 680 states and 1076 transitions. Second operand 7 states. [2018-10-24 12:15:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:15:58,877 INFO L93 Difference]: Finished difference Result 690 states and 1084 transitions. [2018-10-24 12:15:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:15:58,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-10-24 12:15:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:15:58,883 INFO L225 Difference]: With dead ends: 690 [2018-10-24 12:15:58,883 INFO L226 Difference]: Without dead ends: 688 [2018-10-24 12:15:58,884 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-24 12:15:58,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-24 12:15:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 682. [2018-10-24 12:15:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-10-24 12:15:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1075 transitions. [2018-10-24 12:15:59,045 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1075 transitions. Word has length 45 [2018-10-24 12:15:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:15:59,046 INFO L481 AbstractCegarLoop]: Abstraction has 682 states and 1075 transitions. [2018-10-24 12:15:59,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:15:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1075 transitions. [2018-10-24 12:15:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-24 12:15:59,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:15:59,047 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-24 12:15:59,047 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:15:59,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:59,048 INFO L82 PathProgramCache]: Analyzing trace with hash -893792404, now seen corresponding path program 1 times [2018-10-24 12:15:59,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:15:59,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:59,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:59,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:15:59,049 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:15:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:59,179 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-24 12:15:59,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:59,180 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:15:59,180 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-10-24 12:15:59,180 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-24 12:15:59,181 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:15:59,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:15:59,186 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:15:59,200 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:15:59,200 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-24 12:15:59,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:15:59,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:15:59,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:15:59,206 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-24 12:15:59,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:15:59,215 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:15:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:15:59,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:15:59,340 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-24 12:15:59,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:15:59,463 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-24 12:15:59,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:15:59,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2018-10-24 12:15:59,484 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:15:59,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:15:59,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:15:59,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:15:59,485 INFO L87 Difference]: Start difference. First operand 682 states and 1075 transitions. Second operand 11 states. [2018-10-24 12:16:00,521 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 12:16:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:16:02,229 INFO L93 Difference]: Finished difference Result 1359 states and 2199 transitions. [2018-10-24 12:16:02,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 12:16:02,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-10-24 12:16:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:16:02,237 INFO L225 Difference]: With dead ends: 1359 [2018-10-24 12:16:02,237 INFO L226 Difference]: Without dead ends: 1035 [2018-10-24 12:16:02,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-10-24 12:16:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-10-24 12:16:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 806. [2018-10-24 12:16:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-24 12:16:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1291 transitions. [2018-10-24 12:16:02,437 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1291 transitions. Word has length 50 [2018-10-24 12:16:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:16:02,438 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1291 transitions. [2018-10-24 12:16:02,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:16:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1291 transitions. [2018-10-24 12:16:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-24 12:16:02,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:16:02,440 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-24 12:16:02,440 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:16:02,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:02,440 INFO L82 PathProgramCache]: Analyzing trace with hash -254314127, now seen corresponding path program 1 times [2018-10-24 12:16:02,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:16:02,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:02,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:02,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:02,441 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:16:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:02,934 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-24 12:16:02,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:02,935 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:16:02,935 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-10-24 12:16:02,935 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-24 12:16:02,937 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:16:02,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:16:02,941 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:16:02,961 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:16:02,961 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-24 12:16:02,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:02,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:16:02,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:02,979 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-24 12:16:02,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:02,987 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:16:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:03,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:16:03,180 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-24 12:16:03,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:16:03,373 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-24 12:16:03,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:16:03,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2018-10-24 12:16:03,394 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:16:03,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 12:16:03,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 12:16:03,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-10-24 12:16:03,395 INFO L87 Difference]: Start difference. First operand 806 states and 1291 transitions. Second operand 14 states. [2018-10-24 12:16:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:16:05,311 INFO L93 Difference]: Finished difference Result 1054 states and 1688 transitions. [2018-10-24 12:16:05,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 12:16:05,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-10-24 12:16:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:16:05,321 INFO L225 Difference]: With dead ends: 1054 [2018-10-24 12:16:05,322 INFO L226 Difference]: Without dead ends: 1052 [2018-10-24 12:16:05,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2018-10-24 12:16:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-10-24 12:16:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 824. [2018-10-24 12:16:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2018-10-24 12:16:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1317 transitions. [2018-10-24 12:16:05,516 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1317 transitions. Word has length 60 [2018-10-24 12:16:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:16:05,517 INFO L481 AbstractCegarLoop]: Abstraction has 824 states and 1317 transitions. [2018-10-24 12:16:05,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 12:16:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1317 transitions. [2018-10-24 12:16:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-24 12:16:05,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:16:05,518 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-24 12:16:05,519 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:16:05,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:05,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1004327087, now seen corresponding path program 1 times [2018-10-24 12:16:05,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:16:05,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:05,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:05,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:05,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:16:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:05,617 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-24 12:16:05,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:05,618 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:16:05,618 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-10-24 12:16:05,618 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-24 12:16:05,620 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:16:05,620 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:16:05,623 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:16:05,752 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:16:05,752 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-24 12:16:05,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:05,762 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:16:05,818 INFO L232 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 76.37% of their original sizes. [2018-10-24 12:16:05,819 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:16:06,069 INFO L413 sIntCurrentIteration]: We have 59 unified AI predicates [2018-10-24 12:16:06,069 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:16:06,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:16:06,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [8] total 22 [2018-10-24 12:16:06,072 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:16:06,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 12:16:06,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 12:16:06,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:16:06,073 INFO L87 Difference]: Start difference. First operand 824 states and 1317 transitions. Second operand 16 states. [2018-10-24 12:16:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:16:14,566 INFO L93 Difference]: Finished difference Result 1475 states and 2366 transitions. [2018-10-24 12:16:14,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-24 12:16:14,566 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-10-24 12:16:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:16:14,572 INFO L225 Difference]: With dead ends: 1475 [2018-10-24 12:16:14,572 INFO L226 Difference]: Without dead ends: 1052 [2018-10-24 12:16:14,576 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-24 12:16:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-10-24 12:16:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 966. [2018-10-24 12:16:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-10-24 12:16:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1544 transitions. [2018-10-24 12:16:14,797 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1544 transitions. Word has length 60 [2018-10-24 12:16:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:16:14,798 INFO L481 AbstractCegarLoop]: Abstraction has 966 states and 1544 transitions. [2018-10-24 12:16:14,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 12:16:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1544 transitions. [2018-10-24 12:16:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-24 12:16:14,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:16:14,800 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-24 12:16:14,800 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:16:14,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:14,801 INFO L82 PathProgramCache]: Analyzing trace with hash -283854137, now seen corresponding path program 1 times [2018-10-24 12:16:14,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:16:14,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:14,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:14,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:14,802 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:16:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:14,972 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-24 12:16:14,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:14,972 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:16:14,972 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-10-24 12:16:14,973 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-24 12:16:14,974 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:16:14,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:16:14,977 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:16:15,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:16:15,007 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-24 12:16:15,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:15,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:16:15,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:15,027 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-24 12:16:15,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:15,036 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:16:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:15,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:16:15,150 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-24 12:16:15,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:16:15,220 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-24 12:16:15,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-24 12:16:15,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2018-10-24 12:16:15,240 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:16:15,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:16:15,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:16:15,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:16:15,241 INFO L87 Difference]: Start difference. First operand 966 states and 1544 transitions. Second operand 6 states. [2018-10-24 12:16:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:16:15,844 INFO L93 Difference]: Finished difference Result 1860 states and 2967 transitions. [2018-10-24 12:16:15,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:16:15,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-10-24 12:16:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:16:15,850 INFO L225 Difference]: With dead ends: 1860 [2018-10-24 12:16:15,850 INFO L226 Difference]: Without dead ends: 971 [2018-10-24 12:16:15,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:16:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-10-24 12:16:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 914. [2018-10-24 12:16:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-10-24 12:16:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1448 transitions. [2018-10-24 12:16:16,076 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1448 transitions. Word has length 69 [2018-10-24 12:16:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:16:16,076 INFO L481 AbstractCegarLoop]: Abstraction has 914 states and 1448 transitions. [2018-10-24 12:16:16,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:16:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1448 transitions. [2018-10-24 12:16:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-24 12:16:16,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:16:16,078 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-24 12:16:16,078 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:16:16,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:16,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1790518670, now seen corresponding path program 1 times [2018-10-24 12:16:16,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:16:16,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:16,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:16,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:16,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:16:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:16,263 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-24 12:16:16,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:16,263 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:16:16,263 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-10-24 12:16:16,263 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-24 12:16:16,265 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:16:16,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:16:16,268 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:16:16,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:16:16,298 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-24 12:16:16,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:16,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:16:16,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:16,314 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-24 12:16:16,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:16,322 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:16:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:16,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:16:16,703 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-24 12:16:16,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:16:16,837 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-24 12:16:16,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:16:16,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2018-10-24 12:16:16,858 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:16:16,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 12:16:16,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 12:16:16,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=353, Unknown=1, NotChecked=0, Total=420 [2018-10-24 12:16:16,859 INFO L87 Difference]: Start difference. First operand 914 states and 1448 transitions. Second operand 16 states. [2018-10-24 12:16:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:16:19,633 INFO L93 Difference]: Finished difference Result 1323 states and 2089 transitions. [2018-10-24 12:16:19,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 12:16:19,633 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-10-24 12:16:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:16:19,641 INFO L225 Difference]: With dead ends: 1323 [2018-10-24 12:16:19,642 INFO L226 Difference]: Without dead ends: 1321 [2018-10-24 12:16:19,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=931, Unknown=1, NotChecked=0, Total=1190 [2018-10-24 12:16:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2018-10-24 12:16:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1054. [2018-10-24 12:16:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-10-24 12:16:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1685 transitions. [2018-10-24 12:16:19,933 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1685 transitions. Word has length 72 [2018-10-24 12:16:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:16:19,933 INFO L481 AbstractCegarLoop]: Abstraction has 1054 states and 1685 transitions. [2018-10-24 12:16:19,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 12:16:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1685 transitions. [2018-10-24 12:16:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-24 12:16:19,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:16:19,935 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-24 12:16:19,935 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:16:19,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:19,936 INFO L82 PathProgramCache]: Analyzing trace with hash -71103634, now seen corresponding path program 1 times [2018-10-24 12:16:19,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:16:19,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:19,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:19,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:16:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:20,065 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-24 12:16:20,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:20,065 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:16:20,065 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-10-24 12:16:20,065 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-24 12:16:20,066 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:16:20,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:16:20,069 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:16:20,223 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:16:20,224 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-24 12:16:20,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:20,249 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:16:20,306 INFO L232 lantSequenceWeakener]: Weakened 56 states. On average, predicates are now at 77.38% of their original sizes. [2018-10-24 12:16:20,307 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:16:20,912 INFO L413 sIntCurrentIteration]: We have 71 unified AI predicates [2018-10-24 12:16:20,912 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:16:20,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:16:20,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [9] total 25 [2018-10-24 12:16:20,913 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:16:20,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-24 12:16:20,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-24 12:16:20,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:16:20,914 INFO L87 Difference]: Start difference. First operand 1054 states and 1685 transitions. Second operand 18 states. [2018-10-24 12:16:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:16:31,371 INFO L93 Difference]: Finished difference Result 1759 states and 2796 transitions. [2018-10-24 12:16:31,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-24 12:16:31,371 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2018-10-24 12:16:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:16:31,379 INFO L225 Difference]: With dead ends: 1759 [2018-10-24 12:16:31,380 INFO L226 Difference]: Without dead ends: 1270 [2018-10-24 12:16:31,383 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=707, Invalid=2599, Unknown=0, NotChecked=0, Total=3306 [2018-10-24 12:16:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-10-24 12:16:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1066. [2018-10-24 12:16:31,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2018-10-24 12:16:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1694 transitions. [2018-10-24 12:16:31,649 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1694 transitions. Word has length 72 [2018-10-24 12:16:31,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:16:31,649 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1694 transitions. [2018-10-24 12:16:31,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-24 12:16:31,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1694 transitions. [2018-10-24 12:16:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-24 12:16:31,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:16:31,651 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-24 12:16:31,652 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:16:31,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash -217479284, now seen corresponding path program 1 times [2018-10-24 12:16:31,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:16:31,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:31,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:31,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:31,653 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:16:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:32,266 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-24 12:16:32,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:32,267 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:16:32,267 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-10-24 12:16:32,267 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-24 12:16:32,268 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:16:32,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:16:32,272 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:16:32,306 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:16:32,306 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-24 12:16:32,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:32,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:16:32,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:32,347 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-24 12:16:32,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:32,360 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:16:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:32,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:16:32,438 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-24 12:16:32,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:16:32,482 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-24 12:16:32,502 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:16:32,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 10 [2018-10-24 12:16:32,502 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:16:32,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:16:32,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:16:32,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:16:32,503 INFO L87 Difference]: Start difference. First operand 1066 states and 1694 transitions. Second operand 7 states. [2018-10-24 12:16:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:16:33,048 INFO L93 Difference]: Finished difference Result 1166 states and 1830 transitions. [2018-10-24 12:16:33,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:16:33,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-10-24 12:16:33,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:16:33,054 INFO L225 Difference]: With dead ends: 1166 [2018-10-24 12:16:33,055 INFO L226 Difference]: Without dead ends: 1164 [2018-10-24 12:16:33,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-24 12:16:33,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-10-24 12:16:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1086. [2018-10-24 12:16:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-10-24 12:16:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1709 transitions. [2018-10-24 12:16:33,316 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1709 transitions. Word has length 79 [2018-10-24 12:16:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:16:33,317 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1709 transitions. [2018-10-24 12:16:33,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:16:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1709 transitions. [2018-10-24 12:16:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-24 12:16:33,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:16:33,320 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-24 12:16:33,320 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:16:33,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:33,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1211133516, now seen corresponding path program 1 times [2018-10-24 12:16:33,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:16:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:33,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:33,321 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:16:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:33,418 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-24 12:16:33,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:33,418 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:16:33,418 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 87 with the following transitions: [2018-10-24 12:16:33,418 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-24 12:16:33,420 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:16:33,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:16:33,423 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:16:33,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:16:33,504 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-24 12:16:33,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:33,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:16:33,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:33,509 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-24 12:16:33,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:33,523 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:16:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:33,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:16:33,706 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-24 12:16:33,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:16:33,759 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-24 12:16:33,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:16:33,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2018-10-24 12:16:33,780 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:16:33,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:16:33,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:16:33,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:16:33,781 INFO L87 Difference]: Start difference. First operand 1086 states and 1709 transitions. Second operand 13 states. [2018-10-24 12:16:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:16:35,693 INFO L93 Difference]: Finished difference Result 1851 states and 3014 transitions. [2018-10-24 12:16:35,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 12:16:35,695 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-10-24 12:16:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:16:35,708 INFO L225 Difference]: With dead ends: 1851 [2018-10-24 12:16:35,708 INFO L226 Difference]: Without dead ends: 1849 [2018-10-24 12:16:35,710 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-24 12:16:35,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2018-10-24 12:16:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1098. [2018-10-24 12:16:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2018-10-24 12:16:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1718 transitions. [2018-10-24 12:16:36,020 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1718 transitions. Word has length 86 [2018-10-24 12:16:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:16:36,021 INFO L481 AbstractCegarLoop]: Abstraction has 1098 states and 1718 transitions. [2018-10-24 12:16:36,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:16:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1718 transitions. [2018-10-24 12:16:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-24 12:16:36,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:16:36,024 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-24 12:16:36,024 INFO L424 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:16:36,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:16:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1543835351, now seen corresponding path program 2 times [2018-10-24 12:16:36,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:16:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:36,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:16:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:16:36,025 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:16:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:16:36,273 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-24 12:16:36,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:36,273 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:16:36,273 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:16:36,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:16:36,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:16:36,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 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-24 12:16:36,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:16:36,284 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:16:36,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-24 12:16:36,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:16:36,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:16:36,487 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-24 12:16:36,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:16:36,576 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-24 12:16:36,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:16:36,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2018-10-24 12:16:36,599 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:16:36,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 12:16:36,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 12:16:36,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:16:36,600 INFO L87 Difference]: Start difference. First operand 1098 states and 1718 transitions. Second operand 14 states. [2018-10-24 12:16:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:16:37,584 INFO L93 Difference]: Finished difference Result 1238 states and 1922 transitions. [2018-10-24 12:16:37,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 12:16:37,585 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2018-10-24 12:16:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:16:37,585 INFO L225 Difference]: With dead ends: 1238 [2018-10-24 12:16:37,585 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 12:16:37,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-10-24 12:16:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 12:16:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 12:16:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 12:16:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 12:16:37,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2018-10-24 12:16:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:16:37,594 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 12:16:37,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 12:16:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 12:16:37,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 12:16:37,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 12:16:37,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:37,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:37,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:37,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:37,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:37,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:37,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:37,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:37,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:37,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:37,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:38,566 WARN L179 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 460 DAG size of output: 288 [2018-10-24 12:16:39,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:39,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:39,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:39,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,271 WARN L179 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 457 DAG size of output: 426 [2018-10-24 12:16:40,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:40,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:41,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:41,011 WARN L179 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 460 DAG size of output: 288 [2018-10-24 12:16:41,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:41,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:41,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:41,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,484 WARN L179 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 462 DAG size of output: 438 [2018-10-24 12:16:42,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,638 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 227 [2018-10-24 12:16:42,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,760 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 226 [2018-10-24 12:16:42,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:42,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,405 WARN L179 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 541 DAG size of output: 373 [2018-10-24 12:16:43,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,929 WARN L179 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 463 DAG size of output: 286 [2018-10-24 12:16:43,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:43,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,861 WARN L179 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 484 DAG size of output: 431 [2018-10-24 12:16:44,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:44,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:45,792 WARN L179 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 632 DAG size of output: 455 [2018-10-24 12:16:45,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:46,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:46,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:46,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:46,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:46,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:46,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:46,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:46,987 WARN L179 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 521 DAG size of output: 479 [2018-10-24 12:16:47,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:47,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,235 WARN L179 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 728 DAG size of output: 545 [2018-10-24 12:16:48,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:16:48,715 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 266 [2018-10-24 12:16:51,979 WARN L179 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 269 DAG size of output: 69 [2018-10-24 12:16:59,999 WARN L179 SmtUtils]: Spent 8.01 s on a formula simplification. DAG size of input: 424 DAG size of output: 75 [2018-10-24 12:17:02,754 WARN L179 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 269 DAG size of output: 69 [2018-10-24 12:17:08,770 WARN L179 SmtUtils]: Spent 6.01 s on a formula simplification. DAG size of input: 435 DAG size of output: 91 [2018-10-24 12:17:11,135 WARN L179 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 221 DAG size of output: 61 [2018-10-24 12:17:13,501 WARN L179 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 220 DAG size of output: 61 [2018-10-24 12:17:16,937 WARN L179 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 350 DAG size of output: 68 [2018-10-24 12:17:19,323 WARN L179 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 221 DAG size of output: 61 [2018-10-24 12:17:21,939 WARN L179 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 268 DAG size of output: 69 [2018-10-24 12:17:26,713 WARN L179 SmtUtils]: Spent 4.77 s on a formula simplification. DAG size of input: 421 DAG size of output: 70 [2018-10-24 12:17:29,087 WARN L179 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 219 DAG size of output: 61 [2018-10-24 12:17:34,301 WARN L179 SmtUtils]: Spent 5.21 s on a formula simplification. DAG size of input: 423 DAG size of output: 71 [2018-10-24 12:17:40,423 WARN L179 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 470 DAG size of output: 83 [2018-10-24 12:17:46,591 WARN L179 SmtUtils]: Spent 6.16 s on a formula simplification. DAG size of input: 508 DAG size of output: 59 [2018-10-24 12:17:49,639 WARN L179 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 254 DAG size of output: 81 [2018-10-24 12:17:49,642 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-24 12:17:49,642 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:17:49,642 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:17:49,642 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-24 12:17:49,642 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-24 12:17:49,643 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 12:17:49,643 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-24 12:17:49,643 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2018-10-24 12:17:49,643 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-24 12:17:49,643 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-24 12:17:49,643 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 44) no Hoare annotation was computed. [2018-10-24 12:17:49,644 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-24 12:17:49,644 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 21 54) no Hoare annotation was computed. [2018-10-24 12:17:49,644 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-10-24 12:17:49,644 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2018-10-24 12:17:49,644 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-10-24 12:17:49,644 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-24 12:17:49,644 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-24 12:17:49,645 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2018-10-24 12:17:49,645 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-24 12:17:49,645 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 54) no Hoare annotation was computed. [2018-10-24 12:17:49,645 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 21 54) no Hoare annotation was computed. [2018-10-24 12:17:49,645 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-24 12:17:49,646 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-24 12:17:49,646 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-24 12:17:49,646 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-10-24 12:17:49,646 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-24 12:17:49,646 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2018-10-24 12:17:49,647 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-24 12:17:49,647 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-24 12:17:49,647 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-24 12:17:49,647 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-10-24 12:17:49,647 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2018-10-24 12:17:49,647 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-24 12:17:49,648 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-24 12:17:49,648 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-10-24 12:17:49,648 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-10-24 12:17:49,648 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-24 12:17:49,648 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-10-24 12:17:49,648 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-24 12:17:49,648 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-24 12:17:49,648 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-24 12:17:49,648 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-24 12:17:49,649 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-24 12:17:49,649 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-24 12:17:49,656 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,657 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,657 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,657 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,658 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,658 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,658 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,658 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,659 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,659 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,659 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,659 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,660 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,660 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,660 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,660 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,661 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,661 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,661 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,661 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,662 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,662 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,662 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,662 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,662 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,663 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,663 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,663 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,663 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,664 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,664 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,664 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,664 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,664 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,665 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,665 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,665 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,665 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,666 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,666 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,666 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,666 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,667 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,667 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,667 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,667 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,667 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,668 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,668 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,668 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,668 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,668 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,669 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,669 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,678 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,678 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,679 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,679 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,679 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,679 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,679 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,680 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,680 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,680 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,680 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,683 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,683 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,683 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,683 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,683 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,684 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,684 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,684 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,684 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,684 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,685 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,685 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,685 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,685 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,686 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,686 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,686 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,686 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,686 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,687 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,687 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,687 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,687 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,687 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,688 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,688 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,688 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,688 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,688 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,689 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,689 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,689 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,689 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,689 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,690 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:17:49 BoogieIcfgContainer [2018-10-24 12:17:49,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:17:49,695 INFO L168 Benchmark]: Toolchain (without parser) took 149593.36 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-24 12:17:49,696 INFO L168 Benchmark]: CDTParser took 0.23 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-24 12:17:49,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.88 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-24 12:17:49,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.17 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-24 12:17:49,697 INFO L168 Benchmark]: Boogie Preprocessor took 43.91 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-24 12:17:49,698 INFO L168 Benchmark]: RCFGBuilder took 601.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.7 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-10-24 12:17:49,698 INFO L168 Benchmark]: TraceAbstraction took 148664.67 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 978.3 MB). Free memory was 2.2 GB in the beginning and 3.0 GB in the end (delta: -796.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-24 12:17:49,702 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.23 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 251.88 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.17 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 43.91 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 601.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.7 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 148664.67 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 978.3 MB). Free memory was 2.2 GB in the beginning and 3.0 GB in the end (delta: -796.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_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-24 12:17:49,714 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,719 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,719 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,719 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,719 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,719 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,719 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,720 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,720 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,720 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,720 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,720 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,721 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,721 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,721 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,721 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,721 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,722 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,722 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,722 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,722 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,722 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,723 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,723 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,723 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,723 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,723 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,724 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,724 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,724 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,724 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,724 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,724 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,725 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,725 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,726 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,727 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,727 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,727 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,727 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,728 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,728 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,728 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,728 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,728 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,729 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,729 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,729 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,729 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,729 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,730 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,730 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,730 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,730 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,730 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,730 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,731 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,731 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,731 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,731 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,731 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2018-10-24 12:17:49,732 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,732 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,732 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,732 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,732 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,733 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,733 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,733 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,733 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,733 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,733 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,734 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,734 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,734 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,734 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,734 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,734 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,735 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,735 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,735 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,735 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_53,QUANTIFIED] [2018-10-24 12:17:49,735 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,735 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,736 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,736 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_39,QUANTIFIED] [2018-10-24 12:17:49,736 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,736 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-10-24 12:17:49,736 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, 148.5s OverallTime, 23 OverallIterations, 14 TraceHistogramMax, 57.8s AutomataDifference, 0.0s DeadEndRemovalTime, 72.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1720 SDtfs, 2109 SDslu, 6453 SDs, 0 SdLazy, 7636 SolverSat, 4246 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 2040 GetRequests, 1578 SyntacticMatches, 22 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 14.8s 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.4s 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, 11.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 19098922446 FormulaSimplificationTreeSizeReductionInter, 60.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.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...